|
Avtomatika i Telemekhanika, 2011, Issue 7, Pages 69–74
(Mi at2245)
|
|
|
|
This article is cited in 17 scientific papers (total in 17 papers)
System Analysis and Operations Research
Computing diameter constrained reliability of a network with junction points
D. A. Migov Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
We consider a network with unreliable communication channels and perfectly reliable nodes. The diameter constrained reliability for such a network is defined as the probability that between each pair of nodes, there exists a path consisting of operational edges whose number is upper bounded by a given integer. The problem of computing this characteristic is NP-hard, just like the problem of computing the probability of a network's connectivity. We propose a formula that lets one use junction points to compute the reliability of a two-pole system with diameter constraints, which makes the computations faster.
Citation:
D. A. Migov, “Computing diameter constrained reliability of a network with junction points”, Avtomat. i Telemekh., 2011, no. 7, 69–74; Autom. Remote Control, 72:7 (2011), 1415–1419
Linking options:
https://www.mathnet.ru/eng/at2245 https://www.mathnet.ru/eng/at/y2011/i7/p69
|
|