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 queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a present threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. >

[1]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[2]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1995, CCRV.

[3]  Van Jacobson,et al.  The synchronization of periodic routing messages , 1994, TNET.

[4]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[5]  A. Romanow.  TCP over ATM with Congestion: Some Performance Results , 1993, Proceedings of the 6th IEEE Workshop on Local and Metropolitan Area Networks.

[6]  V. Jacobson,et al.  The synchronization of periodic routing messages , 1993, SIGCOMM '93.

[7]  Ashok K. Agrawala,et al.  DTP: An Efficient Transport Protocol , 1992, NETWORKS.

[8]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[9]  Jon Crowcroft,et al.  Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm , 1992, CCRV.

[10]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[11]  Sally Floyd,et al.  Issues in Flexible Resource Manage-ment for Datagram Networks , 1992 .

[12]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[13]  Srinivasan Keshav,et al.  A control-theoretic approach to flow control , 1991, SIGCOMM '91.

[14]  S. Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[15]  K. K. Ramakrishnan,et al.  Gateway Congestion Control Survey , 1991, RFC.

[16]  Debasis Mitra,et al.  Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[17]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[18]  Jon Crowcroft,et al.  A new congestion control scheme: slow start and search (Tri-S) , 1991, CCRV.

[19]  Debasis Mitra,et al.  Dynamic adaptive windows for high speed data networks: theory and simulations , 1990, SIGCOMM '90.

[20]  Israel Cidon,et al.  Congestion control for high speed packet switched networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[21]  David Tipper,et al.  The performance of adaptive window flow controls in a dynamic load environment , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[22]  K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks , 1990, TOCS.

[23]  Andrew C. Harvey,et al.  Forecasting, structural time series models and the Kalman filter: Selected answers to exercises , 1990 .

[24]  David G. Carta,et al.  Two fast implementations of the “minimal standard” random number generator , 1990, CACM.

[25]  R. Jain.  Congestion control in computer networks: issues and trends , 1990, IEEE Network.

[26]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[27]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[28]  Srinivasan Keshav,et al.  REAL: A Network Simulator , 1988 .

[29]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[30]  Yechiam Yemini,et al.  Nest: A Network Simulation and Prototyping Tool , 1988, USENIX Winter.

[31]  Jon Postel,et al.  Something a Host Could Do with Source Quench: The Source Quench Introduced Delay (SQuID) , 1987, RFC.

[32]  Micha Hofri,et al.  Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.

[33]  L. P. Kok,et al.  Table erratum: A table of series and products [Prentice-Hall, Englewood Cliffs, N.J., 1975] by E. R. Hansen , 1986 .

[34]  Peter C. Young,et al.  Recursive Estimation and Time-Series Analysis: An Introduction , 1984 .

[35]  Peter C. Young,et al.  Recursive Estimation and Time Series Analysis , 1984 .

[36]  Jon Postel,et al.  Internet Control Message Protocol , 1981, RFC.

[37]  E. Hansen.  A Table of Series and Products , 1977 .

[38]  W. Hoeffding.  Probability inequalities for sum of bounded random variables , 1963 .