On the continued Erlang loss function
暂无分享，去创建一个
[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[2] R. I. Wilkinson. Theories for toll traffic engineering in the U. S. A. , 1956 .
[3] R. Syski,et al. Introduction to congestion theory in telephone systems , 1962 .
[4] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[5] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[6] E. Messerli. B.S.T.J. brief: Proof of a convexity property of the erlang B formula , 1972 .
[7] D. Jagerman. Some properties of the erlang loss function , 1974 .
[8] A. A. Fredericks. Congestion in blocking systems — a simple approximation technique , 1980, The Bell System Technical Journal.
[9] Kenneth O. Kortanek,et al. A linear programming model for design of communications networks with time varying probabilistic demands , 1981 .
[10] W. Whitt,et al. Resource sharing for efficiency in traffic systems , 1981, The Bell System Technical Journal.
[11] A. Unwin,et al. Introduction to Queueing Theory , 1973 .
[12] W. H. Haemers,et al. Simple approximation techniques for congestion functions for smooth and peaked traffic , 1983 .
[13] D. L. Jagerman. Methods in traffic calculations , 1984, AT&T Bell Laboratories Technical Journal.
[14] Erik A. van Doorn. Some Aspects of the Peakedness Concept in Teletraffic Theory , 1986, J. Inf. Process. Cybern..