Minimum cost ring survivability in WDM networks

Bao Hong Shen, Bin Hao, Arunabha Sen

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

8 Scopus citations

Abstract

Recently, E. Modiano and A. Narula-Tam (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence of survivable routes for a given logical topology in a physical topology. In two earlier papers, we showed that the survivability problem is NP-complete, both when the nodes of the logical topology are unlabeled (Sen, A. et al., Proc. IEEE Int. Commun. Conf. ICC'02, 2002) or labeled (Sen et al., Proc. IEEE Int. Symp. on Computers and Commun. ISCC'02, 2002). We also gave algorithms to test if survivable routing of a logical ring is possible in a WDM network with arbitrary physical topology. We now address finding the minimum number of links that have to be added to a physical topology so that the survivable routing of a logical ring is possible. We show that, not only is this problem NP-complete, but an/spl epsiv/-approximation algorithm for the problem cannot be found unless P=NP. We provide an ILP formulation for finding the optimal solution of the problem. We also provide an approximate solution of the problem. The approximate algorithm requires only a very small fraction of the time required by the optimal algorithm, but produces results that are close to the optimal solution on two test networks-ARPANET and the Italian National Network.

Original languageEnglish (US)
Title of host publicationHPSR 2003 - 2003 Workshop on High Performance Switching and Routing
PublisherIEEE Computer Society
Pages183-188
Number of pages6
ISBN (Print)0780377109, 9780780377103
DOIs
StatePublished - Jan 1 2003
Event2003 Workshop on High Performance Switching and Routing, HPSR 2003 - Torino, Italy
Duration: Jun 24 2003Jun 27 2003

Publication series

NameIEEE International Conference on High Performance Switching and Routing, HPSR
ISSN (Print)2325-5595
ISSN (Electronic)2325-5609

Other

Other2003 Workshop on High Performance Switching and Routing, HPSR 2003
CountryItaly
CityTorino
Period6/24/036/27/03

Keywords

  • Integer Linear Programs
  • WDM networks
  • fault tolerance
  • protection path
  • trafic class

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Minimum cost ring survivability in WDM networks'. Together they form a unique fingerprint.

  • Cite this

    Shen, B. H., Hao, B., & Sen, A. (2003). Minimum cost ring survivability in WDM networks. In HPSR 2003 - 2003 Workshop on High Performance Switching and Routing (pp. 183-188). [1226702] (IEEE International Conference on High Performance Switching and Routing, HPSR). IEEE Computer Society. https://doi.org/10.1109/HPSR.2003.1226702