Analysis of AQM Queues with Queue Size Based Packet Dropping

  • Authors:
  • Andrzej ChydziéNaski;ŁUkasz ChróSt

  • Affiliations:
  • Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland;Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland

  • Venue:
  • International Journal of Applied Mathematics and Computer Science - Issues in Advanced Control and Diagnosis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).