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

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 (d^1, d^2,…,d(superscript p);C) where d(superscript i) is the demand of commodity i and C is the budget. The multicommodity reliability can then be calculated in terms of such points.