Analysis of AQM queues with queue size based packet dropping

Andrzej Chydziński; Łukasz Chróst

International Journal of Applied Mathematics and Computer Science (2011)

  • Volume: 21, Issue: 3, page 567-577
  • ISSN: 1641-876X

Abstract

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

How to cite

top

Andrzej Chydziński, and Łukasz Chróst. "Analysis of AQM queues with queue size based packet dropping." International Journal of Applied Mathematics and Computer Science 21.3 (2011): 567-577. <http://eudml.org/doc/208071>.

@article{AndrzejChydziński2011,
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).},
author = {Andrzej Chydziński, Łukasz Chróst},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {single-server queue; packet dropping; queue size distribution; active queue management},
language = {eng},
number = {3},
pages = {567-577},
title = {Analysis of AQM queues with queue size based packet dropping},
url = {http://eudml.org/doc/208071},
volume = {21},
year = {2011},
}

TY - JOUR
AU - Andrzej Chydziński
AU - Łukasz Chróst
TI - Analysis of AQM queues with queue size based packet dropping
JO - International Journal of Applied Mathematics and Computer Science
PY - 2011
VL - 21
IS - 3
SP - 567
EP - 577
AB - 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).
LA - eng
KW - single-server queue; packet dropping; queue size distribution; active queue management
UR - http://eudml.org/doc/208071
ER -

References

top
  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, TelAviv, Israel, pp. 1415-1424. 
  4. Chatranon, G., Labrador, M.A. and Banerjee, S. (2004). A survey of TCP-friendly router-based AQM schemes, 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 GI X/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. Zbl0503.90031
  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. Zbl0744.60114
  21. Takagi, H. (1993). Queueing Analysis-Finite Systems, NorthHolland, Amsterdam. 

Citations in EuDML Documents

top
  1. Thomas Otieno Olwal, Karim Djouani, Okuthe P. Kogeda, Barend Jacobus van Wyk, Joint queue-perturbed and weakly coupled power control for wireless backbone networks
  2. Oleg Tikhonenko, Wojciech M. Kempa, On the queue-size distribution in the multi-server system with bounded capacity and packet dropping
  3. Chesoong Kim, Alexander Dudin, Sergey Dudin, Olga Dudina, Analysis of an MMAP/PH₁,PH₂/N/∞ queueing system operating in a random environment
  4. Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki, A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning
  5. Oleg Tikhonenko, Wojciech M. Kempa, Performance evaluation of an M/G/n -type queue with bounded capacity and packet dropping

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.