Bounds on the Reliability of Distributed. Systems With Unreliable Nodes & Links.

This article studies the reliability bounds of arbitrary graphs under the NEF model. It finds good upper bound & lower bound expressions, and efficient algorithms for bounding the reliability R(G). These expressions are simple & easy to understand. The algorithms are highly accurate. In fact, this article demonstrates that the difference between the upper bounds & lower bounds gradually leads to zero. As an example application, we apply the bounding algorithms to the dependable distributed system which we developed for secure internet applications. The article used these algorithms to find the best-suitable subgraphs to host critical tasks.