Survivable routing in WDM networks

Arunabha Sen, Bin Hao, Bao Hong Shen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - ISCC 2002
Subtitle of host publication7th International Symposium on Computers and Communications
Pages726-731
Number of pages6
DOIs
StatePublished - Dec 1 2002
Event7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy
Duration: Jul 1 2002Jul 4 2002

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Other

Other7th International Symposium on Computers and Communications, ISCC 2002
CountryItaly
CityTaormina-Giardini Naxos
Period7/1/027/4/02

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Survivable routing in WDM networks'. Together they form a unique fingerprint.

Cite this