Random Early Detection

E325872

Random Early Detection is a congestion avoidance mechanism for packet-switched networks that probabilistically drops packets before a queue becomes full to signal and control incipient congestion.

All labels observed (9)

How this entity was disambiguated

Statements (47)

Predicate Object
instanceOf active queue management algorithm ⓘ
congestion avoidance mechanism ⓘ
abbreviation RED ⓘ
actsOn incoming packets ⓘ
aimsTo avoid global synchronization of TCP flows ⓘ
keep queueing delay low ⓘ
maintain high link utilization ⓘ
canBeCombinedWith Explicit Congestion Notification ⓘ
category Internet congestion control ⓘ
network traffic management ⓘ
configurationChallenge sensitive to parameter settings ⓘ
contrastsWith tail drop ⓘ
deployment implemented in many router operating systems ⓘ
describedIn Random Early Detection Gateways for Congestion Avoidance ⓘ
designedFor routers ⓘ
dropPolicy does not drop packets when average queue size is below minimum threshold ⓘ
drops all packets when average queue size is above maximum threshold ⓘ
drops packets with probability increasing with average queue size ⓘ
feedbackMechanism implicit congestion notification via packet loss ⓘ
influenced Adaptive RED ⓘ
Controlled Delay (CoDel) ⓘ
linked to: CoDel

Proportional Integral controller Enhanced (PIE) ⓘ
Random Early Marking ⓘ
Weighted RED ⓘ
influences end-to-end congestion control algorithms ⓘ
introducedBy Sally Floyd ⓘ
Van Jacobson ⓘ
introducedIn early 1990s ⓘ
keyParameter maximum drop probability ⓘ
maximum threshold ⓘ
minimum threshold ⓘ
limitation can be difficult to tune for diverse traffic patterns ⓘ
operatesIn packet-switched networks ⓘ
primaryGoal congestion avoidance ⓘ
control incipient congestion ⓘ
problemAddressed bufferbloat ⓘ
publicationYear 1993 ⓘ
publishedIn IEEE/ACM Transactions on Networking ⓘ
queueBehavior drops packets before queue becomes full ⓘ
queueDisciplineType probabilistic queue management ⓘ
queueMetric average queue size ⓘ
signals impending congestion to end hosts ⓘ
standardizedIn IETF RFC 2309 guidelines ⓘ
usedWith TCP congestion control ⓘ
uses exponentially weighted moving average of queue length ⓘ
usesMethod probabilistic packet dropping ⓘ
worksOn output queues ⓘ

How these facts were elicited

Referenced by (18)

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

RFC 3168 → relatedConcept → Random Early Detection ⓘ
The Addition of Explicit Congestion Notification (ECN) to IP → definesInteractionWith → Random Early Detection (RED) ⓘ
linked to: Random Early Detection
RFC 2481 → relatedTo → Random Early Detection ⓘ
S. Floyd → knownFor → Random Early Detection ⓘ
S. Floyd → notableWork → Random Early Detection gateways for congestion avoidance ⓘ
linked to: Random Early Detection
Active Queue Management → hasExample → Random Early Detection ⓘ
Active Queue Management → hasExample → BLUE queue management algorithm ⓘ
linked to: Random Early Detection
Random Early Detection → describedIn → Random Early Detection Gateways for Congestion Avoidance ⓘ
linked to: Random Early Detection
Random Early Detection → influenced → Adaptive RED ⓘ
linked to: Random Early Detection
RED → fullName → Random Early Detection ⓘ
RED → abbreviationFor → Random Early Detection ⓘ
RED → predecessorOf → Weighted RED ⓘ
linked to: Random Early Detection
RED → predecessorOf → Adaptive RED ⓘ
linked to: Random Early Detection
Sally Floyd → knownFor → Random Early Detection ⓘ
Sally Floyd → notableWork → Random Early Detection Gateways for Congestion Avoidance ⓘ
linked to: Random Early Detection
Sally Floyd → notableIdea → Random Early Detection for congestion avoidance ⓘ
linked to: Random Early Detection
Van Jacobson → knownFor → Random Early Detection ⓘ
Van Jacobson → knownFor → RED active queue management ⓘ
linked to: Random Early Detection