Loopback recovery from neighboring double-link failures in WDM mesh networks
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Loopback recovery from double-link failures in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Graph Theory With Applications
Graph Theory With Applications
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Protection cycles in mesh WDM networks
IEEE Journal on Selected Areas in Communications
Availability analysis of span-restorable mesh networks
IEEE Journal on Selected Areas in Communications
p-cycle based dual failure recovery in WDM mesh networks
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Ellipse-underlay protection algorithm to deal with regional demolishments in mesh optical networks
Photonic Network Communications
Photonic Network Communications
Differentiated quality-of-protection in survivable WDM mesh networks using p-structures
Computer Communications
Disaster survivability in optical communication networks
Computer Communications
Spare capacity allocation using shared backup path protection for dual link failures
Computer Communications
Hi-index | 0.00 |
Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as backup link mutual exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: 1) formulating the backup path selection as an integer linear program; 2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared with approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all of the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures.