Path Generation for Affine Flow Thinning
(2018) In Electronic Notes in Discrete Mathematics 64. p.355-364- Abstract
Flow thinning (FT) is a traffic routing and protection strategy for communication networks whose links experience fluctuations in available capacity (as, e.g., in wireless networks). To cope with this phenomenon, end-to-end traffic demands are assigned dedicated tunnels (e.g., MPLS tunnels) whose nominal capacity is subject to thinning in order to account for variable capacity of the links, fluctuating below their nominal values. Consequently, the instantaneous traffic sent between the demand's end nodes must accommodate to the current total capacity available on its dedicated tunnels. In the paper we present a path generation-based approach to network dimensioning for a practical version of FT applying affine flow thinning – a fairly... (More)
Flow thinning (FT) is a traffic routing and protection strategy for communication networks whose links experience fluctuations in available capacity (as, e.g., in wireless networks). To cope with this phenomenon, end-to-end traffic demands are assigned dedicated tunnels (e.g., MPLS tunnels) whose nominal capacity is subject to thinning in order to account for variable capacity of the links, fluctuating below their nominal values. Consequently, the instantaneous traffic sent between the demand's end nodes must accommodate to the current total capacity available on its dedicated tunnels. In the paper we present a path generation-based approach to network dimensioning for a practical version of FT applying affine flow thinning – a fairly complicated issue not yet considered. We derive a relevant pricing problem and present a numerical study illustrating efficiency of the optimization algorithm.
(Less)
- author
- Pióro, Michał LU ; Kalesnikau, Ilya and Poss, Michael
- organization
- publishing date
- 2018-02-01
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- affine routing, linear and mixed-integer programming, multicommodity flows, path generation, Survivable networks, variable link capacity
- in
- Electronic Notes in Discrete Mathematics
- volume
- 64
- pages
- 10 pages
- publisher
- Elsevier
- external identifiers
-
- scopus:85042363876
- ISSN
- 1571-0653
- DOI
- 10.1016/j.endm.2018.02.010
- language
- English
- LU publication?
- yes
- id
- 38210284-dc77-43b0-ac9d-1d3da8768d1c
- date added to LUP
- 2018-03-07 08:49:39
- date last changed
- 2022-05-10 22:19:58
@article{38210284-dc77-43b0-ac9d-1d3da8768d1c,
abstract = {{<p>Flow thinning (FT) is a traffic routing and protection strategy for communication networks whose links experience fluctuations in available capacity (as, e.g., in wireless networks). To cope with this phenomenon, end-to-end traffic demands are assigned dedicated tunnels (e.g., MPLS tunnels) whose nominal capacity is subject to thinning in order to account for variable capacity of the links, fluctuating below their nominal values. Consequently, the instantaneous traffic sent between the demand's end nodes must accommodate to the current total capacity available on its dedicated tunnels. In the paper we present a path generation-based approach to network dimensioning for a practical version of FT applying affine flow thinning – a fairly complicated issue not yet considered. We derive a relevant pricing problem and present a numerical study illustrating efficiency of the optimization algorithm.</p>}},
author = {{Pióro, Michał and Kalesnikau, Ilya and Poss, Michael}},
issn = {{1571-0653}},
keywords = {{affine routing; linear and mixed-integer programming; multicommodity flows; path generation; Survivable networks; variable link capacity}},
language = {{eng}},
month = {{02}},
pages = {{355--364}},
publisher = {{Elsevier}},
series = {{Electronic Notes in Discrete Mathematics}},
title = {{Path Generation for Affine Flow Thinning}},
url = {{http://dx.doi.org/10.1016/j.endm.2018.02.010}},
doi = {{10.1016/j.endm.2018.02.010}},
volume = {{64}},
year = {{2018}},
}