Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks

Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoliang Xue

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

37 Citations (Scopus)

Abstract

Given a logical topology GL and a physical topology G, the survivable logical topology design problem in an IP-over-WDM optical network is to map the logical links into lightpaths in G such that GL remains connected after the failure of any edge in G. In view of its fundamental nature and its practical importance, this problem has received considerable attention in the literature. The SMART algorithmic framework based on the circuits in GL is a novel and very significant contribution to this problem. Taking advatange of the dual relationship between circuits and cutsets in a graph, we first present in this paper the primal algorithm CIRCUIT-SMART (similar to SMART) and algorithm CUTSET-SMART that is dual of CIRCUIT-SMART and proofs of correctness of these algorithms. To guarantee survivability we add additional logical links called protection edges, if necessary. This investigation has provided much insight into the structural properties of solutions to this problem and the structure of survivable logical graphs. Specifically, we present a highly simplified version of CUTSET-SMART that always provides a survivable mapping as long as GL is 3-edge connected, and a survivable logicl topology structure. We also present algorithm INCIDENCE-SMART that uses incidence sets that are special cases of a cut. Two efficient heuristics, one based on maximum matching theory and the other based on both the primal and dual algorithms are also presented. Simulation results comparing the different algorithms in terms of computational time, protection capacity and survivability success rate are also presented.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1026-1034
Number of pages9
DOIs
StatePublished - 2009
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

Fingerprint

Fiber optic networks
Wavelength division multiplexing
Topology
Networks (circuits)
Telecommunication links
Structural properties

Keywords

  • Circuits
  • Cutsets and duality
  • Disjoint paths
  • IP-over-WDM
  • Lightpath routing
  • Survivable networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks. / Thulasiraman, Krishnaiyan; Javed, Muhammad S.; Xue, Guoliang.

Proceedings - IEEE INFOCOM. 2009. p. 1026-1034 5062014.

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

Thulasiraman, K, Javed, MS & Xue, G 2009, Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks. in Proceedings - IEEE INFOCOM., 5062014, pp. 1026-1034, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5062014
Thulasiraman, Krishnaiyan ; Javed, Muhammad S. ; Xue, Guoliang. / Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks. Proceedings - IEEE INFOCOM. 2009. pp. 1026-1034
@inproceedings{bbd25b47c68a42c8839b4fd7da11d594,
title = "Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks",
abstract = "Given a logical topology GL and a physical topology G, the survivable logical topology design problem in an IP-over-WDM optical network is to map the logical links into lightpaths in G such that GL remains connected after the failure of any edge in G. In view of its fundamental nature and its practical importance, this problem has received considerable attention in the literature. The SMART algorithmic framework based on the circuits in GL is a novel and very significant contribution to this problem. Taking advatange of the dual relationship between circuits and cutsets in a graph, we first present in this paper the primal algorithm CIRCUIT-SMART (similar to SMART) and algorithm CUTSET-SMART that is dual of CIRCUIT-SMART and proofs of correctness of these algorithms. To guarantee survivability we add additional logical links called protection edges, if necessary. This investigation has provided much insight into the structural properties of solutions to this problem and the structure of survivable logical graphs. Specifically, we present a highly simplified version of CUTSET-SMART that always provides a survivable mapping as long as GL is 3-edge connected, and a survivable logicl topology structure. We also present algorithm INCIDENCE-SMART that uses incidence sets that are special cases of a cut. Two efficient heuristics, one based on maximum matching theory and the other based on both the primal and dual algorithms are also presented. Simulation results comparing the different algorithms in terms of computational time, protection capacity and survivability success rate are also presented.",
keywords = "Circuits, Cutsets and duality, Disjoint paths, IP-over-WDM, Lightpath routing, Survivable networks",
author = "Krishnaiyan Thulasiraman and Javed, {Muhammad S.} and Guoliang Xue",
year = "2009",
doi = "10.1109/INFCOM.2009.5062014",
language = "English (US)",
isbn = "9781424435135",
pages = "1026--1034",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks

AU - Thulasiraman, Krishnaiyan

AU - Javed, Muhammad S.

AU - Xue, Guoliang

PY - 2009

Y1 - 2009

N2 - Given a logical topology GL and a physical topology G, the survivable logical topology design problem in an IP-over-WDM optical network is to map the logical links into lightpaths in G such that GL remains connected after the failure of any edge in G. In view of its fundamental nature and its practical importance, this problem has received considerable attention in the literature. The SMART algorithmic framework based on the circuits in GL is a novel and very significant contribution to this problem. Taking advatange of the dual relationship between circuits and cutsets in a graph, we first present in this paper the primal algorithm CIRCUIT-SMART (similar to SMART) and algorithm CUTSET-SMART that is dual of CIRCUIT-SMART and proofs of correctness of these algorithms. To guarantee survivability we add additional logical links called protection edges, if necessary. This investigation has provided much insight into the structural properties of solutions to this problem and the structure of survivable logical graphs. Specifically, we present a highly simplified version of CUTSET-SMART that always provides a survivable mapping as long as GL is 3-edge connected, and a survivable logicl topology structure. We also present algorithm INCIDENCE-SMART that uses incidence sets that are special cases of a cut. Two efficient heuristics, one based on maximum matching theory and the other based on both the primal and dual algorithms are also presented. Simulation results comparing the different algorithms in terms of computational time, protection capacity and survivability success rate are also presented.

AB - Given a logical topology GL and a physical topology G, the survivable logical topology design problem in an IP-over-WDM optical network is to map the logical links into lightpaths in G such that GL remains connected after the failure of any edge in G. In view of its fundamental nature and its practical importance, this problem has received considerable attention in the literature. The SMART algorithmic framework based on the circuits in GL is a novel and very significant contribution to this problem. Taking advatange of the dual relationship between circuits and cutsets in a graph, we first present in this paper the primal algorithm CIRCUIT-SMART (similar to SMART) and algorithm CUTSET-SMART that is dual of CIRCUIT-SMART and proofs of correctness of these algorithms. To guarantee survivability we add additional logical links called protection edges, if necessary. This investigation has provided much insight into the structural properties of solutions to this problem and the structure of survivable logical graphs. Specifically, we present a highly simplified version of CUTSET-SMART that always provides a survivable mapping as long as GL is 3-edge connected, and a survivable logicl topology structure. We also present algorithm INCIDENCE-SMART that uses incidence sets that are special cases of a cut. Two efficient heuristics, one based on maximum matching theory and the other based on both the primal and dual algorithms are also presented. Simulation results comparing the different algorithms in terms of computational time, protection capacity and survivability success rate are also presented.

KW - Circuits

KW - Cutsets and duality

KW - Disjoint paths

KW - IP-over-WDM

KW - Lightpath routing

KW - Survivable networks

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

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

U2 - 10.1109/INFCOM.2009.5062014

DO - 10.1109/INFCOM.2009.5062014

M3 - Conference contribution

AN - SCOPUS:70349690078

SN - 9781424435135

SP - 1026

EP - 1034

BT - Proceedings - IEEE INFOCOM

ER -