A Heuristic with Bounded Guarantee to Compute Diverse Paths under Shared Protection in WDM Mesh Networks

Authors

Ajay Todimala, University of Nebraska-LincolnFollow
Byrav Ramamurthy, University of Nebraska-LincolnFollow

Date of this Version

2005

Comments

Published in IEEE Global Telecommunications Conference, 2005. GLOBECOM '05. Copyright 2005 IEEE. Used by permission.

Abstract

Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.