Random Early Detection Gateways for Congestion Avoidance
| Title | Random Early Detection Gateways for Congestion Avoidance |
| Publication Type | Journal Article |
| Year of Publication | 1993 |
| Authors | Floyd, S., & Jacobson V. |
| Published in | IEEE/ACM Transactions on Networking |
| Volume | 1 |
| Issue | 4 |
| Page(s) | 397-413 |
| Other Numbers | 1627 |
| Abstract | This paper presents 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 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 connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. |
| Bibliographic Notes | IEEE/ACM Transactions on Networking, Vol. 1, No. 4, pp. 397-413 |
| Abbreviated Authors | S. Floyd and V. Jacobson |
| ICSI Research Group | Networking and Security |
| ICSI Publication Type | Article in journal or magazine |