Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T04:47:14.384Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Inverse of Erlang's Function

Part of: Operations research and management science Computer system organization Special processes

Published online by Cambridge University Press:  14 July 2016

S. A. Berezner ,
A. E. Krzesinski  and
P. G. Taylor
S. A. Berezner*
Affiliation:
University of Natal
A. E. Krzesinski*
Affiliation:
University of Stellenbosch
P. G. Taylor*
Affiliation:
University of Adelaide
*
∗Postal address: Department of Statistics, University of Natal, 4001 Durban, South Africa.
∗∗Postal address: Department of Computer Science, University of Stellenbosch, 7600 Stellenbosch, South Africa. e-mail address: [email protected]
∗∗∗Postal address: Department of Applied Mathematics, University of Adelaide, South Australia 5005, Australia. e-mail address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Erlang's function B(λ, C) gives the blocking probability that occurs when Poisson traffic of intensity λ is offered to a link consisting of C circuits. However, when dimensioning a telecommunications network, it is more convenient to use the inverse C(λ, B) of Erlang's function, which gives the number of circuits needed to carry Poisson traffic λ with blocking probability at most B. This paper derives simple bounds for C(λ, B). These bounds are close to each other and the upper bound provides an accurate linear approximation to C(λ, B) which is asymptotically exact in the limit as λ approaches infinity with B fixed

Keywords

Erlang's functionqueueing theory

MSC classification

Primary: 60K25: Queueing theory
Secondary: 68M20: Performance evaluation; queueing; scheduling 90B22: Queues and service
Type
Short Communications
Information
Journal of Applied Probability , Volume 35 , Issue 1 , March 1998 , pp. 246 - 252
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Akimaru, H., and Takahashi, H. (1981). Asymptotic expansion for Erlang loss function and its derivative. IEEE Trans. Commun. 29, 1257–1260.Google Scholar
Bean, N.G., and Taylor, P.G. (1995). Maximal profit dimensioning and tariffing of loss networks. Prob. Eng. Inf. Sci. 9, 323–340.Google Scholar
Borovkov, A.A. (1967). On limit laws for service processes in multi-channel systems (English translation). Siberian Math. J. 8, 746–763.Google Scholar
Brockmeyer, E. (1948). Approximation formulae for loss and improvement. In The Life and Works of A. K. Erlang. ed. Brockmeyer, H. H. E. and Jensen, A. Danish Academy of Technical Sciences, Copenhagen pp. 120–126.Google Scholar
Brockmeyer, E., Halstrom, H. L., and Jensen, A. (1948). The Life and Works of A. K. Erlang. Danish Academy of Technical Sciences, Copenhagen.Google Scholar
Chang, C., and Chung, C. (1994). An efficient approach to real-time traffic routing for telephone network management. J. Operat. Res. Soc. 45, 187–201.Google Scholar
Fredericks, A.A. (1980). Congestion in blocking systems - a simple approximation technique. Bell Systems Tech. J. 59, 805–827.CrossRefGoogle Scholar
Girard, A. (1990). Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, New York.Google Scholar
Jagerman, D.L. (1974). Some properties of the Erlang loss function. Bell System Tech. J. 53, 525–557.CrossRefGoogle Scholar
Jagerman, D.L. (1984). Methods in traffic calculations. AT&T Bell Lab. Tech. J./ 63, 1283–1310.CrossRefGoogle Scholar
Jagers, A.A., and Van Doorn, E.A. (1986). On the continued Erlang function. Operat. Res. Lett. 5, 43–46.CrossRefGoogle Scholar
Kelly, F.P. (1986). Blocking probabilities in large circuit-switching networks. Adv. Appl. Prob. 18, 473–505.Google Scholar
Rapp, Y. (1964). Planning of junction networks in a multi-exchange area. I. General principles. Ericsson Technics 20, 77–130.Google Scholar
Ross, K.W. (1995). Multiservice Loss Models for Broadband Telecommunication Networks. Springer, Berlin.Google Scholar
Sanders, B., Haemers, W.H., and Wilcke, R. (1983). Simple approximation techniques for congestion functions for smoothed and peaked traffic. In Proc. 10th Int. Teletraffic Congress, Montreal. Montreal.Google Scholar
Vaulot, E. (1951). Les formules d'Erlang at leur calcul pratique. Ann. Telecom 6, 279–286.Google Scholar
Whitt, W. (1984). Heavy traffic approximations for service systems with blocking. Bell Systems Tech. J. 63, 689–708.Google Scholar
Widjaja, I. (1995). Performance analysis of burst admission-control protocols. IEEE Proc. Commun. 142, 7–14.CrossRefGoogle Scholar
Wilkinson, R.I. (1956). Theories for toll traffic engineering in the USA. Bell Systems Tech. J. 35, 421–514.CrossRefGoogle Scholar