Blue (queue management algorithm): Difference between revisions

Revision as of 01:45, 6 March 2009

Revision as of 04:55, 9 March 2009

Line 7:

Assuming the mix of traffic on the interface doesn't change, ''p'' will slowly converge to a value that keeps the queue within its bounds with full link utilisation.

==Stochastic Fair Blue==

when tou are having fun you can play a game

The main flaw of Blue, which it shares with most single-queue queing disciplines, is that it doesn't distinguish between flows, and treats all flows as a single aggregate. Therefore, a single aggressive flow can push out of the queue packets belonging to other, better behaved flows.

Stochastic Fair Blue (SFB)<ref>Wu-Chang Feng, Dilip D. Kandlur, Debanjan Saha, Kang G. Shin. Stochastic Fair Blue: an algorithm for enforcing fairness. In ''Proc. INFOCOM'2001''. 2001.</ref> 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.

Unlike other stochastically fair queuing disciplines, such as SFQ, 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.

When a flow's drop/mark probability reaches 1, the flow has been shown to not react to congestion indications from the network. Such an inelastic flow is put in a penalty box, and rate-limited.

==References==