Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking · 1993 · 6,316 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Floyd, S., & Jacobson, V. L. (1993). Random early detection gateways for congestion avoidance. IEEE/ACM/Transactions/on/Networking, 1(4), 397–413. https://doi.org/10.1109/90.251892
In text: (Floyd & Jacobson, 1993)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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.>
Related papers
- Social force model for pedestrian dynamics1995
- T-GCN: A Temporal Graph Convolutional Network for Traffic Prediction2019
- Traffic Flow Prediction With Big Data: A Deep Learning Approach2014
- Modeling and Forecasting Vehicular Traffic Flow as a Seasonal ARIMA Process: Theoretical Basis and Empirical Results2003
- Self-Organized Pedestrian Crowd Dynamics: Experiments, Simulations, and Design Solutions2005
Metadata from OpenAlex (CC0). Citations are generated from the published record.