On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint

From the quality management and decision making view point, reliability and unreliability are important indices to measure the quality level for a stochastic-flow network. In a multicommodity stochastic-flow network with unreliable nodes, the branches and nodes all have several possible capacities and may fail. Different types of the commodity, which are transmitted through the same network simultaneously, compete the capacities of branches and nodes. In this paper we first define the system capacity as a vector for a multicommodity stochastic-flow network with unreliable nodes. Then we design a performance index which is the probability that the upper bound of the system capacity is a given pattern subject to the budget constraint. It can be applied to evaluate the quality level for such a network. A simple approach based on minimal cuts is thus presented to evaluate the performance index.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

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

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

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

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

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

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

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

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

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

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

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