Blue (queue management algorithm)

This is an old revision of this page, as edited by Jec (talk | contribs) at 18:18, 29 March 2008 (Write Operation of Blue). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Blue[1] is an Active Queue Management algorithm. Like Random early detection, it operates by randomly dropping or ECN marking 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.

Operation of Blue

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 d, whenever the queue is empty, p is decreased by a constant i<p.

Stochastic Fair Blue

Stochastic Fair Blue (SFB)[2]

References

  1. ^ W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue Management Algorithms. U. Michigan CSE-TR-387-99, April 1999.
  2. ^ Wu-Chang Feng, Dilip D. Kandlur, Debanjan Saha, Kang G. Shin. Stochastic Fair Blue: an algorithm for enforcing fairness. In Proc. INFOCOM'2001. 2001.
  • [1] Wu-chang Feng's page about Blue and SFB.
  • [2] An implementation of SFB for the Linux kernel.