Abstract
A queueing system of the M/M/1/( ∞ ,V) type with generally distributed packet volumes and bounded capacity (total packets volume) is considered. The queue length is controlled by means of the accepting function that enqueues the arriving packet with probability depending on the free capacity volume in the system at the pre-arrival epoch. Explicit representations for stationary probabilities are derived via solving the system of differential equations. Sample numerical results are attached in which stationary queue-size distributions with and without dropping packets are compared.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abate, J., Choudhury, G.L., Whitt, W.: An introduction to numerical transform inversion and its application to probability models. In: Grassmann, W. (ed.) Computational Probability, pp. 257–323. Kluwer, Boston (2000)
Athuraliya, S., Li, V.H., Low, S.H., Yin, Q.: REM: Active Queue Management. IEEE Network 15(3), 48–53 (2001)
Aweya, J., Ouellette, M., Montuno, D.Y., Chapman, A.: A Control theoretic approach to Active Queue Management. Comput. Netw. 36 (2001)
Bonald, T., May, M., Bolot, J.-C.: Analytic evaluation of RED performance. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1415–1424 (2000)
Chydzinski, A.: Queueing characteristics for Markovian traffic models in packet-oriented networks. Silesian University of Technology Press, Gliwice (2007) (in Polish)
Cohen, J.W.: The single server queue. North-Holand Publishing Company, Amsterdam (1982)
Feng, W., Kandlur, D., Saha, D., Shin, K.: Blue: A new class of Active Queue Management algorithms. U. Michigan CSE-TR-387-99 (1999)
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions of Networking 1(4), 397–412 (1993)
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 (to appear)
Liu, S., Basar, T., Srikant, R.: Exponential RED: A stabilizing AQM scheme for low- and ligh-speed TCP protocols. IEEE/ACM ToN (2005)
Tikhonenko, O.M.: Generalized Erlang Problem for Service Systems with Finite Total Capacity. Problems of Information Transmission 41(3), 243–253 (2005)
Tikhonenko, O.M.: Queueing systems of a random length demands with restrictions. Automation and Remote Control 52(10, pt. 2), 1431–1437 (1991)
Tikhonenko, O.: Probability Analysis of Information Systems. EXIT, Warsaw (2006) (in Polish)
Zhou, K., Yeung, K.L., Li, V.O.K.: Nonlinear RED: A simple yet efficient active queue management scheme. Comput. Netw. 50(18), 3784–3794 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tikhonenko, O., Kempa, W.M. (2012). The Generalization of AQM Algorithms for Queueing Systems with Bounded Capacity. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31500-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-31500-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31499-5
Online ISBN: 978-3-642-31500-8
eBook Packages: Computer ScienceComputer Science (R0)