๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Overall-terminal reliability of a stochastic capacitated-flow network

โœ Scribed by Yi-Kuei Lin

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
607 KB
Volume
36
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis

For a stochastic and directed capacitated-flow network in which the capacity of each arc has several possible values, this article generalizes the system reliability problem from single source node and single sink node cases to an overall-terminal case. Given the demand for each node pair simultaneously, a simple algorithm is proposed first to generate all lower boundary points for such demands in terms of minimal paths. The lower boundary point is a vector denoting the current capacity of each arc. The system reliability, the probability that the system satisfies the demands simultaneously, can be calculated in terms of such lower boundary points by applying the inclusion-exclusion method.

๐Ÿ“œ SIMILAR VOLUMES

Study on the multicommodity reliability
Study on the multicommodity reliability of a capacitated-flow network
โœ Yi-Kuei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 593 KB

Traditionally, many researchers solved the multicommodity maximum flow problem by assuming that the arcs of the flow network are deterministic. When the arcs are stochastic (i.e., the capacity of each arc has several values), this article studies how to calculate the probability that a capacitated-f

On reliability evaluation of a capacitat
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
โœ Jsen-Shung Lin; Chin-Chia Jane; John Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 648 KB

Many real-world systems such as electric power transmission and distribution systems, transportation systems, and manufacturing systems can be regarded as flow networks whose arcs have independent, finite, and multivalued random capacities. Such a flow network is indeed a multistate system with mult

Reliability evaluation of a revised stoc
Reliability evaluation of a revised stochastic flow network with uncertain minimum time
โœ Yi-Kuei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 437 KB

This paper constructs a revised stochastic flow network to model a realistic computer network in which each arc has a lead time and a stochastic capacity. The minimum time to send a specified amount of data through the network is thus uncertain. Hence, this paper mainly proposes an approach for eval

A network reduction axion for efficient
A network reduction axion for efficient computation of terminal-pair reliability
โœ S.J Hsu; M.C Yuang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 965 KB

Terminal-pair reliability (TR) in network management determines the probabilistic reliability between two nodes (the source and sink) of a network, given failure probabilities of all links. It has been shown that TR can be effectively computed by means of the network reduction technique. Existing re