Transient Solution of M/M/2/N System Subjected to Catastrophe cum Restoration

Abstract

In this paper, we study the distribution of the number of times that a finite capacity with equal servers Markovian queuing model catastrophic-cum-restorations reaches its capacity in time t. The occurrence of a catastrophe makes the system empty instantly but the system takes its own time to be ready to accept new customers. This time is referred to as “restoration time”. The aforesaid distribution is obtained as a marginal distribution of the joint distribution of the number of customers in the system at time t and the number of times system reaches its capacity in time t under the conditions of catastrophes and restorations.

Share and Cite:

Garg, D. (2015) Transient Solution of M/M/2/N System Subjected to Catastrophe cum Restoration. Open Access Library Journal, 2, 1-8. doi: 10.4236/oalib.1101404.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Chao, X. (1995) A Queuing Network Model with Catastrophes and Product form Solution. Operations Research Letters, 18, 75-79.
[2] Kumar, B.K. and Arivudainambi, D. (2000) Transient Solution of an M/M/1 Queue with Catastrophes. Computers and Math with Applica, 40, 1233-1240.
[3] Kumar, B.K. and Madheswari, S.P. (2002) Transient Behaviours of the M/M/2 Queue with Catastrophes. Statistica, Anno LXII, n1.
[4] Di Crescenzo, A., Giorno, V. and Ricciardi, L.M. (2003) On the M/M/1 Queue with Catastrophes and Its Continuous Approximation. Queueing Systems, 43, 329-347.
[5] Jain, N.K. and Kumar, R. (2007) Transient Solution of a Catastrophic-cum-Restorative Queueing Problem with Correlated Arrivals and Variable Service Capacity. Information and Management Sciences, 18, 461-465.
[6] Jain, N.K. and Garg, D. (2011) Distribution of the Number of Times M/M/2/N Queuing System Reaches Its Capacity in Time t under Catastrophic Effects. International Journal of Computational Science and Mathematics, 3, 389-400.
[7] Jain, N.K. and Garg, D. (2011) Distribution of the Number of Times M/M/2/N Queueing System with Heterogeneous Servers Reaches Its Capacity in Time t under Catastrophic Effects. International Journal of Computational and Applied Mathematics, 6, 169-192.
[8] Garg, D. (2013) Distribution of the Number of Times M/M/2/N Queuing System with Heterogeneous Servers Reaches Its Capacity in Time t Subject to Catastrophes and Restorations. International Journal of Management Research and Development, 3, 31-61.
[9] Garg, D. (2014) Approximate Analysis of an M/M/1 Markovian Queue Using Unit Step Function. Open Access Library Journal, 1, e973.
[10] Garg, D. (2014) Two Server Queueing Systems Reaches Its Capacity in Time t. International Journal of Research in Advent Technology, 2, 417-421.
http://www.ijrat.org/downloads/may-2014/paper%20id-25201453.pdf
[11] Watson, G.N. (1959) A Treatise on the Theory of Bessel Function. 2nd Edition, Cambridge University Press, Cambridge.
[12] Widder, D.V. (1946) The Laplace Transform. Princeton Mathematical Series.
[13] Erdelyi, A., Magnus, W., Oberhettinger, F. and Tricomi, F.G. (1954) Table of Integral Transform. Vol. 1, McGraw-Hill Book Company, New York.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.