K. K. Ramakrishnan
ABSTRACT
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the network to adjust the amount of traffic allowed into the network. The servers 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 acknowledgement.
The scheme is distributed, adapts to the dynamic state of the networks, converges to the optimal operating point, is quite simple to implement, and has low overhead while operational. The scheme also addresses a very important aspect of fairness in the service provided to the various sources utilizing the network. The scheme attempts to maintain 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 for pathological conditions.
- Ahu79.V. A~uja. Routing ~nd tlow control ill systems network architecture. IBM $Fstems Journal, 18(2):293-314, 1979.Google Scholar
- BG85.Werner Bux and Davids C:rillo. Flow control in local-area networks of interconnected token rings. IEEE Transactions on Communications, COM-33(10)-1058-1066, October 1985.Google Scholar
- DNA82.DECnet 'Digital Network Architecture {Phase iV} General Description. Digital Equipment Corporation, 1982. Order No. AA-N149A-TC.Google Scholar
- GHKP78.A. Giessler, J. Haanle, A. Konig and E. Padc. Free Buffer Allocation - An Investigation by Simulation. Computer Networks, Vol. 1, No. 3, July 1978, pp. 191-204.Google Scholar
- Maji79.J.C. Majithia etal. Experiments in congestion control techniques. In Proceedings of the International $~rnposlum on Flow Contol in Computer Networks, pages 211- 234, February 1979.Google Scholar
- GK80.Mario Gerla al~d Leonard Kleinrock. Flow control: a comparative survey. 1EEE Tran~actior~ on (7ommumcation~, COM-2S(4):553-574, April 1980.Google Scholar
- Har84.Peter G. Harrison. An analytic model for flow control schemes in colllnmnication network nodes. IEEE Transactions on Communications, COM-32(9):1013-1019, September 1984.Google Scholar
- ISO86.Lqo 8073: Information Processing Systems - Open Systems Ir, terconnection - Connection Orier~ted Tran.~port Protocol Specification. International Organization for Standardization, July 1986. (Rel.no. ISO 8073-1986 (E)).Google Scholar
- Jai86.Raj Jain. A timeout-based congestion control scheme for window flow-controlled networks. IEEE Journal on Selected Areas in Communicgtior~s, October 1986.Google ScholarDigital Library
- JCH84.R.K. Jain, l)ah-Ming Chiu, and Willian~ R. ttawe. A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems. DEC Technical tleport TR-301, Digital Equipment Corporation, September 1984.Google Scholar
- JR87.Raj Jain and K. K. Ralnakrishnan. Congestion Avoidance in Computer Networks with a Oonnectionless Network Layer: Concepts, Goals and Methodology. Proceedings of the Computer Networking Symposium - 1988, pages 134- 143, April 1988.Google Scholar
- Kle78.Leonard Kleinrock. On flow control in computer networks. In Proceedings of the International Conference on Communications, June 1978.Google Scholar
- Kle79.L. Kleinrock. Power and deterministic rules of thumb for probabilistic problems ill computer communications. Proceedir~gs of the international Conference on Uommuncations, June 1979.Google Scholar
- Nag84.John Nagle. Congestion control in tcp/ip internetworks. Computer Communication Review, 14(4), October 1984. Google ScholarDigital Library
- Ram86.K.K. Ramakrishnan. Analysis of a dynamic window congestion control protocol in heterogeneous enviroltnmnts including satellite links, ht Proceedings of the Computer Networking Symposium, November 1986.Google Scholar
- Rei83.M. Reiser. Queuei~g and delay analysis of a buffer pool with resume level. In A. K. Agrawala altd S. K. Tripathi, editor% Performance '83, pages 25-32, May 1983. Google Scholar
- Tan81.Andrew S. Ta~mnbaum. Computer Networks. Prentice- Hall, Englewood Cliffs, N. J., 1981.Google Scholar
- YY83.Takshing P. Yum and Hung-Ming Yen. Design algorithm for a hysteresis buffer congestion control strategy. In Proceedings of the IEEE International Conference on Commnications~ pages 499-503, June 1983.Google Scholar
- ZSEG82.J. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Caller. Balanced job bound analysis of queueing networks. Communications of the ACM, 25(2), February 1982. Google ScholarDigital Library
Index Terms
- A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
Recommendations
A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of ...
A binary feedback scheme for congestion avoidance in computer networks
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 ...
A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication ReviewWe propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of ...
Comments