On the queue-size distribution in the multi-server system with bounded capacity and packet dropping

Oleg Tikhonenko; Wojciech M. Kempa

Kybernetika (2013)

  • Volume: 49, Issue: 6, page 855-867
  • ISSN: 0023-5954

Abstract

top
A multi-server M / M / n -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.

How to cite

top

Tikhonenko, Oleg, and Kempa, Wojciech M.. "On the queue-size distribution in the multi-server system with bounded capacity and packet dropping." Kybernetika 49.6 (2013): 855-867. <http://eudml.org/doc/260837>.

@article{Tikhonenko2013,
abstract = {A multi-server $M/M/n$-type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.},
author = {Tikhonenko, Oleg, Kempa, Wojciech M.},
journal = {Kybernetika},
keywords = {AQM algorithms; loss probability; multi-server queueing system; queue-size distribution; AQM algorithms; loss probability; multi-server queueing system; queue-size distribution},
language = {eng},
number = {6},
pages = {855-867},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On the queue-size distribution in the multi-server system with bounded capacity and packet dropping},
url = {http://eudml.org/doc/260837},
volume = {49},
year = {2013},
}

TY - JOUR
AU - Tikhonenko, Oleg
AU - Kempa, Wojciech M.
TI - On the queue-size distribution in the multi-server system with bounded capacity and packet dropping
JO - Kybernetika
PY - 2013
PB - Institute of Information Theory and Automation AS CR
VL - 49
IS - 6
SP - 855
EP - 867
AB - A multi-server $M/M/n$-type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.
LA - eng
KW - AQM algorithms; loss probability; multi-server queueing system; queue-size distribution; AQM algorithms; loss probability; multi-server queueing system; queue-size distribution
UR - http://eudml.org/doc/260837
ER -

References

top
  1. Athuraliya, S., Low, S. H., Li, V. H., Qinghe, Y., 10.1109/65.923940, IEEE Network 15 (2001), 3, 48-53. DOI10.1109/65.923940
  2. Aweya, J., Ouellette, M., Montuno, D. Y., Chapman, A., A control theoretic approach to Active Queue Management. 
  3. Bocharov, P. P., D'Apice, C., Pechinkin, A. V., Salerno, S., Queueing Theory., VSP, Utrecht-Boston, 2004. Zbl1061.60093MR2125874
  4. Bonald, T., May, M., Bolot, J. Ch., Analytic evaluation of RED performance., In: Proc. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies 3 (2000), pp. 1415-1424. 
  5. Chrost, L., Brachman, A., Chydzinski, A., 10.1007/978-3-642-02671-3_20, Comput. Network CCIS 39 (2009), 168-173. DOI10.1007/978-3-642-02671-3_20
  6. Chydzinski, A., Towards a stable AQM via dropping function shaping., In: Proc. Ninth International Conference on Networks (ICN) (2010), pp. 93-97. 
  7. Chydzinski, A., Chrost, L., 10.2478/v10006-011-0045-7, Int. J. Appl. Math. Comput. Sci. 21 (2011), 3, 567-577. Zbl1237.60069MR2883897DOI10.2478/v10006-011-0045-7
  8. Chydzinski, A., Optimization problems in the theory of queues with dropping functions., HET-NETs (2011), 121-132. 
  9. Feller, W., Introduction to Probability Theory and Its Applications., Wiley, 1971. Zbl0598.60003MR0270403
  10. Floyd, S., Jacobson, V., 10.1109/90.251892, IEEE ACM T. Network 1 (1993), 4, 397-412. DOI10.1109/90.251892
  11. Floyd, S., Recommendations on using the gentle variant of RED., http://www.aciri.org/floyd/red/gentle.html, March 2000. 
  12. Floyd, S., Adaptive RED: an algorithm for increasing the robustness of RED's Active Queue Management., http://www.aciri.org/floyd/papers/adaptiveRed.pdf 
  13. Hao, W., Wei, Y., 10.1007/11534310_43, Lect. Notes Comput. Sci. 3619 (2005), 395-404. DOI10.1007/11534310_43
  14. Kempa, W. M., On main characteristics of the M / M / 1 / N queue with single and batch arrivals and the queue size controlled by AQM algorithms., Kybernetika 47 (2011), 6, 930-943. Zbl1241.90035MR2907852
  15. Kempa, W. M., 10.12785/amis/070308, Appl. Math. Inform. Sci. 7 (2013), 3, 909-915. MR3028710DOI10.12785/amis/070308
  16. Liu, S., Basar, T., Srikant, R., 10.1109/TNET.2005.857110, IEEE/ACM Trans. Newtorking 13 (2005), 5, 1068-1081. DOI10.1109/TNET.2005.857110
  17. Rosolen, V., Bonaventure, O., Leduc, G., 10.1145/505724.505728, Comput. Commun. Rew. 29 (1999), 3, 23-43. DOI10.1145/505724.505728
  18. Sun, L., Wang, L., A novel RED scheme with preferential dynamic threshold deployment., In: Computational Intelligence and Security Workshops 2007, pp. 854-857. 
  19. Suresh, S., Gol, O., Congestion management of self similar IP traffic - application of the RED scheme., In: Wireless and Optical Communications Networks, Second IFIP International Conference 2005, pp. 372-376. 
  20. Tikhonenko, O., Queueing systems of a random length demands with restrictions., Automat. Remote Control 52 (1991), 10, 1431-1437. MR1152868
  21. Tikhonenko, O., 10.1007/s11122-005-0029-z, Probl. Inform. Transmission 41 (2005), 3, 243-253. Zbl1098.90025MR2163852DOI10.1007/s11122-005-0029-z
  22. Tikhonenko, O., Kempa, W. M., 10.1007/978-3-642-31500-8_25, Lect. Notes Comput. Sci. 7204 (2012), 242-251. DOI10.1007/978-3-642-31500-8_25
  23. Xiong, N., Yang, Y., Defago, X., He, Y., LRC-RED: A self-tuning robust and adaptive AQM scheme., In: Sixth International Conference on Parallel and Distributed Computing Applications and Technologies 2005, pp. 655-659. 
  24. Zhou, K., Yeung, K. L., Li, V. O. K., 10.1016/j.comnet.2006.04.007, Comput. Networks 50 (2006), 18, 3784-3794. Zbl1103.68364DOI10.1016/j.comnet.2006.04.007

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.