A distributed auction-based algorithm to allocate bandwidth over paths - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A distributed auction-based algorithm to allocate bandwidth over paths

Résumé

In the literature, Vickrey-Clark-Groves (VCG) double-sided auctions have been applied to inter-domain traffic exchange because they provide incentives to be truthful and lead to an efficient use of the network, among relevant properties of mechanism design. Unfortunately, the resulting resource allocation scheme is neither budget-balanced nor solvable in a decentralized way, two important properties. We present a different but more realistic auction-based algorithm for allocating bandwidth over paths to end users or ISPs, leading to a new budget-balanced pricing scheme for which allocations and charges can be computed in a decentralized way.
Fichier principal
Vignette du fichier
regpaper1.pdf (218.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00597139 , version 1 (31-05-2011)

Identifiants

  • HAL Id : inria-00597139 , version 1

Citer

Hoang-Hai Tran, Bruno Tuffin. A distributed auction-based algorithm to allocate bandwidth over paths. NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Ghent, Belgium. ⟨inria-00597139⟩
277 Consultations
165 Téléchargements

Partager

Gmail Facebook X LinkedIn More