Maximum reliable path under multiple failures

Authors:
Shengli Yuan
Affiliations:
Department of Computer and Mathematical Sciences, University of Houston-Downtown, Houston, Texas
Venue:
CIS'09 Proceedings of the international conference on Computational and information science 2009
Year:
2009

Citing 2
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we study the problem of maximizing path reliability in mesh networks against simultaneous failures of multiple network links. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard and we propose a heuristic algorithm for networks with large numbers of SRLGs as well as optimal solutions for networks with smaller numbers of SRLGs. The solutions are evaluated through computer simulations.