Failure protection in layered networks with shared risk link groups

IEEE Network

Volumn 18, Issue 3, 2004, Pages 36-41

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

^a UNIVERSITY AT BUFFALO   (United States)

^b AT and T Research Lab

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SYSTEM FIREWALLS; CONGESTION CONTROL (COMMUNICATION);

LAYERED NETWORKS; SHARED RISK LINK GROUPS;

COMPUTER NETWORKS;

EID: 3042662219     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2004.1301021     Document Type: Article

References (18)

1. G. Ellinas et al., "Routing and Restoration Architectures in Mesh Optical Networks," Opt. Net. Mag., vol. 4, no. 1, 2003, pp. 91-106.
2. P. Sebos et al., "Effectiveness of Shared Risk Link Group Auto-Discovery in Optical Networks," OFC '02, 2002, p. Th05.
3. I. Saniee, "Optimal Routing Designs in Self-Healing Communications Networks," Int'l. Trans. Op. Res., vol. 3, no. 2, 1996, pp. 187-95.
4. J. Doucette and W. D. Grover, "Capacity Design Studies of Span-Restorable Mesh Transport Networks with Shared-Risk Link Group (SRLG) Effects," Opticomm 2002, Proc. SPIE, vol. 4874, 2002, pp. 25-38.
5. J. Hu, "Diverse Routing in Optical Mesh Networks," IEEE Trans. Commun., vol. 51, 2003, pp. 489-94.
6. G. Li, B. Doverspike, and C. Kalmanek, "Fiber Span Failure Protection in Mesh Optical Networks," Opt. Net. Mag., vol. 3, no. 3, May/June 2002.
7. J. Suurballe and R. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, vol. 14, 1984, pp. 325-36.
8. C. Li, S. T. McCormick, and D. Simchi-Levi, "Finding Disjoint Paths with Different Path Costs: Complexity and Algorithms," Networks, vol. 22., 1992, pp. 653-67.
9. S. D. Nikolopoulos, A. Pitsillides, and D. Tipper, "Addressing Network Survivability Issues by Finding the K-best Paths through a Trellis Graph," INFOCOM '97, 1997.
10. E. Bouillet et al., "Lightpath Re-optimization in Mesh Optical Networks," 7th Euro. Conf. Network and Opt. Commun., 2002.
11. Y. Liu and D. Tipper, "Successive Survivable Routing for Node Failures," IEEE GLOBECOM 2001, pp. 2093-7.
12. R. Bhandari, "Optimal Diverse Routing in Telecommunications Fiber Networks," INFOCOM '94, 1994.
13. M. Kodialam and T. V. Lakshman, "Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration," INFOCOM 2000, pp. 902-11.
14. C. Qiao and D. Xu, "Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I," INFOCOM '02, New York, NY, June 2002, pp. 302-11.
15. D. Xu et al., "Trap avoidance and Protection Schemes in Networks with Shared Risk Link Groups," IEEE J. Lightwave Tech., vol. 21, no. 11, Nov. 2003, pp. 2683-93.
16. E. Oki et al., "A Disjoint Path Selection Scheme with Shared Risk Link Groups in GMPLS networks," IEEE Commun. Lett., vol. 6, no. 9, Sept. 2002, pp. 406-8.
17. Y. Yen, "Finding the K Shortest Loopless Paths in a Network," Management Science, vol. 17, no. 11, 1971, pp. 712-16.
18. E. Bouillet et al., "Stochastic Approaches to Compute Shared Mesh Restored Lightpaths in Optical Network Architectures," INFOCOM '02, 2002, pp. 801-07.