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 for an in-depth account on these techniques and their analysis. RRED Robust random early detection (RRED) algorithm was proposed to improve the TCP throughput against Denial-of-Service (DoS) attacks, particularly 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. RRED algorithm can significantly improve the performance of TCP under Low-rate Denial-of-Service attacks. See also Blue (queue management algorithm) Active queue management References External links RED (Random Early Detection) Queue Management. Author: Sally Floyd Guduz – A Simple Random Early Detection (RED) Simulator Variants of RED. Author: Hei Xiao Jun Recent Publications in Random Early Detection (RED) schemes Network performance Network scheduling algorithms da:Undgåelse af datanet-trafikforstoppelse#RED og WRED