On the inverse of Erlang's function

Journal of Applied Probability

Volumn 35, Issue 1, 1998, Pages 246-252

  Berezner, S A ^a   Krzesinski, A E ^b   Taylor, P G ^c  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

^b STELLENBOSCH UNIVERSITY   (South Africa)

^c NONE

Author keywords

Erlang's function; Queueing theory

Indexed keywords

EID: 0032373109     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200014856     Document Type: Article

References (19)

1. AKIMARU, H. AND TAKAHASHI, H. (1981). Asymptotic expansion for Erlang loss function and its derivative. IEEE Trans. Commun. 29, 1257-1260.
2. BEAN, N.G. AND TAYLOR, RG. (1995). Maximal profit dimensioning and tariffing of loss networks. Prob. Eng. Inf. Sci. 9, 323-340.
3. BOROVKOV, A.A. (1967). On limit laws for service processes in multi-channel systems (English translation). Siberian Math. J. 8, 746-763.
4. BROCKMEYER, E. (1948). Approximation formulae for loss and improvement. In The Life and Works of A. K. Erlang, ed. H. H. E. Brockmeyer and A. Jensen. Danish Academy of Technical Sciences, Copenhagen pp. 120-126.
5. BROCKMEYER, E., HALSTROM, H. L. AND JENSEN, A. (1948). The Life and Works of A. K. Erlang. Danish Academy of Technical Sciences, Copenhagen.
6. 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.
7. FREDERICKS, A.A. (1980). Congestion in blocking systems - a simple approximation technique. Bell Systems Tech. J. 59, 805-827.
8. GIRARD, A. (1990). Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, New York.
9. JAGERMAN, D.L. (1974). Some properties of the Erlang loss function. Bell System Tech. J. 53,525-557.
10. JAGERMAN, D.L. (1984). Methods in traffic calculations. AT & T Bell Lab. Tech. J. 63, 1283-1310.
11. [11J JAGERS, A.A. AND VAN DOORN, E. A. (1986). On the continued Erlang function. Operat. Res. Lett. 5, 43-46.
12. KELLY, F.P. (1986). Blocking probabilities in large circuit-switching networks. Adv. Appl. Prob. 18, 473-505.
13. RAPP, Y. (1964). Planning of junction networks in a multi-exchange area. I. General principles. Ericsson Technics 20, 77-130.
14. ROSS, K.W. (1995). Multiservice Loss Models for Broadband Telecommunication Networks. Springer, Berlin.
15. 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.
16. VAULOT, E. (1951). Les formules d'Erlang at leur calcul pratique. Ann. Telecom 6, 279-286.
17. WHITT, W. (1984). Heavy traffic approximations for service systems with blocking. Bell Systems Tech. J. 63, 689-708.
18. WIDJAJA, I. (1995). Performance analysis of burst admission-control protocols. IEEE Proc. Commun. 142, 7-14.
19. WlLKlNSON, R.I. (1956). Theories for toll traffic engineering in the USA. Bell Systems Tech. J. 35, 421-514.