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 simple n -dimensional birth-death steady-state traffic model is used to evaluate the blocking probability experienced by n different 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
