System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In the single-commodity case, the system capacity of a stochastic-flow network is the maximum flow from the source to the sink. We concentrate on a two-commodity stochastic-flow network (each arc has several possible capacities and may fail) in which each arc has both capacity and cost attributes. Two types of commodities are transmitted through the same network simultaneously and compete for the capacities. The system capacity is defined as a pattern, and a performance index, the probability that the upper bound of the system capacity equals a given pattern under the budget constraint, is proposed to evaluate the system performance. Such a performance index can be computed in terms of the maximal capacity vectors which satisfy both the demand and budget constraints. A simple approach based on minimal cuts is proposed to generate all such maximal capacity vectors.

Original languageEnglish
Pages (from-to)968-976
Number of pages9
JournalApplied Mathematics and Computation
Volume187
Issue number2
DOIs
StatePublished - 15 Apr 2007

Keywords

  • Cost attribute
  • Minimal cuts
  • System capacity
  • System performance
  • Two-commodity stochastic-flow network

Fingerprint Dive into the research topics of 'System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts'. Together they form a unique fingerprint.

Cite this