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

The Wheatstone Bridge Reduction in Network Reliability Computations

โœ Scribed by Johnson, Rubin

Book ID
117934884
Publisher
IEEE
Year
1983
Tongue
English
Weight
888 KB
Volume
R-32
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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