A simple universal generating function method for estimating the reliability of general multi-state node networks

Many real-world systems (such as cellular telephones, transportation, etc.) are Multi-state Node Networks (MNNs) that are composed of multi-state nodes with different states determined by a set of nodes receiving the signal directly from these nodes without satisfying the conservation law. Current methods for evaluating MNN reliability are all derived from Universal Generating Function Methods (UGFMs). Unfortunately, UGFMs are only effective for special MNNs without any cycle, i.e. acyclic MNNs. A very simple revised UGFM is developed for the general MNN reliability problem. The proposed UGFM allows cycles with the same time complexity as the best-known UGFM. The correctness and computational complexity of the proposed UGFM are analyzed and proven. One example is given to illustrate how MNN reliability is evaluated using the proposed UGFM.

[1]  Wei-Chang Yeh.  An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm , 2003, Reliab. Eng. Syst. Saf..

[2]  Wei-Chang Yeh.  An improved Monte-Carlo method for estimating the continuous-state network one-to-one reliability , 2007 .

[3]  J. M. Nahman.  Enumeration of minimal cuts of modified networks , 1994 .

[4]  Wei-Chang Yeh.  A simple algorithm to search for all MCs in networks , 2006, Eur. J. Oper. Res..

[5]  Joanne Bechta Dugan,et al.  A continuous-time Bayesian network reliability modeling, and analysis framework , 2006, IEEE Transactions on Reliability.

[6]  Enrico Zio,et al.  Solving advanced network reliability problems by means of cellular automata and Monte Carlo sampling , 2005, Reliab. Eng. Syst. Saf..

[7]  W.-C. Yeh.  A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance , 2005, J. Oper. Res. Soc..

[8]  Yi-Kuei Lin.  Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts , 2006, Reliab. Eng. Syst. Saf..

[9]  Suresh Rai,et al.  An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities , 2005, IEEE Transactions on Reliability.

[10]  Gregory Levitin,et al.  Multi-State System Reliability - Assessment, Optimization and Applications , 2003, Series on Quality, Reliability and Engineering Statistics.

[11]  Gregory Levitin,et al.  Reliability evaluation for acyclic consecutively connected networks with multistate elements , 2001, Reliab. Eng. Syst. Saf..

[12]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .

[13]  Wei-Chang Yeh.  Multistate-node acyclic networks reliability evaluation based on MC , 2003, Reliab. Eng. Syst. Saf..

[14]  Dan Keun Sung,et al.  A spare bandwidth sharing scheme based on network reliability , 2005, IEEE Transactions on Reliability.

[15]  Gregory Levitin,et al.  The Universal Generating Function in Reliability Analysis and Optimization , 2005 .

[16]  Luca Podofillini,et al.  Optimal design of reliable network systems in presence of uncertainty , 2005, IEEE Transactions on Reliability.

[17]  Jacek Malinowski,et al.  Reliability evaluation for tree-structured systems with multistate components , 1996 .

[18]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[19]  Wei-Chang Yeh.  The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method , 2006, Reliab. Eng. Syst. Saf..

[20]  Yi-Kuei Lin,et al.  An algorithm to evaluate the system reliability for multicommodity case under cost constraint , 2004 .

[21]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .