Varied capacity weights in a two-commodity multistate flow network

Yi-Kuei Lin, Chin Yu Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

With varied capacity weights, this paper extends the performance evaluation problem to a two-commodity multistate flow network composed of multistate edges and nodes. Both types of commodity consume the capacities of edges and nodes differently. The maximal total flow is not suitable to be treated as the system capacity in two-commodity case. Hence, the system capacity is defined as a 2-tuple vector and then a performance index, the probability that the upper bound of the system capacity is a given pattern, is proposed. Such a performance index can be easily computed in terms of upper boundary vectors. An efficient algorithm in terms of minimal cuts is thus presented to generate all upper boundary vectors.

Original languageEnglish
Title of host publicationProceedings - 13th ISSAT International Conference on Reliability and Quality in Design
Pages250-254
Number of pages5
StatePublished - 1 Dec 2007
Event13th ISSAT International Conference on Reliability and Quality in Design - Seattle, WA, United States
Duration: 2 Aug 20074 Aug 2007

Publication series

NameProceedings - 13th ISSAT International Conference on Reliability and Quality in Design

Conference

Conference13th ISSAT International Conference on Reliability and Quality in Design
CountryUnited States
CitySeattle, WA
Period2/08/074/08/07

Keywords

  • Capacity weight
  • Minimal cut
  • Reliability
  • System capacity
  • Two-commodity
  • Unreliable nodes

Cite this