The BLUE active queue management algorithms

• Published in: IEEE/ACM transactions on networking Vol. 10; no. 4; pp. 513 - 528
• Main Authors: Wu-chang Feng, Shin, K.G., Kandlur, D.D., Saha, D.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2002; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Bandwidth; Computer science; Filters; Internet; IP networks; Loss measurement; Size control; Stochastic processes; Studies; Telecommunication traffic; Traffic control
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2002.801399

In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management techniques such as RED (random early detection) (see Floyd, S. and Jacobson, V., IEEE/ACM Trans. Networking, vol.1, p.397-413, 1993). While active queue management can potentially reduce packet loss rates in the Internet, we show that current techniques are ineffective in preventing high loss rates. The inherent problem with these algorithms is that they use queue lengths as the indicator of the severity of congestion. In light of this observation, a fundamentally different active queue management algorithm, called BLUE, is proposed, implemented and evaluated. BLUE uses packet loss and link idle events to manage congestion. Using both simulation and controlled experiments, BLUE is shown to perform significantly better than RED, both in terms of packet loss rates and buffer size requirements in the network. As an extension to BLUE, a novel technique based on Bloom filters (see Bloom, B., Commun. ACM, vol.13, no.7, p.422-6, 1970) is described for enforcing fairness among a large number of flows. In particular, we propose and evaluate stochastic fair BLUE (SFB), a queue management algorithm which can identify and rate-limit nonresponsive flows using a very small amount of state information.