### Abstract

A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW^{2}), where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.

Original language | English (US) |
---|---|

Article number | 6519289 |

Pages (from-to) | 470-483 |

Number of pages | 14 |

Journal | IEEE/ACM Transactions on Networking |

Volume | 22 |

Issue number | 2 |

DOIs | |

State | Published - 2014 |

### Fingerprint

### Keywords

- Disjoint lightpath pairs
- minimum isolated failure immune networks
- partial 2-trees
- wavelength division multiplexing (WDM) optical network

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Software
- Computer Science Applications
- Computer Networks and Communications

### Cite this

*IEEE/ACM Transactions on Networking*,

*22*(2), 470-483. [6519289]. https://doi.org/10.1109/TNET.2013.2257180

**A polynomial-time algorithm for computing disjoint lightpath pairs in minimum isolated-failure-immune WDM optical networks.** / Xue, Guoliang; Gottapu, Ravi; Fang, Xi; Yang, Dejun; Thulasiraman, Krishnaiyan.

Research output: Contribution to journal › Article

*IEEE/ACM Transactions on Networking*, vol. 22, no. 2, 6519289, pp. 470-483. https://doi.org/10.1109/TNET.2013.2257180

}

TY - JOUR

T1 - A polynomial-time algorithm for computing disjoint lightpath pairs in minimum isolated-failure-immune WDM optical networks

AU - Xue, Guoliang

AU - Gottapu, Ravi

AU - Fang, Xi

AU - Yang, Dejun

AU - Thulasiraman, Krishnaiyan

PY - 2014

Y1 - 2014

N2 - A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW2), where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.

AB - A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW2), where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.

KW - Disjoint lightpath pairs

KW - minimum isolated failure immune networks

KW - partial 2-trees

KW - wavelength division multiplexing (WDM) optical network

UR - http://www.scopus.com/inward/record.url?scp=84899532474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899532474&partnerID=8YFLogxK

U2 - 10.1109/TNET.2013.2257180

DO - 10.1109/TNET.2013.2257180

M3 - Article

AN - SCOPUS:84899532474

VL - 22

SP - 470

EP - 483

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

M1 - 6519289

ER -