Blue (queue management algorithm)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.[1]


Like random early detection (RED), it operates by randomly dropping or marking packet with explicit congestion notification mark before the transmit buffer of the network interface controller overflows. Unlike RED, however, it requires little or no tuning to be performed by the network administrator. 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 pi, and whenever the queue is empty, p is decreased by a constant pd < pi.

If the mix of traffic on the interface does not change, p will slowly converge to a value that keeps the queue within its bounds with full link utilization.

Stochastic fair Blue[edit]

The main flaw of Blue, which it shares with most single-queue queuing disciplines, is that it does not distinguish between 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.[2]

Unlike other stochastically fair queuing disciplines, such as SFQ (Stochastic Fairness Queuing), 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.

Resilient stochastic fair Blue[edit]

Many scheduling 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.[3]


An implementation of Blue is part of ALTQ, the network scheduler for BSD Unix.[4]

An implementation of SFB for Linux was included in the Linux kernel in version 2.6.39.[5][6][7]


  1. ^ Wu-chang Feng; Dilip D. Kandlur; Debanjan Saha; Kang G. Shin (April 1999). "BLUE: A New Class of Active Queue Management Algorithms" (PDF). Computer Science Technical Report (University of Michigan) (CSE–TR–387–99). Retrieved June 8, 2013. 
  2. ^ Wu-Chang Feng; Dilip D. Kandlur; Debanjan Saha; Kang G. Shin (April 2001), "Stochastic Fair Blue: an algorithm for enforcing fairness" (PDF), Proceedings of INFOCOM 2001 3: 1520–1529, doi:10.1109/INFCOM.2001.916648, retrieved June 8, 2013 
  3. ^ Changwang Zhang; Jianping Yin & Zhiping Cai (2009). "RSFB: a Resilient Stochastic Fair Blue algorithm against spoofing DDoS attacks" (PDF). International Symposium on Communication and Information Technology (ISCIT): 1566–1567. ISBN 978-1-4244-4521-9. Retrieved June 8, 2013.  Abstract
  4. ^ Wu-chang Feng. "Blue". Web page. Retrieved June 8, 2013. 
  5. ^ Kernel Newbies - Linux 2.6.39 - Networking
  6. ^ "SFB Linux kernel network scheduler module". Retrieved 2013-09-07. 
  7. ^ Juliusz Chroboczek. "Stochastic Fair Blue for the Linux kernel". Retrieved June 8, 2013.