×

A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. (English) Zbl 1041.90010

Summary: A complete distribution for the system content of a discrete-time multi-server queue with an infinite buffer is presented, where each customer arriving in a group requires a deterministic service time that could be greater than one slot. In addition, when the service time equals one slot, a complete distribution for the delay is also presented.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)

Software:

QROOT
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Boxma, O. J.; Groenendijk, W. P., Waiting times in discrete-time cyclic-service systems, IEEE Trans. Commun., 36, 164-170 (1988) · Zbl 0655.90026
[2] Bruneel, H.; Kim, B. G., Discrete-Time Models for Communication Systems Including ATM (1993), Kluwer Academic Publishers: Kluwer Academic Publishers Boston
[3] Bruneel, H.; Wuyts, I., Analysis of discrete-time multiserver queueing models with constant service times, Oper. Res. Lett., 15, 231-236 (1994) · Zbl 0814.90030
[4] M.L. Chaudhry, QROOT Software Package, A&A Publications, 395 Carrie Crescent, Kingston, Ont., 1991.; M.L. Chaudhry, QROOT Software Package, A&A Publications, 395 Carrie Crescent, Kingston, Ont., 1991.
[5] Chaudhry, M. L.; Gupta, U. C., Computing waiting-time probabilities in the discrete-time queue \(GI^X/ G/1\), Perform. Eval., 43, 123-131 (2001) · Zbl 1053.68014
[6] Chaudhry, M. L.; Templeton, J. G.C., A First Course in Bulk Queues (1983), Wiley: Wiley New York · Zbl 0559.60073
[7] M.L. Chaudhry, N.K. Kim, K.C. Chae, Equivalence of bulk-service queues and multi-server queues and their explicit distributions in terms of roots, Technical Report #01-07, Department of Industrial Engineering, KAIST, 2001.; M.L. Chaudhry, N.K. Kim, K.C. Chae, Equivalence of bulk-service queues and multi-server queues and their explicit distributions in terms of roots, Technical Report #01-07, Department of Industrial Engineering, KAIST, 2001.
[8] Daigle, J. N., Queue length distributions from probability generating functions via discrete Fourier transforms, Oper. Res. Lett., 8, 229-236 (1989) · Zbl 0671.60098
[9] F.N. Gouweleeuw, A general approach to computing loss probabilities in finite-buffer queues, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1996.; F.N. Gouweleeuw, A general approach to computing loss probabilities in finite-buffer queues, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1996. · Zbl 0880.90048
[10] J.J. Hunter, Mathematical Techniques of Applied Probability, Discrete-Time Models, Vol. II, Academic Press, New York, 1983.; J.J. Hunter, Mathematical Techniques of Applied Probability, Discrete-Time Models, Vol. II, Academic Press, New York, 1983. · Zbl 0539.60065
[11] N.K. Kim, K.C. Chae, M.L. Chaudhry, An invariance relation and a unified method to derive stationary queue lengths, Working Paper, 2002.; N.K. Kim, K.C. Chae, M.L. Chaudhry, An invariance relation and a unified method to derive stationary queue lengths, Working Paper, 2002.
[12] Konheim, A. G., An elementary solution of the queueing system \(G/G/1\), SIAM J. Comput., 4, 540-545 (1975) · Zbl 0322.60082
[13] Xiong, Y.; Bruneel, H.; Steyaert, B., Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers, Perform. Eval., 24, 189-204 (1996) · Zbl 0875.68060
[14] Zhao, Y. Q.; Campbell, L. L., Equilibrium probability calculations for a discrete-time bulk queue model, Queueing Systems, 22, 189-198 (1996) · Zbl 0849.90067
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.