Bandwidth Sharing: Objectives and Algorithms

DMCA

Bandwidth Sharing: Objectives and Algorithms (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by L. Massoulié , J. Roberts

Venue:	IEEE/ACM Transactions on Networking
Citations:	336 - 11 self

BibTeX

@INPROCEEDINGS{Massoulié99bandwidthsharing:,
    author = {L. Massoulié and J. Roberts},
    title = {Bandwidth Sharing: Objectives and Algorithms},
    booktitle = {IEEE/ACM Transactions on Networking},
    year = {1999},
    pages = {1395--1403}
}

OpenURL

Abstract

This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max-min fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third criterion, which is naturally interpreted in terms of the delays experienced by ongoing transfers. We prove that fixed size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner. We next consider a distributed random scheme where each traffic source varies its sending rate randomly, based on binary feedback information from the network. We show how to select the source behaviour so as to achieve an equilibrium distribution concentrated around the considered fair rate allocations. This stochastic analysis is then used to assess the asymptotic behaviour of deterministic rate adaption proc...

Keyphrases

bandwidth sharing classical fairness notion binary feedback information appropriate manner alternative proportional fairness criterion fixed size window control fair rate allocation so-called max-min fairness rate randomly distributed random scheme deterministic rate adaption proc network bandwidth resource traffic source equilibrium distribution stochastic analysis third criterion source behaviour fair bandwidth distributed algorithm asymptotic behaviour

DMCA