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). Network Optimization Problems Subject to Max-Min Fair Flow Allocation [journal article - articolo]. In IEEE COMMUNICATIONS LETTERS. Retrieved from http://hdl.handle.net/10446/229301

Network Optimization Problems Subject to Max-Min Fair Flow Allocation

Coniglio, Stefano;
2013

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.
articolo
Amaldi, Edoardo; Capone, Antonio; Coniglio, Stefano; Gianoli, Luca G.
(2013). Network Optimization Problems Subject to Max-Min Fair Flow Allocation [journal article - articolo]. In IEEE COMMUNICATIONS LETTERS. Retrieved from http://hdl.handle.net/10446/229301
File allegato/i alla scheda:
File Dimensione del file Formato  
2013-IEEECOMMLETTER.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 153.38 kB
Formato Adobe PDF
153.38 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/229301
Citazioni
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 24
social impact