Robust random early detection: Difference between revisions

Revision as of 16:00, 5 June 2011

Latest revision as of 13:38, 7 January 2024

(44 intermediate revisions by 21 users not shown)

Line 1:

'''Robust random early detection''' ('''RRED''') is a queueing discipline for a [[network scheduler]]. The existing Random[[random Earlyearly Detectiondetection]] (RED) algorithm and its variants are found vulnerable to emerging attacks, especially the [http://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow[Denial-rateDenialof-service attack#Low-rate Denial-of-ServiceAttacks.pdf?attredirects=0Service attacks|Low-rate Denial-of-Service attack]]s (LDoS) attacks. 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 = [http[IEEE Communications Letters]] | volume = 14 | issue = 5 | pages = 489–491 | date=May 2010 | s2cid = 1121461 | url = https://sites.google.com/site/cwzhangres/home/postsfiles/recentpublicationsinlowRREDRobustREDAlgorithmtoCounterLow-ratedosattacks Recent Publications in low-rate DenialrateDenial-of-ServiceServiceAttacks.pdf?attredirects=0}}</ref> (DoS) attacks ]

AThe 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 Denialdenial-of-Serviceservice attacks. <ref>Changwang Zhang, Jianping Yin, Zhiping Cai, and Weifeng Chen, name="RRED: Robust RED Algorithm to Counter Low-rate Denial-of-Service Attacks, IEEE Communications Letters, vol. 14, pp. 489-491, 2010.[http:"//sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0 PDF] | [http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5456075 REF]</ref>

===The Designdesign of RoustRobust RED (RRED)===

[http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinactivequeuemanagementaqmschemes Recent Publications in Active Queue Management (AQM) schemes]

A detection and filter block is added in front of a regular RED block on a router. The basic idea behind the RRED is to detect and filter out LDoS attack packets from incoming flows before they feed to the RED algorithm. How to distinguish an attacking packet from normal TCP packets is critical in the RRED design. [http://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0 More Details]

Within a benign TCP flow, the sender will delay sending new packets if loss is detected (e.g., a packet is dropped). Consequently, a packet is suspected to be an attacking packet if it is sent within a short-range after a packet is dropped. This is the basic idea of the detection algorithm of Robust RED (RRED).<ref name="RRED"/>

===The Design of Roust RED (RRED)===

===Pseudo codesAlgorithm of the RoustRobust RED (RRED) algorithm===

A detection and filter block is added in front of a regular RED block on a router. The basic idea behind the RRED is to detect and filter out LDoS attack packets from incoming flows before they feed to the RED algorithm. How to distinguish an attacking packet from normal TCP packets is critical in the RRED design. [http://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0 More Details]

'''algorithm''' RRED-ENQUE(pkt)

01 f←RRED f ← RRED-FLOWHASH(pkt)

02 Tmax←MAX Tmax ← MAX(Flow[f].T1, T2)

03 '''if''' pkt.arrivaltimearrivaltime is within [Tmax, Tmax+T*] '''then'''

04 reduce local indicator by 1 for each bin corresponding to f

05 '''else'''

06 increase local indicator by 1 for each bin of f

07 Flow[f].I←maximumI ← maximum of local indicators from bins of f

08 '''if''' Flow[f].I >=≥ 0 '''then '''

09 RED-ENQUE(pkt) // pass pkt to the RED block

10 '''if''' RED drops pkt '''then'''

11 T2 ← pkt.arrivaltime

12 '''else'''

13 Flow[f].T1←pktT1 ← pkt.arrivaltime

14 drop(pkt)

15 '''return'''

*''f.T1'' is the arrival time of the last packet from flow ''f'' that is dropped by the detection and filter block.

===Pseudo codes of the Roust RED (RRED) algorithm===

*''T2'' is the arrival time of the last packet from any flow that is dropped by the [[random early detection]] (RED) block.

<nowiki>

*''Tmax = max(f.T1, T2)''.

RRED-ENQUE(pkt)

*''T*'' is a short time period, which is empirically chosen to be 10&nbsp;ms in a default RRED algorithm.<ref name="RRED"/>

==The simulation code of the Robust RED (RRED)==

01 f←RRED-FLOWHASH(pkt)

The simulation code of the RRED algorithm is published as an [[active queue management]] and [[denial-of-service attack]] (AQM&DoS) simulation platform. The [http://sites.google.com/site/cwzhangres/home/posts/aqmdossimulationplatform AQM&DoS Simulation Platform] is able to simulate a variety of DoS attacks (Distributed DoS, Spoofing DoS, Low-rate DoS, etc.) and active queue management (AQM) algorithms ([[random early detection|RED]], RRED, SFB, etc.). It automatically calculates and records the average throughput of normal TCP flows before and after DoS attacks to facilitate the analysis of the impact of DoS attacks on normal TCP flows and AQM algorithms.

==References==

{{reflist}}

==External links==

02 Tmax←MAX(Flow[f].T1, T2)

*[http://sites.google.com/site/cwzhangres/home/posts/aqmdossimulationplatform AQM&DoS Simulation Platform]

*[http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinlow-ratedosattacks Recent Publications in Low-rate Denial-of-Service (LDoS) attacks ]

*[http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinrandomearlydetectionredschemes Recent Publications in Random Early Detection (RED) schemes] {{Webarchive|url=https://web.archive.org/web/20160917055738/http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinrandomearlydetectionredschemes |date=2016-09-17 }}

*[http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinactivequeuemanagementaqmschemes Recent Publications in Active Queue Management (AQM) schemes]

{{DEFAULTSORT:Random Early Detection}}

03 if pkt.arrivaltime [Tmax, Tmax+T*] then

[[Category:Network performance]]

[[Category:Packets (information technology)]]

04 reduce local indicator by 1 for each bin corresponding to f

[[Category:Denial-of-service attacks]]

[[Category:Computer network security]]

05 else

06 increase local indicator by 1 for each bin of f

07 Flow[f].I←maximum of local indicators from bins of f

08 if Flow[f].I >=0 then

09 RED-ENQUE(pkt) //pass pkt to the RED block

10 if RED drops pkt then

11 T2←pkt.arrivaltime

12 else

13 Flow[f].T1←pkt.arrivaltime

14 drop(pkt)

15 return

</nowiki>

[http://sites.google.com/site/cwzhangres/home/files/RREDRobustREDAlgorithmtoCounterLow-rateDenial-of-ServiceAttacks.pdf?attredirects=0 More Details]

==References==

{{reflist}}