HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

On fairness in Bandwidth Allocation

Corinne Touati 1 Eitan Altman 2 Jérôme Galtier
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : For over a decade, the Nash bargaining solution (NBS) concept from cooperative game theory has been used in networks as a concept that allows one to share resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utilities. In this paper, we use this concept for the bandwidth allocation between applications with general concave utilities. We study the impact of concavity on the allocation and present computational methods for obtaining fair allocations in a general topology, based on a dual Lagrangian approach and on Semi-Definite Programming.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:23:14 PM
Last modification on : Friday, February 4, 2022 - 3:11:41 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:03:32 PM


  • HAL Id : inria-00072318, version 1



Corinne Touati, Eitan Altman, Jérôme Galtier. On fairness in Bandwidth Allocation. RR-4269, INRIA. 2001. ⟨inria-00072318⟩



Record views


Files downloads