Blue (queue management algorithm): Difference between revisions

Revision as of 18:23, 18 September 2013

Revision as of 16:42, 2 February 2014

Line 1:

'''Blue''' is an [[scheduling discipline]] for the [[network scheduler]] developed 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">{{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 |yeardate=April 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>

==Functioning==

Line 9:

The main flaw of Blue, which it shares with most single-queue queueing disciplines, is that it does not distinguish between [[Traffic flow (computer networking)|traffic flows]], but treats all flows as a single aggregate. Therefore, a single aggressive flow can push packets out of the queue belonging to other, better behaved, flows.

Stochastic fair Blue (SFB) is a stochastically fair variant of Blue which hashes flows and maintains a different mark/drop probability for each hash value. Assuming no hash collisions, SFB is able to provide a fair share of buffer space for every flow. In the presence of hash collisions, SFB is only stochastically fair.<ref>{{Citation |author1=Wu-Chang Feng |author2=Dilip D. Kandlur |author3=Debanjan Saha |author4=Kang G. Shin |title=Stochastic Fair Blue: an algorithm for enforcing fairness |url=http://www.thefengs.com/wuchang/blue/41_2.PDF |journal=Proceedings of INFOCOM 2001 |yeardate=April 2001 |month=April |pages=1520–1529 |doi=10.1109/INFCOM.2001.916648 |accessdate= June 8, 2013 |volume=3}}</ref>

Unlike other stochastically fair queuing disciplines, such as SFQ ([[Stochastic Fairness Queueing]]), SFB can be implemented using a [[bloom filter]] rather than a [[hash table]], which dramatically reduces its storage requirements when the number of flows is large.