On the stability of AQM algorithms

  • Authors:
  • Pawel Mrozowski;Andrzej Chydzinski

  • Affiliations:
  • Silesian University of Technology, Institute of Computer Sciences, Gliwice, Poland;Silesian University of Technology, Institute of Computer Sciences, Gliwice, Poland

  • Venue:
  • MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stable and predictable queue size is one of the main goals of the active queue management in Internet routers. A stable queue enables to maintain high throughput and low delay jitter and therefore has a positive impact on several Internet applications. It is not easy to design an AQM algorithm that would be able to maintain a stable queue size in every network conditions. For instance, it is known that large propagation delays have a negative impact on the queue size stability. In this paper, we demonstrate other factors that are likely to make the queue size unstable. Using the newest AQM testbed we show that, in addition to large delays, a low congestion level and low target queue size make stabilizing the queue size difficult and even the best known algorithms do not work well under these conditions.