Geodesic
Analysis of AQM queues with queue size based packet dropping
International Journal of Applied Mathematics and Computer Science, Tome 21 (2011) no. 3, pp. 567-577.

Voir la notice de l'article provenant de la source Library of Science

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).
Keywords: single-server queue, packet dropping, queue size distribution, active queue management
Mots-clés : system kolejkowy, porzucanie pakietu, wielkość rozproszenia, aktywne zarządzanie kolejką 
@article{IJAMCS_2011_21_3_a14,
     author = {Chydzi\'nski, A. and Chr\'ost, {\L}.},
     title = {Analysis of {AQM} queues with queue size based packet dropping},
     journal = {International Journal of Applied Mathematics and Computer Science},
     pages = {567--577},
     publisher = {mathdoc},
     volume = {21},
     number = {3},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IJAMCS_2011_21_3_a14/}
}
TY  - JOUR
AU  - Chydziński, A.
AU  - Chróst, Ł.
TI  - Analysis of AQM queues with queue size based packet dropping
JO  - International Journal of Applied Mathematics and Computer Science
PY  - 2011
SP  - 567
EP  - 577
VL  - 21
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IJAMCS_2011_21_3_a14/
LA  - en
ID  - IJAMCS_2011_21_3_a14
ER  - 
%0 Journal Article
%A Chydziński, A.
%A Chróst, Ł.
%T Analysis of AQM queues with queue size based packet dropping
%J International Journal of Applied Mathematics and Computer Science
%D 2011
%P 567-577
%V 21
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IJAMCS_2011_21_3_a14/
%G en
%F IJAMCS_2011_21_3_a14
Chydziński, A.; Chróst, Ł. Analysis of AQM queues with queue size based packet dropping. International Journal of Applied Mathematics and Computer Science, Tome 21 (2011) no. 3, pp. 567-577. http://geodesic.mathdoc.fr/item/IJAMCS_2011_21_3_a14/

[1] Athuraliya, S., Low, S. H., Li, V. H. and Yin, Q. (2001). REM: Active queue management, IEEE Network 15(3): 48-53.

[2] Bohacek, S., Shah, K., Arce, G. R. and Davis, M. (2004). Signal processing challenges in active queue management, IEEE Signal Processing Magazine 21(5): 69-79.

[3] Bonald, T., May, M. and Bolot, J. C. (2000). Analytic evaluation of RED performance, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Tel-Aviv, Israel, pp. 1415-1424.

[4] Chatranon, G., Labrador, M. A. and Banerjee, S. (2004). A survey of TCP-friendly router-based AQMschemes, Computer Communications 27(15): 1424-1440.

[5] Fatta, G. D., Hoffmann, F., Re, G. L. and Urso, A. (2003). A genetic algorithm for the design of a fuzzy controller for active queue management, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 33(3): 313-324.

[6] Feng, W., Shin, K. G., Kandlur, D. D. and Saha, D. (2002). The BLUE active queue management algorithms, IEEE/ACM Transactions on Networking 10(4): 513-528.

[7] Floyd, S., Gummadi, R. and Shenker, S. (2001). Adaptive RED: An algorithm for increasing the robustness of REDs active queue management, Technical Report, ACIRI, http://icir.org/floyd/papers/adaptiveRed.pdf.

[8] Floyd, S. and Jacobson, V. (1993). Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking 1(4): 397-413.

[9] Hao, W. and Wei, Y. (2005). An extended GIX/M/1/N queueing model for evaluating the performance of AQM algorithms with aggregate traffic, in X. Lu and W. Zhao (Eds.), Networking and Mobile Computing, Lecture Notes in Computer Science, Vol. 3619, Springer, Berlin/Heidelberg, pp. 395-404.

[10] Heyman, D. P. and Sobel, M. J. (1982). Stochastic Models of Operations Research, Volume 1: Stochastic Processes and Operating Characteristics, McGraw-Hill, New York, NY.

[11] Hollot, C. V., Misra, V., Towsley, D. and Gong, W. (2002). Analysis and design of controllers for AQM routers supporting TCP flows, IEEE Transactions on Automatic Control 47(6): 945 -959.

[12] Kunniyur, S. S. and Srikant, R. (2004). An adaptive virtual queue (AVQ) algorithm for active queue management, IEEE/ACM Transactions on Networking 12(2): 286 - 299.

[13] Lakshmikantha, A., Beck, C. L. and Srikant, R. (2005). Robustness of real and virtual queue-based active queue management schemes, IEEE/ACM Transactions on Networking 13(1): 81-93.

[14] Mathematica (2011). http://www.wolfram.com/.

[15] Network Simulator ns-2 (2011). http://www.isi.edu/nsnam/ns/.

[16] Omnet (2011). http://www.omnetpp.org/.

[17] Opnet (2011). http://www.opnet.com/.

[18] Rosolen, V., Bonaventure, O. and Leduc, G. (1999). A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic, ACM SIGCOMM Computer Communication Review 29(3): 23-43.

[19] Sun, J. and Zukerman, M. (2007). An adaptive neuron AQM for a stable internet, in I. Akyildiz, R. Sivakumar, E. Ekici, J. Oliveira and J. McNair (Eds.), NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, Lecture Notes in Computer Science, Vol. 4479, Springer, Berlin/Heidelberg, pp. 844-854.

[20] Takagi, H. (1991). Queueing Analysis-Vacation and Priority Systems, North-Holland, Amsterdam.

[21] Takagi, H. (1993). Queueing Analysis-Finite Systems, North-Holland, Amsterdam.