Trap Avoidance and Protection Schemes in Networks with Shared Risk Link Groups

Journal of Lightwave Technology

Volumn 21, Issue 11, 2003, Pages 2683-2693

  Xu, Dahai ^a   Xiong, Yizhi ^a   Qiao, Chunming ^a   Li, Guangzhi ^b  

^a the State University of New York   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Bandwidth sharing; Dynamic provisioning; Optical network; Protection; Shared risk link groups; Trap

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; FREQUENCY ALLOCATION; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTICAL LINKS; ROUTERS; TELECOMMUNICATION TRAFFIC;

BANDWIDTH SHARING; DYNAMIC PROVISIONING; OPTICAL NETWORKS; SHARED RISK LINK GROUPS (SRLG);

TELECOMMUNICATION NETWORKS;

EID: 0346342622     PISSN: 07338724     EISSN: None     Source Type: Journal    
DOI: 10.1109/JLT.2003.819545     Document Type: Article

References (30)

1. G. Ellinas et al., "Routing and restoration architectures in mesh optical networks," Opt. Network Mag., vol. 4, no. 1, pp. 91-106, 2003.
2. P. Sebos et al., "Effectiveness of shared risk link group auto-discovety in optical networks," in OFC'02, 2002, p. Th05.
3. J. Luciani et al., "IP over optical networks a framework," in Internet Draft, Work in Progress, Mar. 2001.
4. D. Papadimitriou et al., "Inference of shared risk link groups," in Internet Draft, Work in Progress, Nov. 2001.
5. P. Sebos et al., "Auto-discovery of shared risk link groups," in OFC'01, 2001. p. WDD3.
6. J. Doucette and W. D. Grover, "Capacity design studies of span-restorable mesh transport networks with shared-risk link group (SRLG) effects," in Proc. SPIE Opticomm 2002, vol. 4874, 2002, pp. 25-38.
7. J. Hu, "Diverse routing in optical mesh networks," IEEE Trans. Commun., vol. 51, pp. 489-494, 2003.
8. G. Li, B. Doverspike, and C. Kalmanek, "Fiber span failure protection in mesh optical networks," Opt. Networks Mag., vol. 3, no. 3, May/June 2002.
9. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. Norwell, MA: Kluwer, 1999.
10. K. Lee and K. Siu, "An algorithmic framework for protection switching WDM networks," in NFOEC'01, July 2001, pp. 402-410.
11. J. Suurballe and R. Taijan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
12. C. Li, S. T. McCormick, and D. Simchi-Levi, "Finding disjoint paths with different path costs: Complexity and algorithms," Networks, vol. 22, pp. 653-667, 1992.
13. S. D. Nikolopoulos, A. Pitsillides, and D. Tipper, "Addressing network survivability issues by finding the K-best paths through a trellis graph," presented at the INFOCOM'97, 1997.
14. R. Bhandari, "Optimal diverse routing in telecommunications fiber networks," presented at the INFOCOM'94, 1994.
15. D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of K-shortest paths and maximum flow routing for network facility restoration," IEEE J. Select. Areas Commun., vol. 2, no. 1, pp. 88-99, Jan. 1994.
16. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Applications. New York: Prentice-Hall, 1993.
17. B. Carre, Graphs and Networks. Oxford, U.K.: Clarendon, 1979.
18. Y. Liu and D. Tipper, "Successive survivable routing for node failures," in Proc. IEEE GLOBECOM 2001, 2001, pp. 2093-2097.
19. E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, "Light-path re-optimization in mesh optical networks," presented at the 7th Eur. Conf. Network Optical Communications, 2002.
20. E. Old, N. Matsuura, K. Shiomoto, and N. Yamanaka, "A disjoint path selection scheme with shared risk link groups in GMPLS networks," IEEE Commun. Lett., vol. 6, pp. 406-408, Sept. 2002.
21. J. Yen, "Finding the K shortest loopless paths in a network," Manage. Sci., vol. 17, no. 11, pp. 712-716, 1971.
22. E. Bouillet et al., "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures," in Proc. INFOCOM'02, 2002, pp. 801-807.
23. Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. INFOCOM'01, 2001, pp. 699-708.
24. M. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. INFOCOM'00, 2000, pp. 902-911.
25. C.-F. Su and X. Su, "Protection path routing on WDM networks," in OFC'01, 2001, p. TuO2-1.
26. _, "An online distributed protection algorithm in WDM networks," in Proc. ICC'01, 2001.
27. G. Li et al., "Efficient distributed path selection for shared restoration connections," in Proc. INFOCOM'02, June 2002, pp. 140-149.
28. C. Qiao and D. Xu, "Distributed partial information management (DPIM) schemes for survivable networks - Part I," in Proc. INFOCOM'02, June 2002, pp. 302-311.
29. E. d. Q. V. Martins and M. M. B. Pascoal, "A new implementation of Yen's ranking loopless paths algorithm," 40R Quart. J. Belg., French Ital., 2002.
30. J. Simmons, E. L. Goldstein, and A. Saleh, "Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic," J. Lightwave Technol., vol. 17, pp. 48-57, Jan. 1999.