Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Authors:
Ajay Todimala;Byrav Ramamurthy
Affiliations:
University of Nebraska-Lincoln;University of Nebraska-Lincoln
Venue:
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Year:
2004

Citing 6
Cited 4

Some principles for designing a wide-area WDM optical network

IEEE/ACM Transactions on Networking (TON)
Survivable Routing in WDM Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Design of logical topologies for wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Design protection for WDM optical networks

IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks

IEEE Journal on Selected Areas in Communications

A new approach for designing fault-tolerant WDM networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SRLG failure localization in optical networks

IEEE/ACM Transactions on Networking (TON)
Cross-layer survivability in WDM-based networks

IEEE/ACM Transactions on Networking (TON)
Selective survivability with disjoint nodes and disjoint lightpaths for layer 1 VPN

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

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 [Survivable Lightpath Routing: A New Approach to the design of WDM-BasedNetworks]. 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 [Survivable Lightpath Routing: A New Approach to the design of WDM-BasedNetworks]) 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.