✦ LIBER ✦

Most reliable double loop networks in survival reliability

✍ Scribed by X. D. Hu; F. K. Hwang; Wen-Ch'Ing Winnie Li

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 597 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230502

No coin nor oath required. For personal study only.

✦ Synopsis

Double loop networks have been intensively studied as interconnecting networks. However, the reliability analysis of such networks has hit a snag since the usual measure of reliability, the graph connectivity, is completely powerless as all double loops, if connected, are 2-connected. Recently, Hwang and Li introduced a new analysis by partitioning cutsets into isolated and nonisolated ones and gave results on both types. Along the same line, we extent their results to the survival reliability model by showing that when each node fails independently with a very small probability, G(1, 1 +

[n/21) is the most reliable connected double loop network except when n = 3 and 9, in which case G(1, 2) is the most reliable.

📜 SIMILAR VOLUMES

Exact reliabilities of most reliable dou

Exact reliabilities of most reliable double-loop networks

✍ Hwang, Frank K.; Wright, Paul E.; Hu, X. D. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

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

Reliable broadcasting in double loop net

Reliable broadcasting in double loop networks

✍ Nenad Obradoviç; Joseph Peters; Goran Ružić 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

The most reliable series-parallel networ

The most reliable series-parallel networks

✍ Eric M. Neufeld; Charles J. Colbourn 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB

Uniformly-most reliable networks do not

Uniformly-most reliable networks do not always exist

✍ Wendy Myrvold; Kim H. Cheung; Lavon B. Page; Jo Ellen Perry 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

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

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