Abstract
In commonly used root-finding approaches for the discrete-time bulk service queue, the stationary queue length distribution follows from the roots inside or outside the unit circle of a characteristic equation. We present analytic representations of these roots in the form of sample values of periodic functions with analytically given Fourier series coefficients, making these approaches more transparent and explicit. The resulting computational scheme is easy to implement and numerically stable. We also discuss a method to determine the roots by applying successive substitutions to a fixed point equation. We outline under which conditions this method works, and compare these conditions with those needed for the Fourier series representation. Finally, we present a solution for the stationary queue length distribution that does not depend on roots. This solution is explicit and well-suited for determining tail probabilities up to a high accuracy, as demonstrated by some numerical examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I.J.B.F. Adan and Y.Q. Zhao, Analyzing GI/E r /1 queues, Operations Research Letters 19 (1996) 183–190.
N.T.J. Bailey, On queueing processes with bulk service, Journal of the Royal Statistical Society 16 (1954) 80–87.
H. Bruneel and B.G. Kim, Discrete-Time Models for Communication Systems including ATM (Kluwer Academic Publishers, Dordrecht, 1993).
H. Bruneel and I. Wuyts, Analysis of discrete-time multiserver queueing models with constant service times, Operations Research Letters 15 (1994) 231–236.
M.L. Chaudhry, C.M. Harris and W.G. Marchal, Robustness of rootfinding in single-server queueing models, ORSA Journal on Computing 3 (1990) 273–286.
M.L. Chaudhry and N.K. Kim, A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times, Operations Research Letters 31 (2003) 101–107.
M.L. Chaudhry, B.R. Madill and G. Brière, Computational analysis of steady-state probabilities of M/Ga,b/1 and related non-bulk queues, QUESTA 2 (1987) 93–113.
M.L. Chaudhry and J.G.C. Templeton, A First Course in Bulk Queues (John Wiley & Sons, New York, 1983).
J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1982).
C.D. Crommelin, Delay probability formulae when the holding times are constant, Post Office Electrical Engineers Journal 25 (1932) 41–50.
T.J.J. Denteneer, A.J.E.M. Janssen and J.S.H. van Leeuwaarden, Moment series inequalities for the discrete-time multi-server queue, Eurandom report series 017; Math. Meth. Oper. Res. 61 (2005) 85–108.
T.J.J. Denteneer, J.S.H. van Leeuwaarden and J.A.C. Resing, Bounds for a discrete-time multi-server queue with an application to cable networks, in: Proceedings of ITC 18 (Elsevier, Berlin, 2003) pp. 601–612.
F. Downton, Waiting time in bulk service queues, J. Roy. Stat. Soc. B 17 (1955) 256–261.
P.L. Duren, Univalent Functions (Springer, New York, 1983).
M.J.A. van Eenige, Queueing systems with periodic service, Ph.D. thesis, Technische Universiteit Eindhoven, 1996.
C.M. Harris, W.G. Marchal and R.W. Tibbs, An algorithm for finding characteristic roots of quasi-triangular Markov chains, in: Queueing and Related Models, ed. U.N. Bhat (Oxford University Press, 1992).
J. He and K. Sohraby, A new analysis framework for discrete time queueing systems with general stochastic sources, IEEE Infocom 2001 (New York, 2001).
A.J.E.M. Janssen, and J.S.H. van Leeuwaarden, A discrete queue, Fourier sampling on Szegö curves, and Spitzer’s formula, Eurandom report series 018; To appear in International Journal of Wavelets, Multiresolution and Information Processing, 2003.
A.J.E.M. Janssen and J.S.H. van Leeuwaarden, Relaxation time for the discrete D/G/1 queue, Eurandom report series 039; Queueing Systems 50 (2005) 53–80.
S. Kakeya, On the limits of roots of an algebraic equation with positive coefficients, Tôhoku Mathematical Journal 2 (1912) 140–142.
M.F. Neuts, Matrix-geometric Solutions in Stochastic Models, An Algorithmic Approach (The Johns Hopkins Press, Baltimore, 1981).
T. Norimatsu, H. Takagi and H.R. Gail, Performance analysis of the IEEE 1394 serial bus, Performance Evaluation 50 (2002) 1–26.
G. Pólya and G. Szegö, Problems and Theorems in Analysis. Volume I (Springer-Verlag, New York, 1972).
W.B. Powell, Analysis of vehicle holding and cancellation strategies in bulk arrival, bulk service queues, Transportation Science 19 (1985) 352–377.
L.D. Servi, D/G/1 queues with vacations, Operations Research 34 (1986) 619–629.
H. Silverman, Complex Variables (Houghton Mifflin, Boston, 1975).
E.C. Titchmarsh, The Theory of Functions, 2nd edition (Oxford University Press, New York, 1939).
E.T. Whittaker and G.N. Watson, A Course of Modern Analysis, 4th edition (Cambridge University Press, Cambridge, 1963).
Y.Q. Zhao and L.L. Campbell, Performance analysis of a multibeam packet satellite system using random access techniques, Performance Evaluation 24 (1995) 231–244.
Y.Q. Zhao and L.L. Campbell, Equilibrium probability calculations for a discrete-time bulk queue model, Queueing Systems 22 (1996) 189–198.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification: 42B05, 60K25, 68M20
Rights and permissions
About this article
Cite this article
Janssen, A.J.E.M., van Leeuwaarden, J.S.H. Analytic Computation Schemes for the Discrete-Time Bulk Service Queue. Queueing Syst 50, 141–163 (2005). https://doi.org/10.1007/s11134-005-0402-z
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11134-005-0402-z