Fair end-to-end window-based congestion control
Top Cited Papers
- 1 October 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 8 (5) , 556-567
- https://doi.org/10.1109/90.879343
Abstract
In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation of the protocols.Keywords
This publication has 18 references indexed in Scilit:
- 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
- Congestion control and traffic management in ATM networks: Recent advances and a surveyComputer Networks and ISDN Systems, 1996
- Connections with multiple congested gateways in packet-switched networks part 1ACM SIGCOMM Computer Communication Review, 1991
- A theoretical analysis of feedback flow controlPublished by Association for Computing Machinery (ACM) ,1990
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988
- Flow Control Power is NondecentralizableIEEE Transactions on Communications, 1981
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981
- Fixed Point TheoryPublished by Springer Nature ,1981