Revision as of 15:49, 5 June 2011 edit Mleoking (talk \| contribs) 140 edits →Pseudo codes of the Roust RED (RRED) algorithm ← Previous edit		Revision as of 15:50, 5 June 2011 edit undo Mleoking (talk \| contribs) 140 edits →Pseudo codes of the Roust RED (RRED) algorithm Next edit →
Line 10: ===Pseudo codes of the Roust RED (RRED) algorithm=== ~~<nowiki>~~ RRED-ENQUE(pkt) 01 f←RRED-FLOWHASH(pkt) 02 Tmax←MAX(Flow[f].T1, T2) 03 if pkt.arrivaltime [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←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]

Robust random early detection: Difference between revisions