Abstract
This paper presents a unified treatment of the mathematical properties of the second-order derivatives of the overflow traffic function from an Erlang loss system, assuming the number of circuits to be a nonnegative real number. It is shown that the overflow traffic function \( \widehat A\left( {a,x} \right) \) is strictly convex with respect to x (number of circuits) for x ≥ 0, taking the offered traffic, a, as a positive real parameter. It is also shown that \( \widehat A\left( {a,x} \right) \) is a strictly convex function with respect to a, for all (a, x) ∈ ℝ+ × ℝ+. Following a similar process, it is shown that \( \widehat A\left( {a,x} \right) \) is a strict submodular function in this domain and that the improvement function introduced by K. O. Moe [11] is strictly increasing in a. Finally, based on some particular cases and numerous numerical results, there is a conjecture that the function \( \widehat A\left( {a,x} \right) \) is strictly jointly convex in areas of low blocking where the standard offered traffic is less than −1.
Similar content being viewed by others
References
A. K. Erlang, “Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges,” Elektroteknikeren, 13, 5–13 (1917).
J. S. Esteves, J. Craveirinha, and D. Cardoso, “Computing Erlang-B function derivatives in the number of servers — a generalized recursion,” ORSA Commun. Stat., Stochastic Models, 11, No. 2, 311–331 (1995).
J. S. Esteves, J. Craveirinha, and D. Cardoso, “A reduced recursion for computing Erlang-B function derivatives,” In: Proc. 15th Int. Teletraffic Congress, Washington D.C., U.S.A. (22–27 June, 1997), Published by Elsevier Science B. V. (Teletraffic Science and Engineering Series), Vol. 2B: “Teletraffic Contributions for the Information Age,” Edited by V. Ramaswami and P. E. Wirth (AT&T, USA) (1997), pp. 1315–1326.
W. Feller, An Introduction to Probability Theory and Its Applications, Vol. II, 2nd Edition, Wiley, New York (1970).
A. Girard, Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley, Reading, Massachusetts (1990).
A. Harel, “Convexity properties of the Erlang loss formula,” Oper. Res., 38, No. 3, 499–505 (1990).
D. L. Jagerman, “Some properties of the Erlang loss function,” Bell Syst. Tech. J., 53, No. 3, 525–551 (1974).
D. L. Jagerman, “Methods in traffic calculations,” Bell Syst. Tech. J., 63, No. 7, 1283–1310 (1984).
A. A. Jagers and E. A. Doorn, “On the continued Erlang loss function,” Oper. Res. Lett., 5, No. 1, 43–46 (1986).
A. A. Jagers and E. A. Doorn, “Convexity of functions which are generalizations of the Erlang loss function and the Erlang delay function,” SIAM Rev., 33, No. 2, 281–283 (1991).
A. Jensen, “Moe’s principle — An econometric investigation intended as an aid in dimensioning and managing telephone plant,” Theory and Tables, Copenhagen (1950).
K. R. Krishnan, “The convexity of loss rate in an Erlang loss system and sojourn in an Erlang delay system with respect to arrival and service rates,” IEEE Trans. Commun., 38, No. 9, 1314–1316 (1990).
E. J. Messerli, “Proof of a convexity property of the Erlang-B formula,” Bell Syst. Tech. J., 51, 951–953 (1972).
C. Palm, “Intensitätsschwankungen im Fernsprechverkehr,” Ph.D. Dissertation, Ericsson Technics, 44 (1943) [English Translation by C. Jacobaeus Intensity Variations in Telephone Traffic, North-Holland Studies in Telecommunication, Elsevier Science Publishing Company, Inc. Amsterdam, The Netherlands (1988).]
Y. Rapp, “Planning of Junction network in a multi-exchange area. Pt. 1,” Ericsson Technics, 20, 77–130 (1964).
M. Reiman, “Some allocation problems for critically loaded loss systems with independent links,” Perform. Eval., 13, 17–25 (1991).
L. R. Shenton and A. W. Kemp, “An S-fraction and ln2(1 + x),” J. Comput. Appl. Math., 25, 121–124 (1989).
R. Sysky, Congestion Theory in Telephone Systems, Oliver and Boyd, Edinburgh (1960).
R. W. Wolff and C. Wang, “On the convexity of loss probabilities,” J. App. Probab., 39, 402–406 (2002).
R. I. Wilkinson, “Theories for Toll traffic engineering in the U.S.A.,” Bell Syst. Tech. J., 35, 421–514 (1956).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 63, Optimal Control, 2009.
Rights and permissions
About this article
Cite this article
Cardoso, D.M., Craveirinha, J. & Esteves, J.S. Second-order conditions on the overflow traffic function from the Erlang-B system: a unified analysis. J Math Sci 161, 839–853 (2009). https://doi.org/10.1007/s10958-009-9605-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9605-x