29-09-2010, 05:07 PM
Dual link Dual Link Failure Resiliency through Backup Path Mutual Exclusion.doc (Size: 30 KB / Downloads: 86)
Dual Link Failure Resiliency through Backup Path Mutual Exclusion
INTRODUCTION
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.
Problem Description:
The ever-increasing transmission speed in the communication networks calls for efficient fault-tolerant network design. Today’s backbone networks employ optical communication technology involving wavelength division multiplexing
(WDM). A link between two nodes comprises of multiple fibers carrying several tens of wavelengths with transmission speed on a wavelength at 40 Gb/s. Due to the large volume of information transported, it is necessary to reduce the resource unavailability time due to failures. Hence, efficient and fast recovery techniques from node and link failures are mandated in the design of high-speed networks.
1) Formulating the backup path selection as an integer linear program
2) Developing a polynomial time heuristic based on minimum cost Path
routing.
Problem Description:
The ever-increasing transmission speed in the communication networks calls for efficient fault-tolerant network design. Today’s backbone networks employ optical communication technology involving wavelength division multiplexing
(WDM). A link between two nodes comprises of multiple fibers carrying several tens of wavelengths with transmission speed on a wavelength at 40 Gb/s. Due to the large volume of information transported, it is necessary to reduce the resource unavailability time due to failures. Hence, efficient and fast recovery techniques from node and link failures are mandated in the design of high-speed networks.