Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Random early detectionComputer networkComputer scienceActive queue managementNetwork congestionQueueNetwork packetPacket lossExplicit Congestion NotificationDefault gatewayGateway (web page)Real-time computingTCP tuning
Affiliated Institutions
Related Publications
Traffic phase effects in packet-switched gateways
Much of the traffic in existing packet networks is highly periodic, either because of periodic sources (e.g., real time speech or video, rate control) or because window flow con...
Connections with multiple congested gateways in packet-switched networks part 1
In this paper we explore the bias in TCP/IP networks against connections with multiple congested gateways. We consider the interaction between the bias against connections with ...
Congestion control for high speed packet switched networks
The authors suggest and investigate a general input congestion control scheme that takes into account a broad spectrum of network issues. As a preventive congestion control stra...
Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays
The optimal design of windows for virtual circuits has been studied for high-speed, wide-area data networks in an asymptotic framework in which the delay-bandwidth product is th...
The performance of adaptive window flow controls in a dynamic load environment
The behavior of window flow control schemes that adapt to changing network conditions is studied. A dynamic window scheme, which adjusts the window size based on explicit networ...
Publication Info
- Year
- 1993
- Type
- article
- Volume
- 1
- Issue
- 4
- Pages
- 397-413
- Citations
- 6244
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6244
OpenAlex
Cite This
Sally Floyd,
Van Jacobson
(1993).
Random early detection gateways for congestion avoidance.
IEEE/ACM Transactions on Networking
, 1
(4)
, 397-413.
https://doi.org/10.1109/90.251892
Identifiers
- DOI
- 10.1109/90.251892