Approximate reliability of multi-state two-terminal networks by stochastic analysis

Reliability is an important feature in the design and maintenance of a large-scale system. Usually, for a two-terminal network reliability is a measure for the connectivity between the source and sink nodes. Various approaches have been presented to evaluate system reliability; however, they become cumbersome or prohibitive due to the large computational complexity, especially when multiple states are considered for nodes. In this study, a stochastic approach is presented for estimating corresponding reliability. Randomly permuted sequences with fixed numbers of multiple values are generalized from non-Bernoulli binary sequences to model the multi-state property. State probabilities are represented by randomly permuted sequences to improve both computational efficiency and accuracy. Stochastic models are then constructed for arcs and nodes with different capacities. The proposed stochastic analysis is capable of predicting reliability at high accuracy and without a need for constructing the commonly-used but complex multi-state minimal cut vectors. Non-exponential distributions and correlated signals are readily handled by the stochastic approach for a general network. Results obtained through the stochastic analysis are compared with exact values and those found by Monte Carlo simulation. The accuracy, efficiency and scalability of the stochastic approach are assessed by evaluating several case studies.

[1]  Fabrizio Lombardi,et al.  Reliability and Criticality Analysis of Communication Networks by Stochastic Computation , 2016, IEEE Network.

[2]  Terje Aven,et al.  Availability evaluation of oil/gas production and transportation systems , 1987 .

[3]  Ming Jian Zuo,et al.  A Stochastic Approach for the Analysis of Fault Trees With Priority AND Gates , 2014, IEEE Transactions on Reliability.

[4]  David W. Coit,et al.  A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability , 2005, Reliab. Eng. Syst. Saf..

[5]  M. Samad,et al.  An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network , 1987 .

[6]  Roy Billinton,et al.  State extension for adequacy evaluation of composite power systems-applications , 2000 .

[7]  Chin-Chia Jane,et al.  A Practical Algorithm for Computing Multi-State Two-Terminal Reliability , 2008, IEEE Transactions on Reliability.

[8]  Hong-Zhong Huang,et al.  An efficient method for reliability evaluation of multistate networks given all minimal path vectors , 2007 .

[9]  David W. Coit,et al.  Multistate two-terminal reliability: A cut-set approach , 2004 .

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

[11]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[12]  Yi-Kuei Lin,et al.  A stochastic model to study the system capacity for supply chains in terms of minimal cuts , 2010 .

[13]  Sheng-De Wang,et al.  Reliability evaluation for distributed computing networks with imperfect nodes , 1997 .

[14]  David W. Coit,et al.  A heuristic for solving the redundancy allocation problem for multi-state series-parallel systems , 2004, Reliab. Eng. Syst. Saf..

[15]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[16]  Bent Natvig,et al.  Multistate reliability theory—a case study , 1986, Advances in Applied Probability.

[17]  D. Elmakis,et al.  Redundancy optimization for series-parallel multi-state systems , 1998 .

[18]  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..

[19]  Terje Aven,et al.  Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.

[20]  Shuji Tsukiyama,et al.  An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.

[21]  Kailash C. Kapur,et al.  Customer-driven reliability models for multistate coherent systems , 1994 .

[22]  Hamid R. Zarandi,et al.  A Fast and Accurate Fault Tree Analysis Based on Stochastic Logic Implemented on Field-Programmable Gate Arrays , 2013, IEEE Transactions on Reliability.

[23]  Peican Zhu,et al.  Stochastic Multiple-Valued Gene Networks , 2014, IEEE Transactions on Biomedical Circuits and Systems.

[24]  Wei-Chang Yeh,et al.  A new cut-based algorithm for the multi-state flow network reliability problem , 2015, Reliab. Eng. Syst. Saf..

[25]  Hao Chen,et al.  A Stochastic Computational Approach for Accurate and Efficient Reliability Evaluation , 2014, IEEE Transactions on Computers.

[26]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .