Journal of Statistical Theory and Practice

, Volume 1, Issue 2, pp 167–198 | Cite as

Lattice Path Approach for Busy Period Density of GIb/G/1 Queues Using C2 Coxian Distributions

  • Manju AgarwalEmail author
  • Kanwar Sen
  • Bidisha Borkakaty


In this paper busy period analysis of non-Markovian queuing system GIb/G/1, starting initially with i0 batches of customers, is carried out via lattice path approach. Both interarrival and service time distributions are approximated by 2-phase Cox distributions, C2, that have Markovian property, amenable to the application of lattice paths combinatorial analysis. Arrivals occur in batches of size b. Distributions having rational Laplace-Stieltjes transform and square coefficient of variation lying in [1/2, ∞] form a very wide class of distributions. As any distribution of this class can be approximated by a C2, the use of C2, therefore, has led us to achieve results applicable to almost any real life queuing system GIb/G/1 occurring in computer systems, communication systems, manufacturing systems, etc. Numerical computations have been performed for different sets of values of the parameters involved using software Mathematica and presented graphically.

AMS Subject Classification



Lattice Path Approach Busy Period Analysis Batch Arrivals 2-phase Cox Distribution C2, GIb/G/1 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Agarwal, M., 2002. Distribution of number served during a busy period of GI/M/1/N queues—Lattice path approach. Journal of Statistical Planning and Inference, 101(1–2), 7–21.MathSciNetCrossRefGoogle Scholar
  2. Agarwal, M., Sen, K., Borkakaty, B., 2006a. Lattice path approach for busy period density of M/C3/1 queues using lattice path approach. Full paper available online from 25 October 2006 in Applied Mathematical Modelling.Google Scholar
  3. Agarwal, M., Sen, K., Borkakaty, B., 2006b. Busy period density of queueing system C3/M/1. Journal of Combinatorics, Information & System Sciences, 31(1–4), 199–233.zbMATHGoogle Scholar
  4. Böhem, W.M., Mohanty, S.G., 1994. Transient analysis of M/M/1 queues in discrete time with general server vacations. Applied Probability Trust, 31, 115–129.MathSciNetCrossRefGoogle Scholar
  5. Böhem, W.M., Krinik, A., Mohanty, S.G., 1997. The combinatorics of birthdeath processes and applications to queues. Queueing Systems, 26, 255–267.MathSciNetCrossRefGoogle Scholar
  6. Botta, R.F., Harris, C.M., Marchal, W.G., 1987. Characterization of generalized hyperexponential distribution functions. Communication in Statistics and Stochastic Models, 3, 115–148.MathSciNetCrossRefGoogle Scholar
  7. Buzacott, J.A., Shanthikumar, J.G., 1993. Stochastic Models of Manufacturing Systems, Prentice Hall, New Jersey.Google Scholar
  8. Chaudhury, M.L., Templeton, J.G.C., 1983. A First Course in Bulk Queues, John Wiley & Sons, New York.Google Scholar
  9. Cox, D.R., 1955. A use of complex probabilities in the theory of stochastic processes. Proceedings of the Cambridge Philosophical Society, 51, 313–319.MathSciNetCrossRefGoogle Scholar
  10. Dalen, G., Natvig, B., 1980. On the transient waiting times for a GI/M/1 priority queue. Journal of Applied Probability, 17, 227–234.MathSciNetCrossRefGoogle Scholar
  11. Feller, W., 1985. An Introduction to Probability Theory and Its Applications: Vol. 1 (4th edition), John Wiley & Sons, New York.Google Scholar
  12. Harris, C.M., Marchal, W.G., Botta, R.F., 1992. A note on generalized hyperexponential distributions. Communications in Statistics-Stochastic Models, 8(1), 179–191.MathSciNetCrossRefGoogle Scholar
  13. Joy, M., Jones, S., 2005. Transient probabilities for queues with applications to hospital waiting list managemant. Health Care Management Sciences, 8, 231–236.CrossRefGoogle Scholar
  14. Kleinrock, L., 1975. Queueing Systems: Vol. 1, John Wiley & Sons, New York.Google Scholar
  15. Krinik, A., Marcus, D., Shiflett, R., Chu, L., 2002. Transient probabilities of a single server priority queueing system. Journal of Statistical Planning and Inference, 101(1-2), 185–190.MathSciNetCrossRefGoogle Scholar
  16. Krinik, A., Rubino, G., Marcus, D., Swift, R.J., Kasfy, H., Lam, H., 2005. Dual processes to solve single server systems. Journal of Statistical Planning and Inference, 135(1), 121–147.MathSciNetCrossRefGoogle Scholar
  17. Marie, R., 1978. Methods iteratives de resolution de models mathematiques de systems informatiques, R.A.I. R.O. Inform./Comput. Sci., 12, 107–122.zbMATHGoogle Scholar
  18. Marie, R., 1980. Calculating equilibrium probabilities for λ(n)/Ck/1/N queues. ACM SIGMETRICS, Conference on Measurement and Modeling of Computer Systems, 117–125.Google Scholar
  19. Mohanty, S.G., 1972. On queues involving batches. Journal of Applied Probability, 9, 430–435.MathSciNetCrossRefGoogle Scholar
  20. Muto, K., Miyazaki, H., Seki, Y., Kimura, Y., Shibata, Y., 1995. Lattice path counting and M/M/C queuing system. Queueing Systems, 19, 193–214.CrossRefGoogle Scholar
  21. Narahari, Y., Viswanadham, N., 1994. Transient analysis of manufacturing systems performance. IEEE Transactions on Robotics and Automation, 10(2), 230–244.CrossRefGoogle Scholar
  22. Neuts, M.F., 1981. Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach, The Johns Hopkins University Press, Baltimore, Maryland.zbMATHGoogle Scholar
  23. Neuts, M.F., 1989. Structured Stochastic Matrices of M/G/1 Type and Their Applications, McGraw Hill, New York.zbMATHGoogle Scholar
  24. Ohta, H., Furukawa, M., 1985. An application of the number of minimal lattice paths to the theory of queues. The Journal of the Operational Research Society, 36(12), 1117–1124.CrossRefGoogle Scholar
  25. Saaty, T.L., 1961. Elements of Queueing Theory with Applications. McGraw-Hill, New York.zbMATHGoogle Scholar
  26. Sen, K., Jain, J.L., 1993. Combinatorial approach to Markovian queuing models. Journal of Statistical Planning and Inference, 34, 269–279.MathSciNetCrossRefGoogle Scholar
  27. Sen, K., Gupta, R., 1996. Transient analysis of M/M/1 queues with batch arrival: A new approach. STATISTICA, anno. LV I, 3, 333–343.zbMATHGoogle Scholar
  28. Sen, K., Agarwal, M., 1996. Transient queue length distribution of M/G/1 system using Cox distribution-Lattice path approach. In: Proceedings of the International Conference on Stochastic Processes. Krishnamoorthy, A.(ed.), Dept. of Maths, Cochin University of Science and Technology, Cochin, pp. 35–55.Google Scholar
  29. Sen, K., Agarwal, M., 1997. Transient busy period analysis of initially non-empty M/G/1 queues — Lattice path approach. In: Advances in Combinatorial Methods and Applications to Probability and Statistics. Balakrishnan, N. (ed.), Birkhauser, Boston Inc, pp. 301–315.CrossRefGoogle Scholar
  30. Sen, K., Agarwal, M., 1998. Lattice path approach to transient busy period analysis of GI/M/1 queues using Cox distribution. In: Statistical Methods in Quality and Reliability. Nair, NU, Sankaran, PG.(eds.), EPD, pp. 32–49.Google Scholar
  31. Sen, K., Agarwal, M., 2001. On busy period density of the queue M/Gb/1: Lattice path approach. In: Recent Developments in Operational Research, Manju Lata Agarwal & Kanwar Sena Publishing House, pp. 343–363.Google Scholar
  32. Sen, K., Agarwal, M., 2002a. Transient Analysis of Non-Markovian Queues via Lattice Path Combinatorics using k-Phase Cox Distributions. DST/MS/049/96 Project funded by the Dept of Science and Technology, Govt. of India, India.Google Scholar
  33. Sen, K., Agarwal, M., 2002b. Lattice path combinatorics applied to transient queue length distribution of C 2/M/1 queues and busy period analysis of bulk queues C 2 b/M/1. Journal of Statistical Planning and Inference, 100(2), 365–397.MathSciNetCrossRefGoogle Scholar
  34. Sen, K., 2002. Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distribution, Journal of Statistical Planning and Inference, 101(1–2), 133–147.MathSciNetCrossRefGoogle Scholar
  35. Takács, L., 1979. Combinatorial Methods in the Theory of Stochastic Processes, John Wiley & Sons, New York.Google Scholar
  36. Takagi, H., 1991. Queueing Analysis, Vol. 1: Vacation and Priority Systems, Amsterdam, North-Holland.zbMATHGoogle Scholar
  37. Takagi, H., 1993a. Queueing Analysis, Vol. 2: Finite Systems, Amsterdam, North-Holland.Google Scholar
  38. Takagi, H., 1993. Queueing Analysis, Vol. 3: Discrete Time Systems, Amsterdam, North-Holland.Google Scholar
  39. Vanderperre, E.J., 1990. Reliability analysis of a two unit parallel system with dissimilar units and general distributions. Microelectronics & Reliability, 30(3), 491–501.CrossRefGoogle Scholar
  40. Vanderperre, E.J., 1998. On the reliability of Gavers parallel system sustained by a cold stand by unit and attended by two repairmen. Journal of Operations Research Society of Japan, 41(2), 171–180.MathSciNetCrossRefGoogle Scholar

Copyright information

© Grace Scientific Publishing 2007

Authors and Affiliations

  1. 1.Department of Operational ResearchUniversity of DelhiDelhiIndia
  2. 2.Department of StatisticsUniversity of DelhiDelhiIndia

Personalised recommendations