Abstract
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the users, who adjust the amount of traffic allowed into the network. The routers in the network detect congestion and set a congestion-indication bit on packets flowing in the forward direction. The congestion indication is communicated back to the users through the transport-level acknowledgment. The scheme is distributed, adapts to the dynamic state of the network, converges to the optimal operating point, is quite simple to implement, and has low overhead. The scheme maintains fairness in service provided to multiple sources. This paper presents the scheme and the analysis that went into the choice of the various decision mechanisms. We also address the performance of the scheme under transient changes in the network and pathological overload conditions.
Keywords
Connectionless communicationComputer scienceComputer networkNetwork congestionNetwork traffic controlScheme (mathematics)Network packetOverhead (engineering)Distributed computing
Affiliated Institutions
Related Publications
Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology
The authors compare the concept of congestion with that of flow control and congestion control. A number of possible alternatives for congestion avoidance are identified. From t...
The click modular router
Clicks is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements . Individual ele...
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
In heterogeneous networks, achieving congestion avoidance is difficult because the congestion feedback from one subnetwork may have no meaning to sources on other subnetworks. W...
Random early detection gateways for congestion avoidance
The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average...
Resilient overlay networks
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance wi...
Publication Info
- Year
- 1990
- Type
- article
- Volume
- 8
- Issue
- 2
- Pages
- 158-181
- Citations
- 366
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
366
OpenAlex
Cite This
K. K. Ramakrishnan,
Raj Jain
(1990).
A binary feedback scheme for congestion avoidance in computer networks.
ACM Transactions on Computer Systems
, 8
(2)
, 158-181.
https://doi.org/10.1145/78952.78955
Identifiers
- DOI
- 10.1145/78952.78955