Bandwidth sharing: objectives and algorithms

  title={Bandwidth sharing: objectives and algorithms},
  author={Laurent Massouli{\'e} and James Roberts},
  journal={IEEE/ACM Trans. Netw.},
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 Kelly; 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… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 17 extracted citations

Bandwidth shared acknowledgment (BSA) — A secure intrusion detection and multi path routing for MANETs

International Conference on Information Communication and Embedded Systems (ICICES2014) • 2014

Theoretical analysis of high-speed multiple TCP connections through multiple routers

2013 IEEE International Conference on Communications (ICC) • 2013
View 2 Excerpts

Weighted bandwidth sharing scheme to guarantee the video quality in home networks

The International Conference on Information Networking 2013 (ICOIN) • 2013
View 1 Excerpt

Self-optimized precoding and power control in cellular networks

2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications • 2011
View 1 Excerpt

Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications • 2007


Publications referenced by this paper.
Showing 1-6 of 6 references

Charging and rate control for elastic traffic

European Transactions on Telecommunications • 1997
View 10 Excerpts
Highly Influenced

Allocating fair rates for available bit rate service in ATM networks

A. Arulambalam, X. Q. Chen
IEEE Commun. Mag. , vol. 34, pp. 92–100, Nov. 1996. • 1996
View 8 Excerpts
Highly Influenced

Congestion avoidance and control

Computer Communication Review • 1995
View 7 Excerpts
Highly Influenced

Round-Robin Scheduling for Max-Min Fairness in Data Networks

IEEE Journal on Selected Areas in Communications • 1991
View 4 Excerpts
Highly Influenced

Fair end-to-end window-based congestion control

IEEE/ACM Trans. Netw. • 2000
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…