Cited by 6,290Network Traffic and Congestion ControlSoftware-Defined Networks and 5GTraffic control and management

Random early detection gateways for congestion avoidance

Floyd, S., Jacobson, V.·1993·IEEE/ACM Transactions on Networking

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.>

Integrity signals

Registry

Crossref · 10.1109/90.251892

Cites

45 of 45 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Floyd, S., & Jacobson, V.
Affiliations
Lawrence Berkeley National Laboratory (US)
Venue
IEEE/ACM Transactions on Networking
Published
1993
Volume
1
Issue
4
Pages
397-413
ISSN
1063-6692 (ISSN-L)
OpenAlex
W2158733823
Cited by
6,290
References
45
Citations by year
2026: 44 · 2025: 60 · 2024: 83 · 2023: 79 · 2022: 90 · 2021: 113 · 2020: 124 · 2019: 134 · 2018: 107 · 2017: 131 · 2016: 175 · 2015: 180 · 2014: 189 · 2013: 203 · 2012: 260
FWCI
14.32
Type
journal article
Language
en
Open access
closed
Locations
IEEE/ACM Transactions on Networking (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
Keywords
random early detection, congestion avoidance, packet-switched networks, packet dropping, packet marking, TCP congestion control, global synchronization, bursty traffic, bandwidth sharing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review