Blue (queue management algorithm): Difference between revisions

Content deleted Content added
verify the 2009 paper
indicate who researched it, since at least one seems notable
Line 1:
{{primary sources|date=June 2011}}
 
'''Blue''' is an [[active queue management]] algorithm for a [[Router (computing)|router]] or other [[computer network]] device. Like [[random early detection]] (RED), it operates by randomly dropping or marking packet with [[explicit congestion notification]] packets in a router's queue before it overflows. Unlike RED, however, it requires little or no tuning on the part of the network administrator.<ref name="mich">{{Cite journal |title=BLUE: A New Class of Active Queue Management Algorithms |author1=Wu-chang Feng |author2=Dilip D. Kandlur |author3=Debanjan Saha |author4=Kang G. Shin |year=1999 |month=April |url=http://www.eecs.umich.edu/techreports/cse/99/CSE-TR-387-99.pdf |publisher= University of Michigan |work= Computer Science Technical Report |issue=CSE–TR–387–99 |accessdate= June 8, 2013 }}</ref>
 
==Operation==
The work was done by graduate student Wu-chang Feng for Professor [[Kang G. Shin]] at the [[University of Michigan]] and others at the [[Thomas J. Watson Research Center]] of [[IBM]] in 1999.<ref name="mich" />
 
A Blue queue maintains a drop/mark probability ''p'', and drops/marks packets with probability ''p'' as they enter the queue. Whenever the queue overflows, ''p'' is increased by a small constant ''p<sub>d</sub>'', and whenever the queue is empty, ''p'' is decreased by a constant ''p<sub>i</sub><p<sub>d</sub>''.
 
AssumingIf the mix of traffic on the interface doesn'tdoes not change, ''p'' will slowly converge to a value that keeps the queue within its bounds with full link utilisation.
 
===Stochastic fair Blue===
Line 21:
===Resilient stochastic fair Blue===
 
Active queue management (AQM) algorithms, including the fairness-aimed ones, are notably vulnerable to spoofing [[distributed denial-of-service]] (DDoS) attacks. A resilient stochastic fair Blue (RSFB) algorithm was proposed in 2009 against spoofing DDoS attacks. The basic idea behind RSFB is to record the responsive normal TCP flows and rescue their dropped packets. RSFB algorithm is effective in preserving the TCP throughput in the presence of spoofing DDoS attacks.<ref name=RSFB>{{Cite journal |author= Changwang Zhang, Jianping Yin, and Zhiping Cai |url= http://sites.google.com/site/cwzhangres/home/files/RSFBaResilientStochasticFairBluealgorithmagainstspoofingDDoSattacks.pdf |title= RSFB: a Resilient Stochastic Fair Blue algorithm against spoofing DDoS attacks |work= International Symposium on Communication and Information Technology (ISCIT) |year= 2009 |pages= 1566-1567 |isbn= 978-1-4244-4521-9 |accessdate= June 8, 2013 }} [http://portal.acm.org/citation.cfm?id=1789954.1790341 Abstract]</ref>
 
===Implementations===
 
An implementation of Blue is part of [[ALTQ]], the alternative AQM framework for BSD Unix.<ref>[{{Cite web |title= Blue |work= Web page |author= Wu-chang Feng |url= http://www.thefengs.com/wuchang/blue/ BLUE]|accessdate= June 8, 2013 }}</ref>
 
An implementation of SFB for Linux<ref>Juliusz Chroboczek. [http://www.pps.univ-paris-diderot.fr/~jch/software/sfb/ An implementation of SFB for the [Linux kernel]</ref> has] beenwas included in the Linux kernel since version 2.6.39.<ref>[http://kernelnewbies.org/Linux_2_6_39#head-87ffd4407af29460251c521e0228fe0ac9219d4b Kernel Newbies - Linux 2.6.39 - Networking]</ref><ref>{{Cite web |title= Stochastic Fair Blue for the Linux kernel |author= Juliusz Chroboczek |url= http://www.pps.univ-paris-diderot.fr/~jch/software/sfb/ |accessdate= June 8, 2013 }}</ref>
 
==References==