Abstract
We consider Markovian queueing models with a finite number of states and a product form solution for its steady state probability distribution. Starting from the integral representation for the partition function in complex space we construct error bounds for its asymptotic expansion obtained by the saddle point method. The derivation of error bounds is based on an idea by Olver applicable to integral transforms with an exponentially decaying kernel. The bounds are expressed in terms of the supremum of a certain function and are asymptotic to the absolute value of the first neglected term in the expansion as the large parameter approaches infinity. The application of these error bounds is illustrated for two classes of queueing models: loss systems and single chain closed queueing networks.
Similar content being viewed by others
References
A. Birman and Y. Kogan, Asymptotic evaluation of closed queueing networks with many stations,Communications in Statistics. Stochastic Models 8 (1992) 543–564.
A. Brandwajn and A.K. Sahai, Aspects of the solution of some multiclass loss systems,Performance Evaluation 17 (1993) 141–154.
G.L. Choudhury, K.K. Leung and W. Whitt, Calculating normalization constants of closed queueing networks by numerically inverting their generating functions,J. ACM 42 (1995) 935–970.
G.L. Choudhury, K.K. Leung and W. Whitt, An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models,Advances in Applied Probability 27 (1995) 1104–1143.
G.L. Choudhury, Y. Kogan and S. Susskind, Exact and asymptotic solutions for models of new telecommunication services with blocking, submitted toAnnals of Operations Research.
J.W. Cohen, The generalised Engset formulae,Philips Telecomm. Rev. 18 (1957) 158–170.
R.B. Cooper,Introduction to Queueing Theory (CeePress, Washington, DC, 1990).
F.P. Kelly,Reversibility and Stochastic Networks (Wiley, Chichester, UK, 1979).
E.T. Copson,An Introduction to the Theory of Functions of a Complex Variable (Oxford Univ. Press, London, 1935).
H. Kobayashi,Modeling and Analysis: An Introduction to System Performance Evaluation Methodology (Addison-Wesley, Reading, MA, 1978).
Y. Kogan, Another approach to asymptotic expansions for large closed queueing networks,Operations Research Letters 11 (1992) 317–321.
Y. Kogan and A. Birman, Asymptotic analysis of closed queueing networks with bottlenecks, in:IFIP Transactions C-5, Performance of Distributed Systems and Integrated Communication Networks, eds. T. Hasegawa, H. Takagi and Y. Takahashi (North-Holland, Amsterdam, 1992) pp. 265–280.
Y. Kogan and A. Yakovlev, Asymptotics of the partition function in large closed BCMP networks, in:Proc. MASCOTS '95, eds. P. Dowd and E. Gelenbe (IEEE Computer Society Press, Los Alamitos, CA, 1995) pp. 89–93.
J. McKenna and D. Mitra, Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage,The Bell System Technical Journal 61 (1982) 661–683.
D. Mitra and J. McKenna, Asymptotic expansions for closed Markovian networks with state-dependent service rates,J. ACM 33 (1986) 568–592.
F.W.J. Olver,Introduction to Asymptotics and Special Functions (Academic Press, New York, 1974).
E. Pinsky, A simple approximation for the Erlang loss function,Performance Evaluation 15 (1992) 155–161.
E. Pinsky and A. Conway, Exact computation of blocking probabilities in state-dependent multifacility blocking models, in:IFIP Transactions C-5, Performance of Distributed Systems and Integrated Communication Networks, eds. T. Hasegawa, H. Takagi and Y. Takahashi (North-Holland, Amsterdam, 1992) pp. 383–392.
R. Wong,Asymptotic Approximations of Integrals (Academic Press, Boston, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Birman, A., Kogan, Y. Error bounds for asymptotic approximations of the partition function. Queueing Syst 23, 217–234 (1996). https://doi.org/10.1007/BF01206558
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01206558