Performance index of a stochastic-flow network with node failure under the budget constraint

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

This paper deals with a stochastic-flow network in which each node and arc has a designated capacity, which will have different lower levels due to various partial and complete failures. We try to evaluate the probability that the maximum flow of the network is equal to the demand d without exceeding the budget B. Such a probability is treated as a performance index to measure the quality level of the network. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, B), and then the probability that the maximal flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, B) is a maximal vector, which represents the capacity of each component (arc or node), such that the maximum flow of the network under the budget B is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary points for (d-1, B). A computer simulation example is shown to illustrate the solution procedure.

Original languageEnglish
Pages (from-to)1209-1216
Number of pages8
JournalInternational Journal of Advanced Manufacturing Technology
Volume31
Issue number11-12
DOIs
StatePublished - 1 Feb 2007

Keywords

  • Budget
  • Minimal cut
  • Node failure
  • Performance index
  • Stochastic-flow network
  • System reliability

Fingerprint Dive into the research topics of 'Performance index of a stochastic-flow network with node failure under the budget constraint'. Together they form a unique fingerprint.

Cite this