BLUE: A New Class of Active Queue Management Algorithms

Abstract

In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF is considering the deployment of active queue management techniques such as RED [13]. While active queue management can potentially reduce packet loss rates in the Internet, this paper shows that current techniques are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all 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. BLUE uses packet loss and link idle events to manage congestion. Using 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 for enforcing fairness among a large number of flows is described. In particular, this paper proposes and evaluates Stochastic Fair BLUE (SFB), a queue management algorithm which can identify and rate-limit non-responsive flows using a very small amount of state information.

25 Figures and Tables

Statistics

0204060'00'02'04'06'08'10'12'14'16
Citations per Year

357 Citations

Semantic Scholar estimates that this publication has 357 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Feng1999BLUEAN, title={BLUE: A New Class of Active Queue Management Algorithms}, author={Wu-chang Feng and Dilip D. Kandlur and Debanjan Saha and Kang G. Shin}, year={1999} }