Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/LCOMM.2013.060513.130351 | Communications Letters, IEEE |
Keywords | Field | DocType |
bandwidth allocation,integer programming,linear programming,minimax techniques,radio links,resource allocation,telecommunication network routing,telecommunication network topology,telecommunication traffic,transport protocols,MMF bandwidth allocation,MMF paradigm,compact mixed-integer linear programming,computing time,distributed rate control scheme,elastic traffic demand,fair capacity allocation,link capacities,max-min fair flow allocation,max-min fairness,medium-size network,network optimization problem,network topology,network utility function,path model,resource availability,restricted path formulation,routing objective,traffic engineering,traffic flow,transport protocol,Max-min fairness,bandwidth sharing,traffic engineering,utility-based routing | Mathematical optimization,Bandwidth allocation,Computer science,Computer network,Network utility,Network topology,Integer programming,Resource allocation,Linear programming,Traffic engineering,Optimization problem,Distributed computing | Journal |
Volume | Issue | ISSN |
17 | 7 | 1089-7798 |
Citations | PageRank | References |
16 | 0.94 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edoardo Amaldi | 1 | 16 | 0.94 |
| Antonio Capone | 2 | 92 | 7.52 |
| Stefano Coniglio | 3 | 16 | 0.94 |
| Gianoli, L.G. | 4 | 73 | 3.28 |