Finding failure-disjoint paths for path diversity protection in communication networks

Authors:
Mateusz Żotkiewicz;Walid Ben-Ameur;Michał Pióro
Affiliations:
Institut TELECOM, TELECOM SudParis, France, and Institute of Telecommunications, Warsaw University of Technology, Poland;Institut TELECOM, TELECOM SudParis, France;Institute of Telecommunications, Warsaw University of Technology, Poland, and Department of Electrical and Information Technology, Lund University, Sweden
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
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
Resilience in multilayer networks

IEEE Communications Magazine

Fractional routing using pairs of failure-disjoint paths

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper we consider a flow problem closely related to path diversity protection in communication networks. Given a weighted directed graph where some arcs are subject to failures while others are resilient, we aim at computing a shortest pair of failure-disjoint paths. If a resilient arc is used by both paths, its cost is counted only once. We present an original polynomial-time algorithm for solving the problem.