A new PROMISE algorithm in networks with shared risk link groups

Shared risk link group (SRLG) has been widely recognized as an important concept in survivable optical networks. The issues of avoiding the so-called "traps" in the path determination phase and maximizing bandwidth sharing are more challenging in providing shared SRLG protection than in providing shared path protection without considering SRLG. In this paper, we extend a algorithm for the scheme of protection with multiple segments (PROMISE) to provide efficient SRLG protection. The proposed algorithm uses a novel dynamic programming technology and achieves a higher bandwidth efficiency and lower request blocking probability.

[1]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[2]  Yu Liu,et al.  Successive survivable routing for node failures , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[3]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.

[4]  Charles Kalmanek,et al.  Fiber span failure protection in mesh optical networks , 2001, OptiComm: Optical Networking and Communications Conference.

[5]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

[7]  Chung-Lun Li,et al.  Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[8]  Srinivas V. Makam,et al.  Framework for MPLS - based Recovery , 2000 .

[9]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Eric Bouillet,et al.  Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  C. Siva Ram Murthy,et al.  Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks , 2002, SPIE ITCom.

[13]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Dimitri Papadimitriou,et al.  Inference of Shared Risk Link Groups , 2001 .

[15]  Chunming Qiao,et al.  Protection with Multi-Segments ( PROMISE ) in Networks with Shared Risk Link Groups ( SRLG ) ∗ , 2002 .

[16]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[17]  Chunming Qiao,et al.  Novel algorithms for shared segment protection , 2003, IEEE J. Sel. Areas Commun..

[18]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[19]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[20]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..