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

Sharp and simple bounds for the Erlang delay and loss formulae

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We prove some simple and sharp lower and upper bounds for the Erlang delay and loss formulae and for the number of servers that invert the Erlang delay and loss formulae. We also suggest simple and sharp approximations for the number of servers that invert the Erlang delay and loss formulae. We illustrate the importance of these bounds by using them to establish convexity proofs. We show that the probability that the M/M/s queue is empty is a decreasing and convex function of the traffic intensity. We also give a very short proof to show that the Erlang delay formula is convex in the traffic intensity when the number of servers is held constant. The complete proof of this classical result has never been published. We also give a very short proof to show that the Erlang delay formula is a convex function of the (positive integer) number of servers. One of our results is then used to get a sharp bound to the Flow Assignment Problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adelman, D.: A simple algebraic approximation to the Erlang loss system. Oper. Res. Lett. 36(4), 484–491 (2008)

    Article  Google Scholar 

  2. Berezner, S.A., Krzesinski, A.E., Taylor, P.G.: On the inverse of Erlang’s function. J. Appl. Probab. 35, 246–252 (1998)

    Article  Google Scholar 

  3. Cooper, R.B.: Introduction to Queueing Theory, 2nd edn. North-Holland, Amsterdam (1981)

    Google Scholar 

  4. Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Adv. Comput. Math. 5(4), 329–359 (1996)

    Article  Google Scholar 

  5. Fuhrmann, S., Kogan, Y., Milito, R.A.: An adaptive autonomous network congestion controller. In: Proceeding of the 35th IEEE Conference on Decision and Control, Kobe, Japan, December 1996, pp. 301–306 (1996)

  6. Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29, 567–588 (1981)

    Article  Google Scholar 

  7. Harel, A.: Sharp bounds and simple approximations for the Erlang delay and loss formulas. Manag. Sci. 34, 959–972 (1988)

    Article  Google Scholar 

  8. Harel, A.: Erratum to: sharp bounds and simple approximations for the Erlang delay and loss formulas. Manag. Sci. 34, 1277 (1988)

    Article  Google Scholar 

  9. Harel, A.: Convexity properties of the Erlang loss formula. Oper. Res. 38, 499–505 (1990)

    Article  Google Scholar 

  10. Harel, A., Zipkin, P.: Strong convexity results for queueing systems. Oper. Res. 35(3), 405–418 (1987)

    Article  Google Scholar 

  11. Jagerman, D.L.: Some properties of the Erlang loss function. Bell Syst. Tech. J. 53, 525–551 (1974)

    Google Scholar 

  12. Jagers, A.A., van Doorn, E.A.: Convexity of functions which are generalizations of the Erlang loss function and the Erlang delay function. SIAM Rev. 33(2), 281–282 (1991)

    Article  Google Scholar 

  13. Janssen, A.J.E.M., van Leeuwaarden, J.S.H., Zwart, B.: Corrected asymptotics for a multi-server queue in the Halfin–Whitt regime. Queueing Syst. 58(4), 261–301 (2008)

    Article  Google Scholar 

  14. Kleinrock, L.: Queueing Systems. Vol. II. Computer Applications. Wiley, New York (1976)

    Google Scholar 

  15. Ko, S.S., Serfozo, R., Sivakumar, A.I.: Reducing cycle times in manufacturing and supply chains by input and service rate smoothing. IIE Trans. 36(2), 145–153 (2004)

    Article  Google Scholar 

  16. Lee, H.L., Cohen, M.A.: A note on the convexity of performance measures of M/M/c queueing systems. Working Paper 82-06-04, Department of Decision Sciences, The Wharton School, University of Pennsylvania (1982)

  17. Lee, H.L., Cohen, M.A.: A note on the convexity of performance measures of M/M/c queueing systems. J. Appl. Probab. 20, 920–923 (1983)

    Article  Google Scholar 

  18. van Leeuwaarden, J.S.H., Temme, N.M.: Asymptotic inversion of the Erlang B formula. SIAM J. Appl. Math. 70(1), 1–23 (2009)

    Article  Google Scholar 

  19. Newell, G.F.: The M/M/∞ Service System with Ranked Servers in Heavy Traffic. Springer, New York (1984)

    Google Scholar 

  20. Sobel, M.J.: Simple inequality for multiserver queues. Manag. Sci. 26, 951–956 (1980)

    Article  Google Scholar 

  21. Whitt, W.: The Erlang B and C formulas: problems and solutions. Unpublished Manuscript. http://www.columbia.edu/~ww2040/ErlangBandCFormulas.pdf (2002)

Download references

Author information

Authors and Affiliations

  1. Zicklin School of Business, Baruch College, CUNY, 55 Lexington Avenue, Box B11-220, New York, NY, 10010-5585, USA

    Arie Harel

Authors
  1. Arie Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arie Harel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Harel, A. Sharp and simple bounds for the Erlang delay and loss formulae. Queueing Syst 64, 119–143 (2010). https://doi.org/10.1007/s11134-009-9152-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-009-9152-7

Mathematics Subject Classification (2000)

Search

Navigation