Evaluating the reliability of a novel deterioration-effect multi-state flow network

Abstract In a traditional multi-state flow network (MFN), the flow values into and out of any arc are assumed to be equal. In practical application, however, the flow may undergo a loss due to deterioration. For example, electrical power will decrease if the transmission distance is too great. Hence, a novel MFN model called the deterioration-effect MFN (MFN de ) is proposed to address this real world problem. A straightforward and simple algorithm based on a novel concept called the deterioration-effect d -minimal path ( d -MP de ) is presented to evaluate the reliability of an MFN de , which is defined as the probability that at least d units of data can be received by the sink node through the MFN de . The computational complexity of the proposed algorithm is also analyzed. Finally, an example is presented to illustrate how the reliability of an MFN de is calculated using the proposed algorithm.

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

[2]  Gregory Levitin,et al.  Reliability of multi-state systems with common bus performance sharing , 2011 .

[3]  Wei-Chang Yeh,et al.  A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network , 2011, IEEE Transactions on Reliability.

[4]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[5]  Wei-Chang Yeh,et al.  A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .

[6]  Kailash C. Kapur,et al.  Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..

[7]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[10]  Marvin Rausand,et al.  System Reliability Theory: Models, Statistical Methods, and Applications , 2003 .

[11]  Yi-Kuei Lin,et al.  On performance evaluation for a multistate network under spare routing , 2012, Inf. Sci..

[12]  Wei-Chang Yeh.  Search for all MCs in networks with unreliable nodes and arcs , 2003, Reliab. Eng. Syst. Saf..

[13]  S.H. Lee,et al.  Reliability Evaluation of a Flow Network , 1980, IEEE Transactions on Reliability.

[14]  Wei-Chang Yeh,et al.  A Novel Label Universal Generating Function Method for Evaluating the One-to-all-Subsets General Multistate Information Network Reliability , 2011, IEEE Transactions on Reliability.

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

[16]  Wei-Chang Yeh,et al.  A Greedy Branch-and-Bound Inclusion-Exclusion Algorithm for Calculating the Exact Multi-State Network Reliability , 2008, IEEE Transactions on Reliability.

[17]  Wei-Chang Yeh.  An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths , 2007, Reliab. Eng. Syst. Saf..

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

[19]  Wei-Chang Yeh.  Search for all d-Mincuts of a limited-flow network , 2002, Comput. Oper. Res..

[20]  Yi-Kuei Lin,et al.  A method to evaluate routing policy through p minimal paths for stochastic case , 2010, Inf. Sci..

[21]  Wei-Chang Yeh.  A Simple Method to Verify All d-Minimal Path Candidates of a Limited-Flow Network and its Reliability , 2002 .

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

[23]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[24]  Xue Janan,et al.  New approach for multistate systems analysis , 1985 .

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

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

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

[28]  Yi-Kuei Lin,et al.  Computer network reliability optimization under double-resource assignments subject to a transmission budget , 2011, Inf. Sci..