This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the av-erage queue size. The gateway could notify connections of con-gestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset 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 con-nections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways.
|
1828
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
781
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
316
|
A Control-Theoretic Approach to Flow Control
– Keshav
- 1991
|
|
297
|
and D.D.Clark, “Observations and Dynamics of a Congestion Control Algorithm
– Zhang
- 1991
|
|
272
|
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks
– Ramakrishnan, Jain
- 1990
|
|
233
|
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
– FLOYD
- 1991
|
|
206
|
On traffic phase effects in packet-switched gateways
– Floyd, Jacobson
- 1992
|
|
196
|
Forecasting, Structural Time Series Models and the Kalman Filter
– Harvey
- 1989
|
|
196
|
Internet control message protocol
– Postel
- 1981
|
|
180
|
The synchronization of periodic routing messages
– FLOYD, JACOBOSON
- 1994
|
|
136
|
Congestion avoidance in computer networks with a connectionless network layer, part I-Concepts, goals and alternatives
– JAIN, RAMAKRISHNAN
- 1987
|
|
121
|
A New Architecture for Packet Switching Network Protocols, InTechnical Report TR-455
– Zhang
- 1989
|
|
108
|
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
– Jain
- 1989
|
|
97
|
Supporting Real-Time Applications
– Clark, Shenker, et al.
- 1992
|
|
78
|
Congestion Control in Computer Networks: Issues and Trends
– Jain
- 1990
|
|
66
|
iAnalysis of random drop for gateway congestion controlj
– Hashem
- 1989
|
|
66
|
REAL: A network simulator
– Keshav
- 1988
|
|
54
|
Probabilistic Analysis of Algorithms
– Hofri
- 1987
|
|
54
|
Oscillating Behavior of Network Traffic: A Case Study Simulation
– Zhang, Clark
- 1990
|
|
47
|
A new congestion control scheme: Slow start and search (Tri-S
– Wang, Crowcroft
- 1991
|
|
43
|
Dynamic Adaptive Windows for High Speed Data Networks with Multiple Paths and Propagation Delays (extended abstract
– Mitra, Seery
- 1991
|
|
36
|
Congestion Control for High Speed Packet Switched Networks
– Bala, Cidon, et al.
|
|
36
|
A hop by hop rate-based congestion control scheme
– Mishra, Kanakia
- 1992
|
|
34
|
Myths about congestion management in high-speed networks
– Jain
- 1992
|
|
31
|
A Table of Series and Products
– Hansen
- 1975
|
|
27
|
Something a Host Could Do with Source Quench", RFC 1016
– Prue, Postel
- 1987
|
|
13
|
Issues in flexible resource management for datagram network
– Floyd
- 1992
|
|
12
|
Nest: a Network Simulation and Prototyping Tool
– Dupuy, Schwartz, et al.
- 1988
|
|
10
|
Two fast implementations of the 'minimal standard' random number generator
– Carta
- 1990
|
|
8
|
Eliminating Periodic Packet Losses
– Wang, Crowcroft
- 1992
|
|
4
|
The Performance of Adaptive Window Flow Controls in a Dynamic Environment
– Pingali, Tipper, et al.
|
|
4
|
DTP: An efficient transport protocol
– Sanghi, Agrawala
- 1991
|
|
3
|
editors for the IETF Performance and Congestion Control Working Group, "Gateway congestion control survey", RFC 1254
– Mankin, Ramakrishnan
- 1991
|
|
3
|
Some Performance Results for TCP over ATM with Congestion", to appear
– Romanow
- 1993
|
|
2
|
Comments on the IETF performance and congestion control working group draft on gateway congestion control policies", unpublished
– Shenker
- 1989
|
|
1
|
Nest: A network simulation and prototyping tool
– Schwartz, Yemimi
- 1988
|
|
1
|
Two fast implementations of the 'minimal standard' random number generator
– Catta
- 1990
|
|
1
|
Supporting real-time applications in an integrated \ervices packet network: Architecture and mechanism
– Shenker, Zhang
- 1992
|
|
1
|
Strumrul Time Srr-ies Models and the Kalman Filter
– ec, q
- 1989
|
|
1
|
Prohahilrstic Analvsis - of . AlqoI-rthmA
– Hofn
- 1987
|
|
1
|
REAL: A network simulator
– Keshab
|
|
1
|
A hop by hop rate-based congestion control wheme
– Mishra, Kanakia
- 1992
|
|
1
|
The performance of adaptive windo% llow controls in a dynamic load environment," in /'roc
– Tipper, Hammond
- 1990
|
|
1
|
Internet control me\\age protocol
– Postel
- 1981
|
|
1
|
RANDOM EARLY DETECTlOh GATEUAYS 413
– FLOYD, JACOBSON
- 1987
|
|
1
|
A binary feedback \theme for congestion avoidance in computer networks
– Ramakrishnan, Jain
- 1990
|
|
1
|
Comments on the IETF perfomiance and congestion control working group draft on gateway congestion control policies." unpublished
– Shenker
- 1989
|
|
1
|
A new congeqtion control scheme: Slow Stan and search (Tri-S
– Wang, Crowcroft
- 1991
|
|
1
|
Eliminating periodic packet lo\ses in the 1371
– Wang, Crowcroft
- 1990
|
|
1
|
Rec.ursiiv Esrimariori orid Trmc~-Ser.ies Anu/\,i.s Nru
– Young
- 1984
|
