On fairness in Bandwidth Allocation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

On fairness in Bandwidth Allocation


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4269.pdf (329.25 Ko) Télécharger le fichier

Dates and versions

inria-00072318 , version 1 (23-05-2006)


  • 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⟩
126 View
93 Download


Gmail Facebook Twitter LinkedIn More