Upper and lower bounds on mean value of throughput of probabilistic telecommunication network

Upper and lower bounds on the mean value of throughput of a telecommunication network with an unreliable component are developed in this paper. The calculation of the mean value of the throughput over the occurrence probabilities is replaced with over the survival probabilities of the path carrying traffic between two nodes. The upper and the lower bounds could be obtained by analysing the original network without the failure component. The results show that the upper bound is usually more close to the exact value.<>