A New PROMISE Algorithm in Networks with Shared Risk Link Groups

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 5, Issue , 2003, Pages 2536-2540

  Xu, Dahai ^a   Xiong, Yizhi ^a   Qiao, Chunming ^a  

^a State University of New York   (United States)

Author keywords

Bandwidth Sharing; Optical Network; Segment Protection; Shared Risk Link Groups; Trap

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTICAL FIBERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

OPTICAL NETWORKS;

OPTICAL COMMUNICATION;

EID: 0842288483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. D. Papadimitriou and et al., "Inference of shared risk link groups," in Internet draft, work in progress, Nov. 2001.
2. J. Hu, "Diverse routing in optical mesh networks.," in IEEE Transactions on Communications, Vol. 51, 2003, pp. 489-494.
3. G. Li, B. Doverspike, and C. Kalmanek, "Fiber span failure protection in mesh optical networks," in Optical Networks Magazine Vol. 3, No. 3, May/Jun. 2002.
4. R. Bhandari, "Survivable networks: algorithms for diverse routing," in Kluwer, 1999.
5. E. Bouillet and et al., "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures," in INFOCOM'02, 2002. pp. 801-807.
6. D. Xu, Y. Xiong, C.Qiao, and G. Li, "Trap avoidance and protection schemes in networks with shared risk link groups," in IEEE Journal of Lightwave Technology, Special issue on Optical Network, to appear, 2003.
7. D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of k-shortest paths and maximum flow routing for network facility restoration," in IEEE Journal on Selected Areas of Communications, Vol. 2, No. 1, Jan. 1994, pp. 88-99.
8. Y. Liu and D. Tipper, "Successive survivable routing for node failures," in IEEE GLOBECOM 2001, 2001, pp. 2093-2097.
9. J. Suurballe and R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
10. C. Li, S. T. McCormick, and D. Simchi-Levi, "Finding disjoint paths with different path costs: Complexity and algorithms," in Networks, Vol. 22., 1992, pp. 653-667.
11. S. D. Nikolopoulos, A. Pitsillides, and D. Tipper, "Addressing network survivability issues by finding the K-best paths through a trellis graph," in INFOCOM'97, 1997.
12. D. Xu, Y. Xiong, and C.Qiao, "Novel algorithms for shared segment protection," in IEEE Journal on Selected Areas in Communications, accepted for publication, 2003.
13. D. Xu, Y. Xiong, and C. Qiao, "Protection with multi-segments in networks with shared risk link groups (SRLG)," in 40th Annual Allerton Conference on Communication, Control, and Computing, 2002.
14. V. Sharma and et al., "Framework for MPLS-based recovery," in Internet Draft, drafl-ietf-mpls-recovery-frmwrk-08.txt (work in progress), Oct. 2002.
15. R. Bhandari, "Optimal diverse routing in telecommunications fiber networks," in INFOCOM'94, 1994.
16. C. V. Saradhi and C. S. R. Murthy, "Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks," in OPTICOMM'02, 2002, pp. 211-222.
17. M. Kodialam and T. V. Lakshman, "Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information," in INFOCOM'01, 2001, pp. 376-385.
18. P.-H. Ho and H. Mouftah, "A framework for service-guaranteed shared protection in WDM mesh networks," in IEEE Communications Magazine, Vol. 40, No. 2, 2002, pp. 97-103.
19. C. Qiao and D. Xu, "Distributed partial information management (DPIM) schemes for survivable networks-Part I," in INFOCOM'02, Jun. 2002, pp. 302-311.
20. M. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in INFOCOM'00, 2000, pp. 902-911.