Have a personal or library account? Click to login
Analysis of AQM queues with queue size based packet dropping Cover
Open Access
|Sep 2011

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).

DOI: https://doi.org/10.2478/v10006-011-0045-7 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 567 - 577
Published on: Sep 22, 2011
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2011 Andrzej Chydziñski, Łukasz Chróst, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 21 (2011): Issue 3 (September 2011)