Abstract
In this paper, we present the algorithms for evaluating the most effective and efficient transient solution to MX/M/1 queueing model. The analytical results are expressed in modified Bessel functions and also use generalized Q-function. Numerical illustration has been obtained and compared with other algorithms by their own programs and results.
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
References
B.W. Conolly, C. Langairs, On a new formula for the transient state probabilities for M/M/1 queues and computational implications. J. Appl. Probab. 30, 237–246 (1993)
A.M.K. Tarabia, A new formula for the transient behavior of a non-empty M/M/1/∞ queue. Appl. Math. Comput. 132(1), 1–10 (2002)
P.R. Parthasarhy, R.B. Lenin, On the numerical solution of transient probabilities of a state-dependent multi-server queue. Int. J. Comput. Math. 66(3), 241–255 (1998)
J.L. Jain, S.G. Mohanty, A.J. Meitei, Transient Solution of M/M/1 Queues: A Probabilistic Approach. APORS-2003, vol. 1 (2004), pp 74–81
J. Abate, W. Whitt, Transient behavior of M/M/1 queue via Laplace Transform. Adv. Appl. Probab. 25, 145–178 (1988)
J. Abate, W. Whitt, Calculating time dependent performance measure of the M/M/1 queue. IEEE Trans. Commun. 37, 1102–1104 (1989)
J. Abate, W. Whitt, The transient behavior of the M/M/1 queue: starting at the origin. Queueing Syst. 2, 41–65 (1987)
P.E. Cantrell, Computation of the transient M/M/1 queue cdf, pdf and mean with generalized Q-function. IEEE Trans. Commun. 34(8), 814–817 (1986)
S.K. Jones, R.K. Cavin III, D.A. Johnston, An efficient computational procedure for the evaluation of the M/M/1 transient state occupancy probabilities. IEEE Trans. Commun. 28, 2019–2020 (1986)
M. Jain, G.C. Sharma, V.K. Saraswat, Rakhee, Transient analysis of a telecommunication system using state dependent Markovian queue under Bi-level control policy. J. King Saud Univ. Eng. Sci. 20(1), 77–90 (2009)
D.J. Bertsimas, D. Nakazato, Transient and busy period analysis of the GI/G/1 queue: the method of stages. Queueing Syst. 10, 153–184 (1992)
M.C. Ausin, M.P. Wiper, R.E. Lillo, Bayesion prediction of the transient behavior and busy period in short and long-tallied GI/G/1 queeing system. Comput. Stat. Data Anal. 52, 1615–1635 (2008)
J.D. Grftihs, G.M. Leoneko, J.E. Willians, The transient solution to M/Ek/1 queue. Oper. Res. Lett. 34(3), 349–354 (2006)
M. Kijma, The transient solution to a class of Markovian queues. Comput. Math. Appl. 24(1 & 2), 17–24 (1992)
M.L. Chaudhary, Y.Q. Zhao, Transient solution of same multi-server queueing systems with finite spaces. Int. Trans. Oper. Res. 6(2), 161–182 (1999)
A.A. Hanbali, O. Boxma, Busy period analysis of the state dependent M/M/1/K queue. Oper. Res. Lett. 38(1), 1–6 (2010)
P.R. Parthasarathy, R. Sudhesh, Transient solution of multi-server Poison queue with N-policy. Int. J. Comput. Math. Appl. 55, 550–562 (2008)
O.P. Sharma, Markovian Queues (Eillis Hoewood Chichester Ltd, 1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kumar, J., Shinde, V. (2020). Computational Performance of Server Using the Mx/M/1 Queue Model. In: Deo, N., Gupta, V., Acu, A., Agrawal, P. (eds) Mathematical Analysis II: Optimisation, Differential Equations and Graph Theory. ICRAPAM 2018. Springer Proceedings in Mathematics & Statistics, vol 307. Springer, Singapore. https://doi.org/10.1007/978-981-15-1157-8_5
Download citation
DOI: https://doi.org/10.1007/978-981-15-1157-8_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1156-1
Online ISBN: 978-981-15-1157-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)