Path Generation for Affine Flow Thinning

Research output: Contribution to journalArticle


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.


  • Michał Pióro
  • Ilya Kalesnikau
  • Michael Poss
External organisations
  • University of Montpellier
  • Warsaw University of Technology
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Communication Systems


  • affine routing, linear and mixed-integer programming, multicommodity flows, path generation, Survivable networks, variable link capacity
Original languageEnglish
Pages (from-to)355-364
Number of pages10
JournalElectronic Notes in Discrete Mathematics
Publication statusPublished - 2018 Feb 1
Publication categoryResearch