Congestion Avoidance in Computer Networks with a Connectionless Network Layer
R. Jain, K. Ramakrishnan, D. Chiu

TL;DR
This paper explores congestion avoidance in connectionless computer networks, proposing a binary feedback scheme that prevents congestion by adjusting load, demonstrating its efficiency, fairness, and robustness through simulation.
Contribution
Introduces a binary feedback congestion avoidance scheme for connectionless networks, emphasizing its global optimality, efficiency, and fairness, with simulation validation.
Findings
The scheme is globally efficient and fair.
It is responsive, convergent, and robust.
The approach is configuration-independent.
Abstract
Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. In this report, we summarize our research on congestion avoidance. We compare the concept of congestion avoidance with that of congestion control. Briefly, congestion control is a recovery mechanism, while congestion avoidance is a prevention mechanism. A congestion control scheme helps the network to recover from the congestion state while a congestion avoidance scheme allows a network to operate in the region of low delay and high throughput with minimal queuing, thereby preventing it from entering the congested state in which packets are lost due to buffer shortage. A number of possible alternatives for congestion avoidance were identified. From these alternatives we selected one called the binary feedback scheme in which the…
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.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Network Traffic and Congestion Control · Cloud Computing and Resource Management
