CoSE: A SRLG-Disjoint Routing Algorithm

A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms

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

[2]  C. Siva Ram Murthy,et al.  Dynamic Establishment of Segmented Protection Paths in Single and Multi-Fiber WDM Mesh Networks , 2005, Photonic Network Communications.

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

[4]  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.

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

[6]  Xin Yuan On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[7]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[8]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[9]  Chunming Qiao,et al.  A new PROMISE algorithm in networks with shared risk link groups , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Chunming Qiao,et al.  On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.

[11]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[12]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.