Advanced

Path diversity protection in two-layer networks

Dzida, M; Sliwinski, T; Zagozdzon, M; Ogryczak, W and Pioro, Michal LU (2009) In Journal of Telecommunications and Information Technology p.14-19
Abstract
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.... (More)
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). (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Journal of Telecommunications and Information Technology
issue
3
pages
14 - 19
publisher
National Institute of Telecommunications
ISSN
1509-4553
language
English
LU publication?
yes
id
fec7a53e-d67c-4b70-99fb-a20b046cc72c (old id 1365966)
alternative location
http://www.nit.eu/czasopisma/JTIT/2009/3/14.pdf
date added to LUP
2009-03-26 14:04:36
date last changed
2016-04-16 06:26:34
@article{fec7a53e-d67c-4b70-99fb-a20b046cc72c,
  abstract     = {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).},
  author       = {Dzida, M and Sliwinski, T and Zagozdzon, M and Ogryczak, W and Pioro, Michal},
  issn         = {1509-4553},
  language     = {eng},
  number       = {3},
  pages        = {14--19},
  publisher    = {National Institute of Telecommunications},
  series       = {Journal of Telecommunications and Information Technology},
  title        = {Path diversity protection in two-layer networks},
  year         = {2009},
}