A double-loop network with hop constants h 1 , h 2 , DL(n, h 1 , h 2 ) may be represented as a directed graph with n nodes 0, 1, . . . , n 0 1 and 2n links of the form i r i / h 1 mod n and i r i / h 2 mod n (referred to as h 1 -links and h 2 -links). They have been proposed as architectures for loc
✦ LIBER ✦
Exact calculation of computer network reliability
✍ Scribed by E. Hänsler; G. K. McAuliffe; R. S. Wilkov
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 716 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Exact reliabilities of most reliable dou
✍
Hwang, Frank K.; Wright, Paul E.; Hu, X. D.
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 162 KB
Complexity of network reliability comput
✍
Michael O. Ball
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 614 KB
Transformations for simplifying network
✍
A. Rosenthal; D. Frisque
📂
Article
📅
1977
🏛
John Wiley and Sons
🌐
English
⚖ 536 KB
Improving reliability bounds in computer
✍
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
Bounding all-terminal reliability in com
✍
Charles J. Colbourn; Daryl D. Harms
📂
Article
📅
1988
🏛
John Wiley and Sons
🌐
English
⚖ 645 KB
Triconnected decomposition for computing
✍
R. Kevin Wood
📂
Article
📅
1989
🏛
John Wiley and Sons
🌐
English
⚖ 890 KB