Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072318
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:23:14 PM
Last modification on : Monday, October 12, 2020 - 10:30:21 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:03:32 PM

Identifiers

  • HAL Id : inria-00072318, version 1

Collections

Citation

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

Share

Metrics

Record views

345

Files downloads

209