A scalable approach for survivable virtual topology routing in optical WDM networks

Authors:
A. Todimala;B. Ramamurthy
Affiliations:
Univ. of Nebraska, Lincoln;-
Venue:
IEEE Journal on Selected Areas in Communications - Part Supplement
Year:
2007

Citing 0
Cited 5

An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical network

ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Performance analysis of nature inspired heuristics for survivable virtual topology mapping

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Primal meets dual: a generalized theory of logical topology survivability in IP-over-WDM optical networks

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The survivable virtual topology routing problem is to route a virtual topology graph on a optical fiber physical topology such that the virtual topology remains connected when failures occur in the physical topology. In this work we study the problem of survivable virtual topology routing under single node/SRLG (Shared Risk Link Group) failure model. We prove that the survivable virtual topology routing problem under node/SRLG failures is NP-complete. We present an improved integer linear programming (ILP) formulation for computing the survivable routing of a virtual topology graph. However, ILP is not scalable when the network size scales more than a few tens of nodes. In this work, we present sub-classes of graphs which more accurately model an actual network and for which a survivable routing can be easily computed solving an ILP. We successfully computed the survivable routing of virtual topologies belonging to these sub-classes against link/SRLG failures for topologies of size up to 24 nodes.