Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have