DMCA
Survivability of Lightwave Networks - Path Lengths in WDM Protection Scheme (2001)
| Venue: | Journal of High Speed Networks |
| Citations: | 11 - 1 self |
BibTeX
@ARTICLE{Sen01survivabilityof,
author = {Arunabha Sen and Bin Hao and Bao Hong Shen and Subir Bandyopadhyay},
title = {Survivability of Lightwave Networks - Path Lengths in WDM Protection Scheme},
journal = {Journal of High Speed Networks},
year = {2001},
volume = {10},
pages = {303--315}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the protection scheme of fault management in a WDM optical network, corresponding to every source-destination path used for data transmission, a backup path is maintained in a stand-by mode. In the case of a failure (either due to a ber cut or due to equipment failure) in the primary path, data transmission is quickly switched to the backup path. In order to tolerate any single fault, the backup path must be edge (or node) disjoint from the primary path. Most often a shortest path between the source and the destination is chosen as the primary path. To obtain a link (node) disjoint backup (or secondary) path, the links (nodes) of the primary path are removed from the graph and then a shortest path in the modied graph is chosen as the backup path. The attractive feature of this scheme is its simplicity. However, the scheme has a severe drawback. Due to the choice of a shortest path as the primary path, the length of a link disjoint secondary path may be unacceptably large. In this paper, we propose a novel way of choosing the primary and the secondary paths so that the lengths of both the paths are small. Unfortunately, the problem of choosing primary and secondary paths in this way turns out to be NP-complete. We provide the NP-completeness proof of both the edge disjoint and the node disjoint version of the problem. We provide an approximation algorithm for the problem with a guaranteed performance bound of 2 and a mathematical programming formulation for the exact solution of the problem. Though the approximate solution provides a performance bound of 2, through extensive experimental evaluation, we nd that the approximate solution is very close to the optimal solution and the ratio between the approximate to the optimal solution never exce...
Keyphrases
primary path backup path wdm protection scheme lightwave network path length optimal solution secondary path shortest path approximate solution data transmission attractive feature node disjoint version edge disjoint exact solution modied graph wdm optical network guaranteed performance bound link disjoint secondary path performance bound single fault protection scheme disjoint backup fault management np-completeness proof stand-by mode novel way approximation algorithm extensive experimental evaluation severe drawback source-destination path mathematical programming formulation equipment failure ber cut
