The Distributed Program Reliability Analysis on Ring-Type Topologies

Abstract

Distributed Computing System (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed Program Reliability (DPR) is addressed to obtain this reliability measure. In this paper, We propose a polynomial-time algorithm for computing the DPR of ring topologies and show that solving the DPR problem on a ring of trees topology is NP-hard.