Network Optimization Problems Subject to Max-Min Fair Flow Allocation

作者：Amaldi Edoardo^*; Capone Antonio; Coniglio Stefano; Gianoli Luca G

来源：IEEE Communications Letters, 2013, 17(7): 1463-1466.

DOI：10.1109/LCOMM.2013.060513.130351

• Max-min fairness
• traffic engineering
• bandwidth sharing
• utility-based routing

We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since MMF appears as a reference model for a fair capacity allocation when the traffic flows are elastic and rates are adapted based on resource availability, we consider it as a requirement due to the way resources are shared by the distributed rate control scheme (like that of the transport protocol), rather than the routing objective. In particular, we define the traffic engineering problem where, given a network topology with link capacities and a set of elastic traffic demands to route, we must select a single path for each demand so as to maximize a network utility function, assuming an MMF bandwidth allocation. We propose a compact mixed-integer linear programming formulation as well as a restricted path formulation. We show with computational experiments that the exact formulation can be solved in a reasonable amount of computing time for medium-size networks and that the restricted path model provides solutions of comparable quality much faster.

• 出版日期2013-7