Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 ---p p p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let β¦ (n n n, m m m) be the class of all graphs wit
Reliable flow with failures in a network
β Scribed by Kishimoto, W.
- Book ID
- 114555667
- Publisher
- IEEE
- Year
- 1997
- Tongue
- English
- Weight
- 683 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0018-9529
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the problem of communication between nodes of a network whose links are subject to arbitrary failures: A failed link may not only stop transmitting messages but may corrupt them in any possible way. We characterize networks allowing communication in spite of at most 1 failures. Also, for
## Abstract In a network subject to arc failures, each chain has a probability of failure. Therefore the maximal flow in the network is a random variable. The problem considered here is that of maximizing the expected flow. An arcβchain formulation of the problem, and an algorithm for computing an
The service unavailability has widely been used as a measure of the reliability of communications networks. However, the previously used service unavailability is a measure of either a specific or an arbitrary user, so it cannot take account of the scale of the users affected by the failure. In this