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

Redundant paths and reliability bounds in gamma networks

โœ Scribed by Indra Gunawan

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
209 KB
Volume
32
Category
Article
ISSN
0307-904X

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

Terminal-pair reliability in ATM virtual
Terminal-pair reliability in ATM virtual path networks
โœ Steen J. Hsu; Yu G. Chen; Maria C. Yuang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 610 KB

Terminal-pair reliability (TR) in an asynchronous transfer mode (ATM) virtual path (VP) network corresponds to probabilistic quantification of robustness between two VP terminators, given the VP layout and the failure probabilities of physical links. Existing TR algorithms are shown to be unviable f