Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference31 articles.
1. Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
2. Analysis of multicellular mobile radiotelephone systems with loss;Everitt;British Telecom. Technol. J.,1983
3. . De Souza E Silva E. , Lavenberg S. S. and Muntz R. R. (1984) A perspective on iterative methods for the approximate analysis of closed queueing networks. In Iazeolla et al. [17], 225–244.
4. End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special Cases
5. . Kelly F. P. and Ziedins I. (1985) Loss probabilities in circuit-switched star networks. Unpublished.
Cited by
383 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献