Finding failure-disjoint paths for path diversity protection in communication networks
Författare
Summary, in English
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.
Avdelning/ar
Publiceringsår
2010
Språk
Engelska
Sidor
776-778
Publikation/Tidskrift/Serie
IEEE Communications Letters
Volym
14
Issue
8
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- telecommunication network reliability
- diversity reception
- directed graphs
- communication networks
- failure-disjoint paths
- path diversity protection
- polynomial-time algorithm
- resilient arc
- weighted directed graph
- algorithms
- network reliability
- optimization methods
Status
Published
Forskningsgrupp
- Networking
ISBN/ISSN/Övrigt
- ISSN: 1089-7798