EFFICIENT COMPUTATION OF MARGINAL RELIABILITY IMPORTANCE IN A NETWORK SYSTEM WITH K-TERMINAL RELIABILITY

摘要

Marginal reliability importance is an appropriate quantitative measure on a system component against system reliability and it contributes to design of reliable systems. Computing marginal reliability importance in network systems is time-consuming due to its NP-hardness. This paper proposes a procedure to compute the importance efficiently where k-terminal reliability is employed as network reliability. The procedure is based on some relational formulas with respect to marginal reliability importance between original networks and transformed networks. The formulas improve the computational complexity of the procedure compared to a traditional method.