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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 22; H. 2; S. 470 - 483
Hauptverfasser:	Xue, Guoliang, Gottapu, Ravi, Fang, Xi, Yang, Dejun, Thulasiraman, Krishnaiyan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!