The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

  • M. Zotkiewicz
  • W. Ben-Ameur
  • Michal Pioro

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.

Publishing year

2010

Language

English

Pages

776-778

Publication/Series

IEEE Communications Letters

Volume

14

Issue

8

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

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

Status

Published

Research group

  • Networking

ISBN/ISSN/Other

  • ISSN: 1089-7798