Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints

System reliability evaluation for flow networks is an important issue in quality management. This paper concentrates on a stochastic-flow network in which nodes as well as branches have several possible capacities, and can fail. The possibility is evaluated that a given amount of messages can be transmitted through the stochastic-flow network under the budget constraint. Such a possibility, system reliability, is a performance index for a stochastic-flow network. A minimal path, an order sequence of nodes & branches from the source to the sink without cycles, is used to assign the flow to each component (branch or node). A lower boundary point for (d, C) is a minimal capacity vector, which enables the system to transmit d messages under the budget C. Based on minimal paths, an efficient algorithm is proposed to generate all lower boundary points for (d, C). The system reliability can then be calculated in terms of all lower boundary points for (d, C) by applying the inclusion-exclusion rule. Simulation shows that the implicit enumeration (step 1) of the proposed algorithm can be executed efficiently.

[1]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[2]  Yi-Kuei Lin,et al.  Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[3]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

[6]  K.K. Aggarwal,et al.  Capacity Consideration in Reliability Analysis of Communication Systems , 1982, IEEE Transactions on Reliability.

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

[8]  B. Yum,et al.  Determination of minimal upper paths for reliability analysis of planar flow networks , 1993 .

[9]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

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

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

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

[13]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[14]  W. Griffith.  MULTISTATE RELIABILITY MODELS , 1980 .

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

[16]  W. J. Rueger.  Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes , 1986, IEEE Transactions on Reliability.

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

[18]  Yi-Kuei Lin,et al.  ON RELIABILITY EVALUATION OF A STOCHASTIC-FLOW NETWORK IN TERMS OF MINIMAL CUTS , 2001 .

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

[20]  Suresh Rai,et al.  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks , 1991, IEEE Trans. Parallel Distributed Syst..