Blocking probabilities in large circuit-switched networks

This paper is concerned with blocking and loss probabilities in circuit-switched networks. We show that when the capacity of links and the offered traffic are increased together, a limiting regime emerges in which loss probabilities are as if links block independently, with blocking probabilities given by the solution of a simple convex programming problem. We then show that an approximate procedure, based on solving Erlang&s formula under the assumption of independent blocking, produces a unique solution when routes are fixed, and that under the limiting regime the estimates of loss probabilities obtained from the procedure converge to the correct values.

[1]  L. M. M.-T. Theory of Probability , 1929, Nature.

[2]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[3]  Arne Jensen,et al.  The life and works of A. K. Erlang , 1960 .

[4]  P. Whittle Equilibrium distributions for an open migration process , 1968, Journal of Applied Probability.

[5]  J. M. Holtzman,et al.  Analysis of dependence effects in telephone trunking networks , 1971 .

[6]  S. Haberman,et al.  The analysis of frequency data , 1974 .

[7]  P. Whittle,et al.  Optimization under Constraints , 1975 .

[8]  P. Lin,et al.  Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..

[9]  Boris G. Pittel,et al.  Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis , 1979, Math. Oper. Res..

[10]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[11]  J. McKenna,et al.  Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage , 1982, The Bell System Technical Journal.

[13]  A. Girard,et al.  End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special Cases , 1983, IEEE Trans. Commun..

[14]  Isi Mitrani,et al.  Fixed-Point Approximations for Distributed Systems , 1983, Computer Performance and Reliability.

[15]  S. Hurtubise,et al.  Dynamic Routing and Call Repacking in Circuit-Switched Networks , 1983, IEEE Trans. Commun..

[16]  Stephen S. Lavenberg,et al.  A Perspective on Iterative Methods for the Approximate Analysis of Closed Queueing Networks , 1983, Computer Performance and Reliability.

[17]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[18]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[19]  N. L. Lawrie,et al.  Mathematical Computer Performance and Reliability , 1984 .

[20]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[21]  D. König,et al.  Queueing Networks: A Survey of Their Random Processes , 1985 .