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

• Published in: European journal of operational research Vol. 176; no. 1; pp. 347 - 360
• Main Author: Lin, Yi-Kuei
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 2007; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: ( d, B)-MC; Applied sciences; Budget constraint; Computer networks; Decision theory. Utility theory; Exact sciences and technology; Flows in networks. Combinatorial problems; Multicommodity; Operational research and scientific management; Operational research. Management science; Performance evaluation; Quality control; Reliability; Reliability theory. Replacement problems; Stochastic models; Stochastic-flow networks; Studies; Unreliable nodes; Stochastic-flow networks; Multicommodity; ( d, B)-MC; Reliability; Budget constraint; Unreliable nodes; Branching; Probabilistic approach; Network flow; Multicommodity flow problem; Decision support system; Reliability; Stochastic-flow networks; Multicommodity; Unreliable nodes; Budget constraint; d; Decision making; Minimal cut; Budget; Quality management; B-MC
• DOI: 10.1016/j.ejor.2005.07.015
• ISSN: 0377-2217

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.