To find broken links in networks we use the cut-set space. Information on which nodes can talk, or not, to which other nodes allows reduction of the problem to that of decoding the cut-set code of a graph. Special classes of such codes are known to have polynomial-time decoding algorithms. We prese
Improving fault detection and reliability in FDDI networks
โ Scribed by R Radhakrishna Pillai; Anand Hardi; A Selvarajan
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 602 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0140-3664
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
## Abstract One of the most important issues in wireless sensor networks is to develop the technology for improved fault tolerance, since sensor nodes are prone to failure (for mechanical reasons, for example) and have limited energy storage. The strategy for determining the positions in which sens
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