OPN07-4: Maximum Survivability using Two Disjoint Paths under Multiple Failures in Mesh Networks

This paper investigates the problem of finding two link-disjoint paths in mesh networks. Different from traditional studies, such as MIN-SUM, MIN-MAX, and MIN-MIN, the objective in this paper is to minimize the end-to-end failure probability, or equivalently, maximize the survivability under multiple link failures. We refer to this problem as MAX-SURV. Solving MAX-SURV provides 100% protection against single failure while maximizing the survivability under multiple failures. We prove that this problem is NP-complete, and we propose a heuristic algorithm for finding a solution. The corresponding upper bound and lower bound for given networks are also found. The time efficiency of the algorithms is analyzed, and the performance of the algorithms is evaluated through simulation.

[1]  Biswanath Mukherjee,et al.  A comprehensive study on backup reprovisioning to remedy the effect of multiple-link failures in WDM mesh networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  J.P. Jue,et al.  Maximum survivability under multiple failures , 2006, 2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference.

[3]  Steven S. Lumetta,et al.  Evaluation of protection reconfiguration for multiple failures in WDM mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

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

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[7]  Andrea Fumagalli,et al.  Differentiated reliability in optical networks: theoretical and practical results , 2003 .

[8]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with Min-Min Objective Function , 2003 .

[9]  S. Chaudhuri,et al.  Pre-emptive reprovisioning in mesh optical networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[10]  Suresh Subramaniam,et al.  On double-link failure recovery in WDM optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Arun Kumar Somani.  A single-fault recovery strategy for optical networks using subgraph routing , 2002 .

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

[13]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[14]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

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

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