×

zbMATH — the first resource for mathematics

Guaranteed capacity of a two-pole network with unreliable elements: Probability computation. (English. Russian original) Zbl 0927.90022
Autom. Remote Control 57, No. 3, Pt. 2, 432-450 (1996); translation from Avtom. Telemekh. 1996, No. 3, 161-185 (1996).
Summary: An analytical method is developed for exactly and approximately computing the probability that a two-pole network of arbitrary structure with unreliable elements has the desired capacity. The method generates two sided probability estimates monotonically converging to an exact value, The method is based on an algorithm for forming the so-called aggregate simple paths. Local and global absorption effects which reduce computation time are described. The method is also helpful in determining the maximal flow in a network. Computation examples are given to illustrate the application of the method.

MSC:
90B25 Reliability, availability, maintenance, inspection in operations research
90B10 Deterministic network models in operations research
PDF BibTeX XML Cite