Abstract
Calls arrive at a switch, where they are assigned to any one of the available idle outgoing links. A call is blocked if all the links are busy. A call assigned to an idle link may be immediately lost with a probability which depends on the link. For exponential holding times and an arbitrary arrival process we show that the conditional distribution of the time to reach the blocked state from any state, given the sequence of arrivals, is independent of the policy used to route the calls. Thus the law of overflow traffic is independent of the assignment policy. An explicit formula for the stationary probability that an arriving call sees the node blocked is given for Poisson arrivals. We also give a simple asymptotic formula in this case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V.E. Benes, Transition probabilities for telephone traffic, Bell System Technical Journal 38 (1959) 211–258.
B. Gopinath, J.M. Garcia and P. Varaiya, Blocking probability in a switching center with arbitrary routing policy, AT & T Bell Laboratories Technical Journal 63, No. 5 (May–June 1984) 709–720.
A.Y. Khintchine,Mathematical methods in the theory of Queueing (Griffin, London, 1960).
L. Sirovich,Techniques of Asymptotic Analysis (Springer-Verlag, 1971).
L. Takacs,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).
Author information
Authors and Affiliations
Additional information
Work on this paper was done while the author was at Bellcore and at Berkeley.
Rights and permissions
About this article
Cite this article
Anantharam, V., Gopinath, B. & Hajela, D. A generalization of the Erlang formula of traffic engineering. Queueing Syst 3, 277–288 (1988). https://doi.org/10.1007/BF01161219
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01161219