This paper presents a simple recursive formula for calculating source-to-sink congestion, and hence reliability, in a network. This congestion is derived from individual blocking probabilities of each link. The method has an advantage of not requiring cut-sets. Such a knowledge is a prerequisite in most other methods of reliability analysis. We have programmed the algorithm using Pascal as it allows recursive procedure calls. An example illustrates the method.
No takes yet. Share an insight, caveat, or question.
Rai et al. (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: