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

Mateusz Zotkiewicz; Walid Ben-Ameur; Michał Pióro

doi:10.1109/LCOMM.2010.08.100653

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

Mateusz Zotkiewicz
, Walid Ben-Ameur
, Michał Pióro

Telecom Paris
Warsaw University of Technology
Lund University

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

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.

langue originale	Anglais
Numéro d'article	5545666
Pages (de - à)	776-778
Nombre de pages	3
journal	IEEE Communications Letters
Volume	14
Numéro de publication	8
Les DOIs	https://doi.org/10.1109/LCOMM.2010.08.100653
état	Publié - 1 août 2010

Accès au document

10.1109/LCOMM.2010.08.100653

Contient cette citation

@article{6d0216827dd147a59eb1b312bcac9b61,

title = "Finding failure-disjoint paths for path diversity protection in communication networks",

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.",

keywords = "Algorithms, network reliability, optimization methods",

author = "Mateusz Zotkiewicz and Walid Ben-Ameur and Micha{\l} Pi{\'o}ro",

year = "2010",

month = aug,

day = "1",

doi = "10.1109/LCOMM.2010.08.100653",

language = "English",

volume = "14",

pages = "776--778",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

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

AU - Zotkiewicz, Mateusz

AU - Ben-Ameur, Walid

AU - Pióro, Michał

PY - 2010/8/1

Y1 - 2010/8/1

N2 - 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.

AB - 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.

KW - Algorithms

KW - network reliability

KW - optimization methods

U2 - 10.1109/LCOMM.2010.08.100653

DO - 10.1109/LCOMM.2010.08.100653

M3 - Article

AN - SCOPUS:77955590843

SN - 1089-7798

VL - 14

SP - 776

EP - 778

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 8

M1 - 5545666

ER -

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

Résumé

Accès au document

Empreinte digitale

Contient cette citation