Congestion avoidance in computer networks with a connectionless network layer
Author(s)
Author(s)
Jain, R.
Ramakrishnan, K. K.
Date Issued
1988
Publisher
Digital Equipment Corporation
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 network uses a single bit in the network layer header to feed back the congestion information to its users, which then increase or decrease their load to make optimal use of the resources. The concept of global optimality in a distributed system is defined in terms of efficiency and fairness such that they can be independently quantified and apply to any number of resources and users.
The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, convergent, robust, distributed, and configuration-independent.
SFU Affiliated Publication
No
Availability at SFU Library
No database links found.