A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks

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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE/ACM transactions on networking Vol. 22; no. 2; pp. 470 - 483
Main Authors:	Xue, Guoliang, Gottapu, Ravi, Fang, Xi, Yang, Dejun, Thulasiraman, Krishnaiyan
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Computation Computer networks Disjoint lightpath pairs Fiber optic networks Heuristic algorithms Integer linear programming Linear programming Mathematical models Mesh networks minimum isolated failure immune networks Network topology Networks Optical communication Optical fiber networks partial 2-trees Protection Routing Scalability Topology Wave division multiplexing Wavelength division multiplexing wavelength division multiplexing (WDM) optical network Wavelengths WDM networks
ISSN:	1063-6692, 1558-2566
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!