Trap avoidance and protection schemes in networks with shared risk link groups

Shared risk link group (SRLG) has been widely recognized as an important concept in survivable optical networks. However, there are still several SRLG-related problems of both theoretical interest and practical importance that have not been explored fully. Specifically, there are two major issues that are still open: avoiding failures in path determination caused by "traps" and maximizing bandwidth sharing. These issues are more challenging when considering shared path protection in networks with SRLGs. In this paper, we address the above two open issues, starting with a heuristic approach to avoiding traps. In networks with SRLGs, a simple heuristic may run into traps up to 30% of the time. Integer linear programming (ILP)-based approaches, on the other hand, are not feasible for large SRLG networks. One of the widely used heuristics for trap avoidance is based on K shortest paths (KSP). As an alternative to KSP, we propose an innovative trap avoidance (TA) heuristic that requires much less running time than KSP (and ILP) and yet can effectively avoid almost all the avoidable traps as an ILP-based approach. We also propose an efficient shared SRLG protection scheme based on TA that can achieve a bandwidth efficiency that is nearly as high as other schemes based on ILP or KSP.

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

[2]  Jennifer Yates,et al.  Effectiveness of shared risk link group auto-discovery in optical networks , 2002, Optical Fiber Communication Conference and Exhibit.

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

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

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

[8]  Ramesh Bhandari.  Survivable Networks: Algorithms for Diverse Routing , 1998 .

[9]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

[10]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[11]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

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

[13]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[14]  Daniel O. Awduche,et al.  IP over Optical Networks: A Framework , 2004, RFC.

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

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

[17]  A. Greenberg,et al.  Auto-discovery of shared risk link groups , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

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

[19]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[20]  C.-F. Su,et al.  Protection path routing on WDM networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[21]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[23]  Wayne D. Grover,et al.  Capacity design studies of span-restorable mesh transport networks with shared-risk link group (SRLG) effects , 2002, SPIE ITCom.

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

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

[26]  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).

[27]  Eiji Oki,et al.  A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.