References
- Akar, N., N. C. Oguz, and K. Sohraby. 1998. Matrix-geometric solutions of M/G/1-type Markov chains: A unifying generalized state-space approach. IEEE Journal on Selected Areas in Communications 16 (5):626–39. doi:https://doi.org/10.1109/49.700901.
- Baba, Y. 1984. The MX/G/1 queue with finite waiting room. Journal of the Operations Research Society of Japan 27:260–73.
- Blondia, C. 1989. The N/G/l finite capacity queue. Communications in Statistics. Stochastic Models 5 (2):273–94. doi:https://doi.org/10.1080/15326348908807110.
- Bruneel, H., and B. G. Kim. 2012. Discrete-time models for communication systems including ATM. Vol. 205. New York, NY: Springer Science & Business Media.
- Chakka, R. 1995. Performance and reliability modelling of computing systems using spectral expansion. PhD. thesis, Department of Computing Science, University of Newcastle.
- Chaudhry, M. L. 1979. The queueing system MX/G/1 and its ramifications. Naval Research Logistics Quarterly 26 (4):667–74. doi:https://doi.org/10.1002/nav.3800260411.
- Chaudhry, M. L. 1992a. QROOT software package. Kingston, Ontario, Canada: A & A Publications.
- Chaudhry, M. L. 1992b. Numerical issues in computing steady-state queueing-time distributions of single-server bulk-service queues: M/Gb/1 and M/Gd/1. ORSA Journal on Computing 4 (3):300–10. doi:https://doi.org/10.1287/ijoc.4.3.300.
- Chaudhry, M. L. 1993. Exact and approximate numerical solutions of steady-state single-server bulk-arrival discrete-time queues: GeomX/G/1. International Journal of Mathematical and Statistical Sciences 62:133–85.
- Chaudhry, M. L., and V. Goswami. 2019. The queue Geo/G/1/N+1 revisited. Methodology and Computing in Applied Probability 21 (1):155–68. doi:https://doi.org/10.1007/s11009-018-9645-0.
- Chaudhry, M. L., and U. C. Gupta. 1992. Exact computational analysis of waiting-time distributions of single-server bulk-arrival queues. European Journal of Operational Research 63 (3):445–62. MX/G/1. doi:https://doi.org/10.1016/0377-2217(92)90161-2.
- Chaudhry, M. L., U. C. Gupta, and M. Agarwal. 1991. On exact computational analysis of distributions of numbers in systems for M/G/1/N+1 and GI/M/1/N+1 queues using roots. Computers & Operations Research 18 (8):679–94. doi:https://doi.org/10.1016/0305-0548(91)90006-D.
- Chaudhry, M. L., U. C. Gupta, and M. Agarwal. 1992. Exact and approximate numerical solutions to steady-state single-server queues: M/G/1 - a unified approach. Queueing Systems 10 (4):351–79. doi:https://doi.org/10.1007/BF01193326.
- Chaudhry, M. L., C. M. Harris, and W. G. Marchal. 1990. Robustness of rootfinding in single-server queueing models. ORSA Journal on Computing 2 (3):273–86. doi:https://doi.org/10.1287/ijoc.2.3.273.
- Chaudhry, M. L., G. Singh, and U. C. Gupta. 2013. A simple and complete computational analysis of MAP/R/1 queue using roots. Methodology and Computing in Applied Probability 15 (3):563–82. doi:https://doi.org/10.1007/s11009-011-9266-3.
- Chaudhry, M. L., and J. G. C. Templeton. 1983. A first course in bulk queues. New York, NY: John Wiley & Sons.
- Chiamsiri, S., and M. S. Leonard. 1981. A diffusion approximation for bulk queues. Management Science 27 (10):1188–99. doi:https://doi.org/10.1287/mnsc.27.10.1188.
- Conti, P. L. 1999. Large sample Bayesian analysis for Geo/G/1 discrete-time queueing models. The Annals of Statistics 27 (6):1785–807. doi:https://doi.org/10.1214/aos/1017939239.
- Daigle, J., and D. Lucantoni. 1991. Queueing systems having phase-dependant arrival and service rates. In Chapter 10 of Numerical Solutions of Markov Chains, ed. W.J. Stewart, 161–202. New York: Marcel Dekker.
- Gail, H. R., S. L. Hantler, and B. A. Taylor. 1996. Spectral analysis of M/G/1 and G/M/1 type Markov chains. Advances in Applied Probability 28 (1):114–65. doi:https://doi.org/10.2307/1427915.
- Gouweleeuw, F. N. 1996. Calculating the loss probability in a BMAP/G/1/N+1 queue. Stochastic Models 12 (3):473–92. doi:https://doi.org/10.1080/15326349608807395.
- Gravey, A., and G. Hébuterne. 1992. Simultaneity in discrete-time single server queues with Bernoulli inputs. Performance Evaluation 14 (2):123–31. doi:https://doi.org/10.1016/0166-5316(92)90014-8.
- Hunter, J. J. 1983. Mathematical techniques of applied probability. Vol. 2, discrete time models: Techniques and applications. New York, NY: Academic Press.
- Janssen, A. J., and J. S. H. Van Leeuwaarden. 2005. Analytic computation schemes for the discrete-time bulk service queue. Queueing Systems 50 (2-3):141–63. doi:https://doi.org/10.1007/s11134-005-0402-z.
- Keilson, J. 1966. The ergodic queue length distribution for queueing systems with finite capacity. Journal of the Royal Statistical Society: Series B (Methodological) 28 (1):190–201. doi:https://doi.org/10.1111/j.2517-6161.1966.tb00632.x.
- Keilson, J., and L. D. Servi. 1989. Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules. Operations Research 37 (1):134–40. doi:https://doi.org/10.1287/opre.37.1.134.
- Kendall, D. G. 1964. Some recent work and further problems in the theory of queues. Theory of Probability & Its Applications 9 (1):1–13. doi:https://doi.org/10.1137/1109001.
- Kleinrock, L. 1975. Queueing systems. Volume I: Theory. New York, NY: John Wiley & Sons.
- Kobayashi, H., B. L. Mark, and W. Turin. 2011. Probability, random processes, and statistical analysis: Applications to communications, signal Processing, queueing Theory and mathematical finance. Cambridge: Cambridge University Press.
- Kouvatsos, D. D., S. G. Denazis, and N. M. Tabet-Aouel. 1994. Simultaneity in discrete-time queues with compound Bernoulli inputs and AF-DF buffer management policies. In Teletraffic Symposium, 11th Performance Engineering in Telecommunications Networks, 1–15.
- Lavenberg, S. S. 1975. The steady-state queueing time distribution for the M/G/1 finite capacity queue. Management Science 21 (5):501–506. doi:https://doi.org/10.1287/mnsc.21.5.501.
- Lee, H. W., S. H. Lee, S. H. Yoon, B. Y. Ahn, and N. I. Park. 1999. A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM. Computers & Operations Research 26 (6):559–81. doi:https://doi.org/10.1016/S0305-0548(98)00059-8.
- Lee, H. W., J. M. Moon, J. K. Park, and B. K. Kim. 2003. A spectral approach to compute the mean performance measures of the queue with low-order BMAP input. Journal of Applied Mathematics and Stochastic Analysis 16 (4):349–60. doi:https://doi.org/10.1155/S1048953303000273.
- Lee, H. S., and M. M. Srinivasan. 1989. Control policies for the MX/G/1 queueing system. Management Science 35 (6):708–21. doi:https://doi.org/10.1287/mnsc.35.6.708.
- Maity, A., and U. C. Gupta. 2015. A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of BDMMAP/G/1 queue. International Journal of Stochastic Analysis 2015:1–9. doi:https://doi.org/10.1155/2015/958730.
- Manfield, D., and P. Tran-Gia. 1982. Analysis of a finite storage system with batch input arising out of message packetization. IEEE Transactions on Communications 30 (3):456–63. doi:https://doi.org/10.1109/TCOM.1982.1095495.
- Nobel, R. D. 1989. Practical approximations for finite-buffer queueing models with batch arrivals. European Journal of Operational Research 38 (1):44–55. doi:https://doi.org/10.1016/0377-2217(89)90467-0.
- Pechinkin, A. V., and S. Y. Shorgin. 2008. Geo/G/1/∞-queue with one “nonstandard” discipline of service. Informatics and Its Applications 2 (1):55–62.
- Ramaswami, V. 1988. A stable recursion for the steady state vector in Markov chains of M/G/1 type. Stochastic Models 4 (1):183–88. doi:https://doi.org/10.1080/15326348808807077.
- Stidham, S. J. 2001. Applied probability in operations research: A retrospective. North Carolina: Department of Operations Research, University of North Carolina at Chapel Hill.
- Takagi, H. 1993a. Queueing analysis: Finite systems, Vol. 2. Amsterdam: North Holland.
- Takagi, H. 1993b. Queueing analysis: Discrete-time systems, Vol. 3. Amsterdam: North Holland.
- Wang, T. Y., and J. C. Ke. 2009. The randomized threshold for the discrete-time Geo/G/1 queue. Applied Mathematical Modelling 33 (7):3178–85. doi:https://doi.org/10.1016/j.apm.2008.10.010.
- Woodward, M. E. 1994. Communication and computer networks: Modelling with discrete-time queues. Los Alamitos, CA: Wiley-IEEE Computer Society Press.
- Yang, T., and H. Li. 1995. On the steady-state queue size distribution of the discrete-time Geo/G/1 queue with repeated customers. Queueing Systems 21 (1/2):199–215. doi:https://doi.org/10.1007/BF01158581.