Bandwidth sharing: Objectives and algorithms

IEEE/ACM Transactions on Networking

Volumn 10, Issue 3, 2002, Pages 320-328

  Massoulié, Laurent ^a   Roberts, James ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b ORANGE LABS   (France)

Author keywords

Congestion control; Distributed random search; Fixed size window control; Max min fairness; Potential delay minimization; Proportional fairness

Indexed keywords

ALGORITHMS; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); OPTIMIZATION; SCHEDULING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

BANDWIDTH SHARING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036602449     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2002.1012364     Document Type: Article

References (20)

1. Allocating fair rates for available bit rate service in ATM networks
2. Impact of fairness on Internet performance
3. Congestion control with explicit rate indication
4. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
5. Round-robin scheduling for max-min fairness in data networks
6. Rate control algorithms for the ATM ABR service
7. A note on the fairness of additive increase and multiplicative decrease
8. Congestion avoidance and control
9. End-to-end congestion control for the Internet: Delays and stability
10. Charging and rate control for elastic traffic
11. Rate control for communication networks: Shadow prices, proportional fairness and stability
12. Optimization flow control: Part I - Basic algorithms and convergence
13. Stability of distributed congestion control with heterogeneous feedback delays
14. Bandwidth sharing and admission control for elastic traffic
15. Fair end-to-end window-based congestion control
16. A generalized processor sharing approach to flow control in intergrated services networks: The single-node case
17. Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times