Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Error bounds for asymptotic approximations of the partition function

  • Published:
Queueing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Birman and Y. Kogan, Asymptotic evaluation of closed queueing networks with many stations,Communications in Statistics. Stochastic Models 8 (1992) 543–564.

    Google Scholar 

  2. A. Brandwajn and A.K. Sahai, Aspects of the solution of some multiclass loss systems,Performance Evaluation 17 (1993) 141–154.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

  6. J.W. Cohen, The generalised Engset formulae,Philips Telecomm. Rev. 18 (1957) 158–170.

    Google Scholar 

  7. R.B. Cooper,Introduction to Queueing Theory (CeePress, Washington, DC, 1990).

    Google Scholar 

  8. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, Chichester, UK, 1979).

    Google Scholar 

  9. E.T. Copson,An Introduction to the Theory of Functions of a Complex Variable (Oxford Univ. Press, London, 1935).

    Google Scholar 

  10. H. Kobayashi,Modeling and Analysis: An Introduction to System Performance Evaluation Methodology (Addison-Wesley, Reading, MA, 1978).

    Google Scholar 

  11. Y. Kogan, Another approach to asymptotic expansions for large closed queueing networks,Operations Research Letters 11 (1992) 317–321.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. D. Mitra and J. McKenna, Asymptotic expansions for closed Markovian networks with state-dependent service rates,J. ACM 33 (1986) 568–592.

    Google Scholar 

  16. F.W.J. Olver,Introduction to Asymptotics and Special Functions (Academic Press, New York, 1974).

    Google Scholar 

  17. E. Pinsky, A simple approximation for the Erlang loss function,Performance Evaluation 15 (1992) 155–161.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. R. Wong,Asymptotic Approximations of Integrals (Academic Press, Boston, 1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206558

Keywords