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.
Complete Paper in (latest version as published in ACM Transactions): Adobe Acrobat (1,704,091 bytes)
An earlier version of this paper was published in SIGCOMM and was selected as the best paper for publication in ACM transactions.
It was then republished in 25th anniversary issue of Computer Communications.
and is a winner of
SIGCOMM Test of Time Paper Award