Optical networks: a practical perspective
Optical networks: a practical perspective
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Graph Theory With Applications
Graph Theory With Applications
Optical layer survivability: a services perspective
IEEE Communications Magazine
Issues for routing in the optical layer
IEEE Communications Magazine
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
Dual-link failure resiliency through backup link mutual exclusion
IEEE/ACM Transactions on Networking (TON)
Faster algorithms for construction of recovery trees enhancing QoP and QoS
IEEE/ACM Transactions on Networking (TON)
Multi-layer survivable routing mechanism in GMPLS based optical networks
Journal of Systems and Software
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Sciences: an International Journal
IP fast reroute for double-link failure recovery
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Two-link failure protection in WDM mesh networks with p-cycles
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
An efficient scheme for two-link failure protection/restoration in WDM mesh networks
Journal of High Speed Networks
Hi-index | 0.01 |
Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. In this paper, we motivate the need for considering double-link failures and present three loopback methods for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each link for rerouting traffic when a pair of links fails. These methods require the identification of the failed links before recovery can be completed. The third method requires the precomputation of a single backup path and does not require link identification before recovery. An algorithm that precomputes backup paths for links in order to tolerate double-link failures is then presented. Numerical results comparing the performance of our algorithm with other approaches suggest that it is possible to achieve almost 100% recovery from double-link failures with a moderate increase in backup capacity. A remarkable feature of our approach is that it is possible to trade off capacity for restorability by choosing a subset of double-link failures and designing backup paths using our algorithm for only those failure scenarios.