Finding failure-disjoint paths for path diversity protection in communication networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Communications Letters Année : 2010

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00529524 , version 1 (25-10-2010)

Identifiants

Citer

Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pioro. Finding failure-disjoint paths for path diversity protection in communication networks. IEEE Communications Letters, 2010, 14 (8), pp.776-778. ⟨10.1109/LCOMM.2010.08.100653⟩. ⟨hal-00529524⟩
72 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More