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

Bounding all-terminal reliability in computer networks

โœ Scribed by Charles J. Colbourn; Daryl D. Harms

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
645 KB
Volume
18
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improving reliability bounds in computer
Improving reliability bounds in computer networks
โœ Timothy B. Brecht; Charles J. Colbourn ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 538 KB

The probability that a computer network is operational in an environment of statistically independent link failures has been widely studied. Three natural problems arise, when all nodes are to be connected (all-terminal reliability), when two nodes are to communicate (2-terminal reliability), and wh

Multiplicative improvements in network r
Multiplicative improvements in network reliability bounds
โœ Timothy B. Brecht; Charles J. Colbourn ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 482 KB

Multiplicative inequalities for reliability bounds are derived, by observing that certain reliability measures are positively correlated. These inequalities can be used to obtain substantial improvements on available bounds for network reliability. ## 1. BACKGROUND AND MOTIVATION In the network de