RED

E325873

RED (Random Early Detection) is an active queue management algorithm used in networking to preemptively drop packets and control congestion before router buffers overflow.

All labels observed (1)

Label Occurrences
RED canonical 1

How this entity was disambiguated

Statements (42)

Predicate Object
instanceOf active queue management algorithm ⓘ
congestion control mechanism ⓘ
abbreviationFor Random Early Detection ⓘ
action drops packets probabilistically ⓘ
preemptively drops packets ⓘ
signals incipient congestion to end hosts ⓘ
advantageOver tail drop in avoiding lock-out and global synchronization ⓘ
aimsTo avoid buffer overflow ⓘ
avoid global synchronization of TCP flows ⓘ
improve overall network throughput ⓘ
maintain small average queue sizes ⓘ
reduce queueing delay ⓘ
category queue management algorithm ⓘ
router-level congestion control ⓘ
contrastsWith tail drop queue management ⓘ
controls average queue length ⓘ
dropPolicy does not drop packets when average queue length is below minimum threshold ⓘ
drops all packets when average queue length exceeds maximum threshold ⓘ
drops packets when average queue length is between minimum and maximum thresholds ⓘ
fullName Random Early Detection ⓘ
hasParameter maximum drop probability ⓘ
maximum threshold ⓘ
minimum threshold ⓘ
weighting factor for average queue length ⓘ
hasPurpose congestion avoidance ⓘ
queue management ⓘ
to control congestion before router buffers overflow ⓘ
implementedIn many router operating systems ⓘ
influenced design of modern AQM schemes ⓘ
introducedInContextOf TCP/IP congestion control research ⓘ
limitation may perform poorly under highly variable traffic if misconfigured ⓘ
sensitive to parameter tuning ⓘ
operatesOn packet queues ⓘ
router output queues ⓘ
predecessorOf Adaptive RED ⓘ
Weighted RED ⓘ
requires configuration of threshold parameters ⓘ
standardizedIn IETF recommendations for active queue management ⓘ
usedIn IP routers ⓘ
computer networking ⓘ
packet-switched networks ⓘ
uses exponentially weighted moving average of queue length ⓘ

How these facts were elicited

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.