Abstract
This paper aims at transient busy period analysis of M/G/l queueing systems starting initially with i customers through lattice path approach. The service time distribution is approximated by a 2-phase Cox distribution, C 2. Distributions having rational Laplace-Stieltjes transforms and square coefficient of variation lying in \(\left. {\frac{1}{2},\infty } \right)\) form a very wide class of distributions. As any distribution of this class can be approximated by a C 2, that has Markovian property, amenable to the application of lattice paths combinatorial analysis, the use of C 2 therefore has led us to achieve transient results applicable to almost any real life queueing system M/G/l.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benes, V. E. (1963). General Stochastic Processes in the Theory of Queues, Reading, MA: Addison-Wesley.
Böhm, W. M. (1993). Markovian Queueing Systems in Discrete Time, Frankfurt am Main: Antonhain.
Böhm, W. M. and Mohanty, S. G. (1994a). On discrete time Markovian N-policy queue involving batches, Sankhyā, Series A, 56, 1–20.
Böhm, W. M. and Mohanty, S. G. (1994b). Transient analysis of queues with heterogeneous arrivals, Queueing Systems, 18, 27–45.
Botta, R. F., Harris, C. M. and Marchai, W. G. (1987). Characterization of generalized hyperexponential distribution functions, Communications in Statistics—Stochastic Models, 3, 115–148.
Cox, D. R. (1955). A use of complex probabilities in the theory of stochastic processes, Proceedings of the Cambridge Philosophical Society, 51, 313–319.
Dalen, G. and Natvig, B. (1980). On the transient waiting times for a GI/M/1 priority queue, Journal of Applied Probability, 17, 227–234.
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Volume 1, Third edition, New York: John Wiley & Sons.
Khoshgoftaar, T. M. and Perros, H. G. (1987). A comparison of three methods of estimation for approximating general distributions by a Coxian distribution, In Modelling Techniques and Performance (Eds., S. Fdida and G. Fujolle), Amsterdam: North-Holland.
Logothetis, D., Mainkar, V. and Trivedi, K. (1996). Transient analysis of non-Markovian queues via Markov regenerative processes, In Probability Models and Statistics—J. Medhi Festschrift, 109–131, New Delhi: New Age International Publishers.
Lucantoni, D. M., Choudhury, G. L. and Whitt, W. (1994). The transient BMAP/G/1 queue, Communications in Statistics—Stochastic Models, 10, 145–182.
Marie, R. (1978). Methods iteratives de resolution de models mathematiques de systemes informatiques, R.A.I.R.O. Informatique/Computer Sciences, 12, 107–122.
Marie, R. (1980). Calculating equilibrium probabilities for λ(n)/C k /1/N queues, ACM SIGMETRICS, Conference on Measurement and Modelling of Computer Systems, 117–125.
Meisling, T. (1958). Discrete time queueing theory, Journal Operations Research Society of America, 6, 96–105.
Narayana, T. V. (1959). A partial order and its applications to probability theory, Sankhyā, 21, 91–98.
Neuts, M. F. (1989). Structured Stochastic Matrices of M/G/l Type and Their Applications, New York: McGraw-Hill.
Saaty, T. L. (1961). Elements of Queueing Theory with Applications, New York: McGraw-Hill.
Sen, K. and Agarwal, M. (1996a). Lattice path approach to transient busy period analysis of GI/M/1 queues using Cox distribution, (under preparation).
Sen, K. and Agarwal, M. (1996b). Transient solutions of M/C k /l queues, (under preparation).
Sen, K. and Gupta, R. (1994). Transient analysis of threshold T-policy M/M/l queues with server control, Sankhyā, Series B, 56, 39–51.
Sen, K. and Gupta, R. (1997). Transient solution of Mb/M/1 system under threshold control policies, Journal of Statistical Research (to appear).
Sen, K. and Gupta, R. (1997). Discrete time Markovian batch arrival queues with restricted vacations and non-exhaustive service, Sankhyā, Series B (submitted for publication).
Sen, K. and Jain, J. L. (1993). Combinatorial approach to Markovian queueing models, Journal of Statistical Planning and Inference, 34, 269–279.
Sen, K., Jain, J. L. and Gupta, J. M. (1993). Lattice path approach to transient solution of M/M/l with control policy, Journal of Statistical Planning and Inference, 34, 259–267.
Takács, L. (1962). Introduction to Theory of Queues, New York: Oxford University Press.
Takagi, H. (1991). Queueing Analysis, 1: Vacation and Priority System Amsterdam: North-Holland.
Takagi, H. (1993a). Queueing Analysis, 2: Finite Systems, Amsterdam: North-Holland.
Takagi, H. (1993b). Queueing Analysis, 3: Discrete Time Systems, Amsterdam: North-Holland.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Birkhäuser Boston
About this chapter
Cite this chapter
Sen, K., Agarwal, M. (1997). Transient Busy Period Analysis of Initially Non-Empty M/G/l Queues—Lattice Path Approach. In: Balakrishnan, N. (eds) Advances in Combinatorial Methods and Applications to Probability and Statistics. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4140-9_18
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4140-9_18
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-8671-4
Online ISBN: 978-1-4612-4140-9
eBook Packages: Springer Book Archive