Loopback recovery from neighboring double-link failures in WDM mesh networks

Authors:
Hongsik Choi;Suresh Subramaniam;Hyeong-Ah Choi
Affiliations:
Division of Information and Communication Engineering, Hallym University, Chunchon, South Korea;Department of ECE, George Washington University, Washington, DC;Department of Computer Science, George Washington University, Washington, DC
Venue:
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Year:
2003

Citing 3
Cited 4

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

Loopback recovery from double-link failures in optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Dual-link failure resiliency through backup link mutual exclusion

IEEE/ACM Transactions on Networking (TON)
Adjacent link failure localization with monitoring trails in all-optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Realization strategies of dedicated path protection: A bandwidth cost perspective

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional survivable network design assumes that at any time at most a single link or node fails. In optical networks, a single point of failure may lead to the failure of multiple links. In this paper, we consider the design of an optical network that can survive the failures of any two neighboring links. We present a loopback recovery method that requires the computation of backup paths for each link. An optimal algorithm for computing the backup paths is presented. Numerical results comparing the performance of our algorithm with other loopback approaches indicate that a slight increase in capacity can achieve 100% protection under this failure model.