Calculating reliability of the recursively definable networks

The number of arithmetic operations required to determine the network reliability was estimated. Internet-like networks were considered by way of example. For the networks with edges of low and high reliability, the asymptotic formulas were derived. The calculations were based on approximating reliability by the sum of probabilities of operability of all acyclic paths or the sum of probabilities of failure of all network sections that are minimal in set-theoretical inclusion.

Presented by the member of Editorial Board: B. G. Volik