Survivable routing in WDM networks

Arunabha Sen; Bin Hao; Bao Hong Shen

doi:10.1109/ISCC.2002.1021754

Survivable routing in WDM networks

Arunabha Sen, Bin Hao, Bao Hong Shen

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

23 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 language	English (US)
Title of host publication	Proceedings - ISCC 2002
Subtitle of host publication	7th International Symposium on Computers and Communications
Pages	726-731
Number of pages	6
DOIs	https://doi.org/10.1109/ISCC.2002.1021754
State	Published - 2002
Event	7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy Duration: Jul 1 2002 → Jul 4 2002

Publication series

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

Other

Other	7th International Symposium on Computers and Communications, ISCC 2002
Country/Territory	Italy
City	Taormina-Giardini Naxos
Period	7/1/02 → 7/4/02

ASJC Scopus subject areas

Software
Signal Processing
General Mathematics
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1109/ISCC.2002.1021754

Cite this

Sen, A, Hao, B & Shen, BH 2002, Survivable routing in WDM networks. in Proceedings - ISCC 2002: 7th International Symposium on Computers and Communications., 1021754, Proceedings - IEEE Symposium on Computers and Communications, pp. 726-731, 7th International Symposium on Computers and Communications, ISCC 2002, Taormina-Giardini Naxos, Italy, 7/1/02. https://doi.org/10.1109/ISCC.2002.1021754

@inproceedings{d72e805742ca459eb20a6b798fd032b7,

title = "Survivable routing in WDM networks",

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

author = "Arunabha Sen and Bin Hao and Shen, {Bao Hong}",

year = "2002",

doi = "10.1109/ISCC.2002.1021754",

language = "English (US)",

isbn = "0769516718",

series = "Proceedings - IEEE Symposium on Computers and Communications",

pages = "726--731",

booktitle = "Proceedings - ISCC 2002",

note = "7th International Symposium on Computers and Communications, ISCC 2002 ; Conference date: 01-07-2002 Through 04-07-2002",

}

TY - GEN

T1 - Survivable routing in WDM networks

AU - Sen, Arunabha

AU - Hao, Bin

AU - Shen, Bao Hong

PY - 2002

Y1 - 2002

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

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

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

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

U2 - 10.1109/ISCC.2002.1021754

DO - 10.1109/ISCC.2002.1021754

M3 - Conference contribution

AN - SCOPUS:84883880034

SN - 0769516718

SN - 9780769516714

T3 - Proceedings - IEEE Symposium on Computers and Communications

SP - 726

EP - 731

BT - Proceedings - ISCC 2002

T2 - 7th International Symposium on Computers and Communications, ISCC 2002

Y2 - 1 July 2002 through 4 July 2002

ER -

Survivable routing in WDM networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this