Blocking Probability in Two-Way Distributed Circuit-Switched CATV
- 1 October 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 34 (10) , 977-984
- https://doi.org/10.1109/TCOM.1986.1096440
Abstract
The service quality of a circuit-switched network is usually measured in terms of probability of rejecting a call and the delay encountered by the customers in accessing the common resources. In this paper, a simplen-dimensional birth-death steady-state traffic model is used to evaluate the blocking probability experienced byndifferent classes of customers in a two-way interactive distributed community antenna television (CATV) communication system. In the computation of the end-to-end blocking probability, we have assumed that the links between the call's originating node and the destination node are statistically independent. It is assumed, without loss of generality, that the number of channels (servers) is the same for all the links. In addition to the closed-form solution obtained for different cases, a simple recursive formula that simplifies the computational complexity is presented.Keywords
This publication has 6 references indexed in Scilit:
- Distributed Switching for Data Transmission over Two-Way CATVIEEE Journal on Selected Areas in Communications, 1985
- Blocking Probability of Noninteger Groups with Trunk ReservationIEEE Transactions on Communications, 1985
- Blocking in a Shared Resource EnvironmentIEEE Transactions on Communications, 1981
- Three Typical Blocking Aspects of Access Area TeletrafficIEEE Transactions on Communications, 1980
- Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing PlanIEEE Transactions on Communications, 1980
- Theories for Toll Traffic Engineering in the U. S. A.*Bell System Technical Journal, 1956