System Reliability of a Limited-Flow Network in Multicommodity Case

Network analysis is an important approach to model real-world systems. System reliability, and system unreliability are two related performance indices useful to measure the quality level of a supply-demand system. For a binary-state network without flow, the system unreliability is the probability that the system can not connect the source and the sink. Extending to a limited-flow network in the single-commodity case, the arc capacity is stochastic, and the system capacity (i.e. the maximum flow) is not a fixed number. The system unreliability for (d+1), the probability that the upper bound of the system capacity equals d, can be computed in terms of upper boundary points. An upper boundary point is the maximal system state such that the system fulfills the demand. This paper concentrates on a multicommodity limited-flow network (MLFN) in which multicommodity are transmitted through unreliable nodes and arcs. Nevertheless, the system capacity is not suitable to be treated as the maximal sum of the commodity because each commodity consumes the capacity differently. We define the system capacity as a demand vector if the system fulfills at most such a demand vector. The main problem of this paper is to measure the quality level of a MLFN. We propose a new performance index, the probability that the upper bound of the system capacity equals the demand vector subject to the budget constraint, to evaluate the quality level of a MLFN. A branch-and-bound algorithm based on minimal cuts is presented to generate all upper boundary points in order to compute the performance index. The computational complexity of the proposed algorithm is analyzed

[1]  Wei-Chang Yeh.  Multistate network reliability evaluation under the maintenance cost constraint , 2004 .

[2]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[3]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

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

[5]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[6]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[7]  Wei-Chang Yeh.  A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..

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

[9]  Nasser Fard,et al.  Cutset enumeration of network systems with link and node failures , 1999 .

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

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

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

[13]  Yi-Kuei Lin,et al.  ON THE MULTICOMMODITY RELIABILITY FOR A STOCHASTIC- FLOW NETWORK WITH NODE FAILURE UNDER BUDGET CONSTRAINT , 2003 .

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

[15]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[16]  Wei-Chang Yeh.  A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

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

[18]  John J. Jarvis.  On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem , 1969 .

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

[20]  Yi-Kuei Lin,et al.  Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..

[21]  Jsen-Shung Lin,et al.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

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

[23]  Yi-Kuei Lin,et al.  Study on the multicommodity reliability of a capacitated-flow network☆ , 2001 .

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

[25]  B. Rothschild,et al.  On Two Commodity Network Flows , 1966, Oper. Res..

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

[27]  Weiwe-Chang Yeh.  A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes , 2004, Reliab. Eng. Syst. Saf..

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

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

[30]  Yi-Kuei Lin.  Reliability evaluation for a multi‐commodity flow model under budget constraint , 2002 .

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

[32]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .