On main characteristics of the queue with single and batch arrivals and the queue size controlled by AQM algorithms
Kybernetika (2011)
- Volume: 47, Issue: 6, page 930-943
- ISSN: 0023-5954
Access Full Article
top
Abstract
topHow to cite
topKempa, 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 47.6 (2011): 930-943. <http://eudml.org/doc/196607>.
@article{Kempa2011,
abstract = {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.},
author = {Kempa, Wojciech M.},
journal = {Kybernetika},
keywords = {active queue management (AQM); drop function; finite buffer; queue size; drop function; finite buffer; queue size; active queue management (AQM)},
language = {eng},
number = {6},
pages = {930-943},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On main characteristics of the $M/M/1/N$ queue with single and batch arrivals and the queue size controlled by AQM algorithms},
url = {http://eudml.org/doc/196607},
volume = {47},
year = {2011},
}
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
PB - Institute of Information Theory and Automation AS CR
VL - 47
IS - 6
SP - 930
EP - 943
AB - 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.
LA - eng
KW - active queue management (AQM); drop function; finite buffer; queue size; drop function; finite buffer; queue size; active queue management (AQM)
UR - http://eudml.org/doc/196607
ER -
References
top- Athuraliya, S., Low, S. H., Li, V. H., Qinghe, Y., 10.1109/65.923940, IEEE Network 15 (2001), 3, 48–53. (2001) DOI10.1109/65.923940
- 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. (2000)
- Chrost, L., Brachman, A., Chydzinski, A., 10.1007/978-3-642-02671-3_20, Comput. Network CCIS 39 (2009), 168–173. (2009) DOI10.1007/978-3-642-02671-3_20
- Floyd, S., Jacobson, V., 10.1109/90.251892, IEEE ACM T. Network 1 (1993), 4, 397–412. (1993) DOI10.1109/90.251892
- Floyd, S., Recommendations on using the gentle variant of RED, http://www.aciri.org/floyd/red/gentle.html, March 2000. (2000)
- Frey, A., Takahashi, Y., 10.1155/S1048953399000064, J. Appl. Math. Stoch. Anal. 12 (1999), 1, 63–83. (1999) MR1690183DOI10.1155/S1048953399000064
- Hao, W., Wei, Y., 10.1007/11534310_43, Lect. Notes Comput. Sci. 3619 (2005), 395–404. (2005) DOI10.1007/11534310_43
- Rosolen, V., Bonaventure, O., Leduc, G., 10.1145/505724.505728, Comput. Comm. R. 29 (1999), 3, 23–43. (1999) DOI10.1145/505724.505728
- Sun, L., Wang, L., A novel RED scheme with preferential dynamic threshold deployment, In: Computational Intelligence and Security Workshops 2007, pp. 854–857. (2007)
- 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. (2005)
- Takagi, H., Queueing analysis, Volume 1: Vacation and priority systems, Part 1, North–Holland, Amsterdam – London – New York – Tokyo 1983. (1983) MR1149382
- 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. (2005)
- Zhou, K., Yeung, K. L., Li, V. O. K., 10.1016/j.comnet.2006.04.007, Comput. Network 50 (2006), 18, 3784–3794. (2006) Zbl1103.68364DOI10.1016/j.comnet.2006.04.007
Citations in EuDML Documents
top- Wojciech M. Kempa, On transient queue-size distribution in the batch-arrivals system with a single vacation policy
- Oleg Tikhonenko, Wojciech M. Kempa, On the queue-size distribution in the multi-server system with bounded capacity and packet dropping
- Oleg Tikhonenko, Wojciech M. Kempa, Performance evaluation of an M/G/n -type queue with bounded capacity and packet dropping
NotesEmbed ?
topYou 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.