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.

Path diversity protection in two-layer networks

På svenska

Author

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

Publishing year

2009

Language

English

Pages

14-19

Publication/Series

Journal of Telecommunications and Information Technology

Issue

3

Document type

Journal article

Publisher

National Institute of Telecommunications

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Research group

  • Networking

ISBN/ISSN/Other

  • ISSN: 1509-4553