Advanced

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

Zotkiewicz, M.; Ben-Ameur, W. and Pioro, Michal LU (2010) In IEEE Communications Letters 14(8). p.776-778
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
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
in
IEEE Communications Letters
volume
14
issue
8
pages
776 - 778
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000282983000030
  • scopus:77955590843
ISSN
1089-7798
DOI
10.1109/LCOMM.2010.08.100653
language
English
LU publication?
yes
id
760d3bb6-672d-4171-a345-9e719e79c719 (old id 1718898)
date added to LUP
2010-11-19 13:43:53
date last changed
2017-01-01 07:44:42
@article{760d3bb6-672d-4171-a345-9e719e79c719,
  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.},
  author       = {Zotkiewicz, M. and Ben-Ameur, W. and Pioro, Michal},
  issn         = {1089-7798},
  keyword      = {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},
  language     = {eng},
  number       = {8},
  pages        = {776--778},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Communications Letters},
  title        = {Finding failure-disjoint paths for path diversity protection in communication networks},
  url          = {http://dx.doi.org/10.1109/LCOMM.2010.08.100653},
  volume       = {14},
  year         = {2010},
}