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.

Path diversity protection in two-layer networks

In English

Författare

  • M Dzida
  • T Sliwinski
  • M Zagozdzon
  • W Ogryczak
  • Michal Pioro

Summary, in English

The paper addresses an optimization problem related to dimensioning links in a resilient two-layer network. A particular version of the problem which assumes that links of the upper layer are supported by unique paths in the lower layer is considered. Two mixed-integer programming formulations of this problem are presented and discussed. Direct resolving of these formulations requirespre-selection of “good” candidate paths in the upper layer of the network. Thus, the paper presents an alternative approach which is based on decomposing the resolution process into two phases, resolved iteratively. The first phase subproblem is related to designing lower layer path flows that provide the capacities for the logical links of the upper layer. The second phase is related to designing the flow patterns in the upper layer with protection assured through diversity of paths. In this phase we take into account the failures of the logical links that result from the failures of the lower layer links (so called shared risk link groups).

Publiceringsår

2009

Språk

Engelska

Sidor

14-19

Publikation/Tidskrift/Serie

Journal of Telecommunications and Information Technology

Issue

3

Dokumenttyp

Artikel i tidskrift

Förlag

National Institute of Telecommunications

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Forskningsgrupp

  • Networking

ISBN/ISSN/Övrigt

  • ISSN: 1509-4553