Bandwidth sharing: objectives and algorithms
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 10 (3), 320-328
- https://doi.org/10.1109/tnet.2002.1012364
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. The alternative proportional fairness criterion has recently been introduced by F. Kelly (see Eur. Trans. Telecommun., vol.8, p.33-7, 1997); 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 then 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 behavior so as to achieve an equilibrium distribution concentrated around the considered fair rate allocations. This stochastic analysis is then used to assess the asymptotic behavior of deterministic rate adaption procedures.Keywords
This publication has 16 references indexed in Scilit:
- End-to-end congestion control for the Internet: delays and stabilityIEEE/ACM Transactions on Networking, 2001
- Fair end-to-end window-based congestion controlIEEE/ACM Transactions on Networking, 2000
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Rate control algorithms for the ATM ABR serviceEuropean Transactions on Telecommunications, 1997
- Allocating fair rates for available bit rate service in ATM networksIEEE Communications Magazine, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989