Abstract
The reliability of a communication network is formulated in terms of the reliabilities of individual links and stations in the network. This is done by using a linear graph with both vertices and branches being weighted as the probabilistic model. In solving the reliability problem, we adopt the path approach. All possible paths between any two vertices in a linear graph are obtained by simplifying the linear graph.

This publication has 3 references indexed in Scilit: