Survivable virtual topology routing under shared risk link groups in WDM networks

Ajay Todimala; Byrav Ramamurthy

1st Annual Conference on Broadband Networks

Research Article

Survivable virtual topology routing under shared risk link groups in WDM networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/BROADNETS.2004.81,
    author={Ajay Todimala and Byrav Ramamurthy},
    title={Survivable virtual topology routing under shared risk link groups in WDM networks},
    proceedings={1st Annual Conference on Broadband Networks},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2004},
    month={12},
    keywords={},
    doi={10.1109/BROADNETS.2004.81}
}

Ajay Todimala
Byrav Ramamurthy
Year: 2004
Survivable virtual topology routing under shared risk link groups in WDM networks
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2004.81

Ajay Todimala^1,2^,*, Byrav Ramamurthy¹^,*

1: Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln NE 68588-0115 U.S.A.
2:

*Contact email: ajayt@cse.unl.edu, byrav@cse.unl.edu

Abstract

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with shared risk link groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in E. Modiano and A. Narula-Tam, May 2002. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to E. Modiano and A. Narula-Tam, May 2002) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we computed the survivable virtual topology routing against link and SRLG failures for small and medium sized networks efficiently. As even our improved ILP formulation becomes intractable for large networks, we present a congestion-based heuristic and a tabu search heuristic (which uses the congestion-based heuristic solution as the initial solution) for computing survivable routing of a virtual topology. Our experimental results show that tabu search heuristic coupled with the congestion based heuristic (used as initial solution) provides fast and near-optimal solutions.

Published: 2004-12-13
Publisher: IEEE

: http://dx.doi.org/10.1109/BROADNETS.2004.81