We investigate a bilevel network routing problem where, given a directed graph with a capacity for each arc and a set of elastic traffic demands specified by the corresponding origin-destination pairs, the network operator has to select a single path for each pair so as to maximize the total throughput while assuming that the flows are allocated over the chosen paths according to a fairness principle. We consider max-min fair flow allocation as well as maximum bottleneck flow allocation. After presenting a complexity result, we discuss MILP formulations for the two problem versions, describe a Branch-and-Price algorithm and report some computational results.

(2014). Maximum throughput network routing subject to fair flow allocation . Retrieved from http://hdl.handle.net/10446/229354

Maximum throughput network routing subject to fair flow allocation

Coniglio, Stefano;
2014

Abstract

We investigate a bilevel network routing problem where, given a directed graph with a capacity for each arc and a set of elastic traffic demands specified by the corresponding origin-destination pairs, the network operator has to select a single path for each pair so as to maximize the total throughput while assuming that the flows are allocated over the chosen paths according to a fairness principle. We consider max-min fair flow allocation as well as maximum bottleneck flow allocation. After presenting a complexity result, we discuss MILP formulations for the two problem versions, describe a Branch-and-Price algorithm and report some computational results.
Amaldi, Edoardo; Coniglio, Stefano; Taccari, Leonardo
File allegato/i alla scheda:
File Dimensione del file Formato  
ISCO-LNCS-14.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 384.94 kB
Formato Adobe PDF
384.94 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/229354
Citazioni
  • Scopus 6
  • ???jsp.display-item.citation.isi??? ND
social impact