Estimating the reliability bounds of communication system by using sum of disjoint product method

Abstract

In this paper, an algorithm is present that uses the sum of disjoint products (SDP) to calculate the reliability bounds of a complex system. The algorithm requires a set of all minimal paths and cuts to compute the bounds of the reliability polynomial. Furthermore, using Boolean algebra to construct a sum-of-products expression. This research aims to create the lower and upper bounds of reliability for a complex communication system (Double-bridge). By minimizing the number of disjointed (mutually exclusive) variables, the method can reduce the computer time required to estimate the probability of the principal events. The communication system is also used to establish the usefulness of the provided algorithm, which is better than the currently used SDP method for big data sets and more specific to understand and implement. Furthermore, simulations and numerical examples have shown that the new technique typically improves Spross bounds, particularly for highly reliable systems.