ON THE MULTICOMMODITY RELIABILITY FOR A STOCHASTIC- FLOW NETWORK WITH NODE FAILURE UNDER BUDGET CONSTRAINT

ABSTRACT System reliability evaluation for flow networks is an important issue for quality performance. This paper studies the system reliability that a given amount of multicommodity can be transmitted through a stochastic-flow network under the budget constraint, where each node and each arc has several possible capacities. Such reliability is named multicommodity reliability throughout this paper. A simple algorithm is proposed to generate all lower boundary points for (d1,d2,…,dp;C) where di is the demand of commodity i and C is the budget. The multicommodity reliability can then be calculated in terms of such points.

[1]  John E. Cremeans,et al.  THE MULTICOMMODITY NETWORK FLOW MODEL REVISED TO INCLUDE VEHICLE PER TIME PERIOD AND NODE CONSTRAINTS , 1972 .

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

[3]  James R. Evans.  A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem , 1976, Math. Program..

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

[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]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[7]  J. Kennington.  Solving multicommodity transportation problems using a primal partitioning simplex technique , 1977 .

[8]  Yi-Kuei Lin,et al.  A New Algorithm to Generate d-Minimal Paths in a Multistate Flow Network with Noninteger ARC Capacities , 1998 .

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

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

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

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

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

[14]  John E. Cremeans,et al.  Optimal multicommodity network flows with resource allocation , 1970 .

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

[16]  Nader Ebrahimi,et al.  Multistate reliability models , 1984 .

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

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

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

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

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

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