Abstract
Many approximations of queueing performance measures are based on moment matching. Empirical and theoretical results show that although approximations based on two moments are often accurate, two-moment approximations can be arbitrarily bad and sometimes three-moment approximations are far better. In this paper, we investigate graphically error bounds for two- and three-moment approximations of three performance measures forGI/M/ · type models. Our graphical analysis provides insight into the adequacy of two- and three-moment approximations as a function of standardized moments of the interarrival-time distribution. We also discuss how the behavior of these approximations varies with other model parameters and with the performance measure being approximated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Altiok, On the phase-type approximations of general distributions, IIE Trans. 17 (1985) 110–116.
A.E. Eckberg, Jr., Sharp bounds on Laplace-Stieltjes transforms, with applications to various queueing problems, Math. Oper. Res. 2 (1977) 135–142.
M.A. Johnson and M.R. Taaffe, Tchebycheff systems: a review and interpretation for probabilistic analysis, Research Memorandum 1988–21, School of Industrial Engineering, Purdue University (1988).
M.A. Johnson and M.R. Taaffe, An investigation of phase-distribution moment-matching algorithms for use in queueing models, Queueing Systems 8 (1991) 129–248.
M.A. Johnson and M.R. Taaffe, Matching moments to phase distributions: mixtures of Erlang distributions of common order, Stochastic Models 5 (1989) 711–743.
M.A. Johnson and M.R. Taaffe, Matching moments to phase distributions: nonlinear programming approaches, Stochastic Models 6 (1990) 259–281.
M.A. Johnson and M.R. Taaffe, Matching moments to phase distributions: density function shapes, Stochastic Models 6 (1990) 283–306.
J.G. Klincewicz and W. Whitt, On approximations for queues, II: Shape constraints, AT&T Bell Labs. Tech. J. 63 (1984) 139–161.
I. Sahin and S. Perrakis, Moment inequalities for a class of single server queues, INFOR 14 (1976) 144–152.
L. Takács,Introduction to the Theory of Queues (Oxford University Press, 1962).
H.C. Tijms,Stochastic Modelling and Analysis: A Computational Approach (Wiley, New York, 1986).
W. Whitt, On approximations for queues, I: Extremal distributions, AT&T Bell Labs. Tech. J. 63 (1984) 115–138.
W. Whitt, On Approximations for queues, III: Mixtures of exponential distributions, AT&T Bell Labs. Tech. J. 63 (1984) 163–175.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johnson, M.A., Taaffe, M.R. A graphical investigation of error bounds for moment-based queueing approximations. Queueing Syst 8, 295–312 (1991). https://doi.org/10.1007/BF02412257
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02412257