Robust random early detection: Difference between revisions

Revision as of 04:50, 11 June 2013

Revision as of 05:19, 30 August 2013

Line 8:

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 Algorithm of the Robust RED (RRED)==

<nowiki>

RRED-ENQUE(pkt)

Line 30:

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

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

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

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