Du är här

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

Författare:
Publiceringsår: 2010
Språk: Engelska
Sidor: 776-778
Publikation/Tidskrift/Serie: IEEE Communication Letters
Volym: 14
Nummer: 8
Dokumenttyp: Artikel

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering
  • 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

Övriga

Published
Yes
  • Networking
  • ISSN: 1089-7798

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen