Editing Random early detection (section)

== Other variants ==

===WRED===
{{Main article|Weighted random early detection}}

In weighted RED you can have different probabilities for different priorities ([[Type of Service|IP precedence]], [[Differentiated Services Code Point|DSCP]])  and/or queues.<ref>{{cite book | first=H. Jonathan |last=Chao | doi=10.1002/0471224391.fmatter_indsub|title= Quality of service control in high speed networks |pages=i-xvi |publisher = John Wiley & Sons Inc.| location = New York|year = 2002 | isbn= 978-0-471-00397-7 |chapter=Frontmatter and Index }}</ref>

===ARED===
The adaptive RED or active RED (ARED) algorithm<ref>{{cite journal | first = Sally | last = Floyd |author2=Gummadi, Ramakrishna |author3=Shenker, Scott | title = Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management  | url = http://citeseer.ist.psu.edu/floyd01adaptive.html | date = 2001-08-01 | accessdate = 2008-03-16}}</ref> infers whether to make RED more or less aggressive based on the observation of the average queue length. If the average queue length oscillates around ''min'' threshold then early detection is too aggressive. On the other hand, if the average queue length oscillates around ''max'' threshold then early detection is being too conservative. The algorithm changes the probability according to how aggressively it senses it has been discarding traffic.

See Srikant<ref>{{cite book | last = Srikant | first = Rayadurgam | url = https://www.springer.com/birkhauser/mathematics/book/978-0-8176-3227-4 | title = The Mathematics of Internet Congestion Control | publisher = Birkhäuser | location = Boston, MA, USA | year = 2004 | isbn = 978-0-8176-3227-4 }}</ref> for an in-depth account on these techniques and their analysis.

===RRED===
{{Main article|Robust random early detection}}

Robust random early detection (RRED) algorithm was proposed to improve the TCP throughput against Denial-of-Service (DoS) attacks, particularly [http://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0 Low-rate Denial-of-Service] (LDoS) attacks. Experiments have confirmed that the existing RED-like algorithms are notably vulnerable under Low-rate Denial-of-Service (LDoS) attacks due to the oscillating TCP queue size caused by the attacks.<ref name=RRED>{{cite journal|last=Zhang|first=Changwang|author2=Yin, Jianping |author3=Cai, Zhiping |author4= Chen, Weifeng |title=RRED: robust RED algorithm to counter low-rate denial-of-service attacks|journal=IEEE Communications Letters|date=1 May 2010|volume=14|issue=5|pages=489–491|doi=10.1109/LCOMM.2010.05.091407|s2cid=1121461 }}</ref> RRED algorithm can significantly improve the performance of TCP under Low-rate Denial-of-Service attacks.<ref name="RRED"/>