Most reliable double loop networks in survival reliability

X. D. Hu, F. K. Hwang, Wen-ching Winnie Li

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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/2]) is the most reliable connected double loop network except when n = 3 and 9, in which case G(1, 2) is the most reliable. © 1993 by John Wiley & Sons, Inc.

Original languageEnglish (US)
Pages (from-to)451-458
Number of pages8
JournalNetworks
Volume23
Issue number5
DOIs
StatePublished - Jan 1 1993

Fingerprint

Reliability analysis

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Hu, X. D. ; Hwang, F. K. ; Li, Wen-ching Winnie. / Most reliable double loop networks in survival reliability. In: Networks. 1993 ; Vol. 23, No. 5. pp. 451-458.
@article{6756ef725c2e4abe9644bba1b2109501,
title = "Most reliable double loop networks in survival reliability",
abstract = "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/2]) is the most reliable connected double loop network except when n = 3 and 9, in which case G(1, 2) is the most reliable. {\circledC} 1993 by John Wiley & Sons, Inc.",
author = "Hu, {X. D.} and Hwang, {F. K.} and Li, {Wen-ching Winnie}",
year = "1993",
month = "1",
day = "1",
doi = "10.1002/net.3230230502",
language = "English (US)",
volume = "23",
pages = "451--458",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "5",

}

Most reliable double loop networks in survival reliability. / Hu, X. D.; Hwang, F. K.; Li, Wen-ching Winnie.

In: Networks, Vol. 23, No. 5, 01.01.1993, p. 451-458.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Most reliable double loop networks in survival reliability

AU - Hu, X. D.

AU - Hwang, F. K.

AU - Li, Wen-ching Winnie

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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/2]) is the most reliable connected double loop network except when n = 3 and 9, in which case G(1, 2) is the most reliable. © 1993 by John Wiley & Sons, Inc.

AB - 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/2]) is the most reliable connected double loop network except when n = 3 and 9, in which case G(1, 2) is the most reliable. © 1993 by John Wiley & Sons, Inc.

UR - http://www.scopus.com/inward/record.url?scp=84983648364&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983648364&partnerID=8YFLogxK

U2 - 10.1002/net.3230230502

DO - 10.1002/net.3230230502

M3 - Article

VL - 23

SP - 451

EP - 458

JO - Networks

JF - Networks

SN - 0028-3045

IS - 5

ER -