Blocking Probabilities for Trunk Reservation Policy
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 35 (3) , 313-318
- https://doi.org/10.1109/TCOM.1987.1096774
Abstract
This paper presents an analysis of the blocking phenomenon in circuit-switched routing policies with alternate routing and trunk reservation. From the usual assumptions on the offered traffic (Poisson) and the service time (exponential distribution), a classical Markov chain model is derived. Some approximate formulas are given to compute the blocking probabilities for first- and second-choice traffic. The accuracy of the proposed estimates is evaluated by direct comparison with already known results in simple cases and with the exact solution of the state equations.Keywords
This publication has 4 references indexed in Scilit:
- Blocking Probability of Noninteger Groups with Trunk ReservationIEEE Transactions on Communications, 1985
- The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical RoutingAT&T Bell Laboratories Technical Journal, 1984
- An Approximate Formula for Individual Call Losses in Overflow SystemsIEEE Transactions on Communications, 1983
- An Analytical Formulation for Grade of Service Determination in Telephone NetworksIEEE Transactions on Communications, 1983