ON RELIABILITY EVALUATION OF A STOCHASTIC-FLOW NETWORK IN TERMS OF MINIMAL CUTS

Abstract

ABSTRACT In a stochastic-flow network, each arc has several capacity levels. Given the system demand d, the reliability of such a network for demand d (i.e., the probability that the maximum flow is not less than d) can be computed in terms of d-MCs. Jane, Lin and Yuan have presented an algorithm to generate all d-MCs in terms of minimal cuts. This article proposes another algorithm, which is based on the more publicly accepted “comparison” method, to evaluate the reliability. To compare such two algorithms, one example is illustrated to show how d-MCs are generated differently. Also, the computational complexity is analyzed.