Survivable routing in WDM networks

We consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains connected even after the failure of a physical link. In a previous paper Modiano et. al. (see Proc. IEEE INFOCOM'01, 2001) introduce...

Full description

Saved in:
Bibliographic Details
Published inProceedings ISCC 2002 Seventh International Symposium on Computers and Communications pp. 726 - 731
Main Authors Arunabha Sen, Bin Hao, Bao Hong Shen
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Bandwidth
Computer science
Intelligent networks
IP networks
Network topology
NP-complete problem
Optical fiber networks
Routing
Sufficient conditions
WDM networks
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains connected even after the failure of a physical link. In a previous paper Modiano et. al. (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence survivable routes of a logical topology in a physical topology. In this paper we show that the problem of determining whether survivable routing is possible for a logical topology in a given physical topology is an NP-complete problem. Moreover we show that the problem remains NP-complete, even when the logical topology is restricted to be a ring with a specific ordering of the nodes.
ISBN:9780769516714
0769516718
ISSN:1530-1346
2642-7389
DOI:10.1109/ISCC.2002.1021754