Geodesic
On main characteristics of the $M/M/1/N$ queue with single and batch arrivals and the queue size controlled by AQM algorithms
Kybernetika, Tome 47 (2011) no. 6, pp. 930-943 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

In the article finite-buffer queueing systems of the $M/M/1/N$ type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time between two successive accepted packets (batches of packets). For these characteristics the formulae which can be easily numerically treated are derived. Numerical results obtained for three sample dropping functions are attached as well.
In the article finite-buffer queueing systems of the $M/M/1/N$ type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time between two successive accepted packets (batches of packets). For these characteristics the formulae which can be easily numerically treated are derived. Numerical results obtained for three sample dropping functions are attached as well.
Classification : 60K25, 90B22
Keywords: active queue management (AQM); drop function; finite buffer; queue size 
@article{KYB_2011_47_6_a9,
     author = {Kempa, Wojciech M.},
     title = {On main characteristics of the $M/M/1/N$ queue with single and batch arrivals and the queue size controlled by {AQM} algorithms},
     journal = {Kybernetika},
     pages = {930--943},
     year = {2011},
     volume = {47},
     number = {6},
     mrnumber = {2907852},
     zbl = {1241.90035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2011_47_6_a9/}
}
TY  - JOUR
AU  - Kempa, Wojciech M.
TI  - On main characteristics of the $M/M/1/N$ queue with single and batch arrivals and the queue size controlled by AQM algorithms
JO  - Kybernetika
PY  - 2011
SP  - 930
EP  - 943
VL  - 47
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_2011_47_6_a9/
LA  - en
ID  - KYB_2011_47_6_a9
ER  - 
%0 Journal Article
%A Kempa, Wojciech M.
%T On main characteristics of the $M/M/1/N$ queue with single and batch arrivals and the queue size controlled by AQM algorithms
%J Kybernetika
%D 2011
%P 930-943
%V 47
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_2011_47_6_a9/
%G en
%F KYB_2011_47_6_a9
Kempa, Wojciech 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, Tome 47 (2011) no. 6, pp. 930-943. http://geodesic.mathdoc.fr/item/KYB_2011_47_6_a9/

[1] Athuraliya, S., Low, S. H., Li, V. H., Qinghe, Y.: REM: active queue management. IEEE Network 15 (2001), 3, 48–53. | DOI

[2] 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.

[3] Chrost, L., Brachman, A., Chydzinski, A.: On the performance of AQM algoritms with small buffers. Comput. Network CCIS 39 (2009), 168–173. | DOI

[4] Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE ACM T. Network 1 (1993), 4, 397–412. | DOI

[5] Floyd, S.: Recommendations on using the gentle variant of RED. http://www.aciri.org/floyd/red/gentle.html, March 2000.

[6] Frey, A., Takahashi, Y.: An $M^{X}/GI/1/N$ queue with close-down and vacation times. J. Appl. Math. Stoch. Anal. 12 (1999), 1, 63–83. | DOI | MR

[7] Hao, W., Wei, Y.: An extended $GI^{X}/M/1/N$ queueing model for evaluating the performance of AQM algorithms with aggregate traffic. Lect. Notes Comput. Sci. 3619 (2005), 395–404. | DOI

[8] Rosolen, V., Bonaventure, O., Leduc, G.: A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic. Comput. Comm. R. 29 (1999), 3, 23–43. | DOI

[9] Sun, L., Wang, L.: A novel RED scheme with preferential dynamic threshold deployment. In: Computational Intelligence and Security Workshops 2007, pp. 854–857.

[10] 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.

[11] Takagi, H.: Queueing analysis, Volume 1: Vacation and priority systems, Part 1. North–Holland, Amsterdam – London – New York – Tokyo 1983. | MR

[12] 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.

[13] Zhou, K., Yeung, K. L., Li, V. O. K.: Nonlinear RED: A simple yet efficient active queue management scheme. Comput. Network 50 (2006), 18, 3784–3794. | DOI | Zbl