Robust random early detection: Difference between revisions

Revision as of 11:39, 2 November 2020

Revision as of 03:00, 16 December 2020

Line 1:

'''Robust random early detection''' ('''RRED''') is a queueing disclipine for a [[network scheduler]]. The existing [[random early detection]] (RED) algorithm and its variants are found vulnerable to emerging attacks, especially the [[Denial-of-service attack#Low-rate Denial-of-Service attacks|Low-rate Denial-of-Service attack]]s (LDoS). Experiments have confirmed that the existing RED-like algorithms are notably vulnerable under LDoS attacks due to the oscillating TCP queue size caused by the attacks.<ref name=RRED>{{Cite journal | last1 = Zhang | first1 = C. | last2 = Yin | first2 = J. | last3 = Cai | first3 = Z. | last4 = Chen | first4 = W. | title = RRED: Robust RED algorithm to counter low-rate denial-of-service attacks | doi = 10.1109/LCOMM.2010.05.091407 | journal = [[IEEE Communications Letters]] | volume = 14 | issue = 5 | pages = 489–491 | date=May 2010 | pmid = | pmc = | url = https://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0}}</ref>

The Robust RED (RRED) algorithm was proposed to improve the TCP throughput against LDoS attacks. The basic idea behind the RRED is to detect and filter out attack packets before a normal RED algorithm is applied to incoming flows. RRED algorithm can significantly improve the performance of TCP under Low-rate denial-of-service attacks.<ref name="RRED"/>