Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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

Publiceringsår

2010

Språk

Engelska

Sidor

776-778

Publikation/Tidskrift/Serie

IEEE Communications Letters

Volym

14

Issue

8

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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

Forskningsgrupp

  • Networking

ISBN/ISSN/Övrigt

  • ISSN: 1089-7798