Congestion Control in Computer Networks: Trends and Issues
R. Jain

TL;DR
This paper critically examines congestion in computer networks, debunks common myths, proposes a resource-based definition, classifies congestion schemes, and discusses architectural factors and future research directions.
Contribution
It introduces a unified resource-based definition of congestion, classifies congestion control schemes, and analyzes architectural considerations for different congestion problems.
Findings
Common myths about congestion are false.
Different congestion problems require tailored solutions.
Survey of recent congestion control schemes and future research areas.
Abstract
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition for congestion based on supply and demand of resources is proposed and is then used to classify various congestion schemes. The issues that make the congestion problem a difficult one are discussed, and then the architectural decisions that affect the design of a congestion scheme are presented. It is argued that long-, medium- and short-term congestion problems require different solutions. Some of the recent schemes are brifly surveyed, and areas for further research are discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
