IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS.

Timothy B. Brecht, Charles Colbourn

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

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 when k specified nodes are to communicate (k-terminal reliability); the latter case includes the first two. Each of these reliability measures is NP-hard to compute, and thus efficiently computable reliability bounds are of interest. To date, the all-terminal and 2-terminal cases have been treated separately, and few results apply to the k-terminal case. We develop a simple strategy to obtain k-terminal reliability bounds. We demonstrate improvements on the previous best bounds for all-terminal, k-terminal, and 2-terminal reliability. Computational experience with these new bounds is reported, by comparing the new lower bounds to existing lower bounds.

Original languageEnglish (US)
Pages (from-to)369-380
Number of pages12
JournalNetworks
Volume16
Issue number4
StatePublished - Dec 1986
Externally publishedYes

Fingerprint

Computer networks

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS. / Brecht, Timothy B.; Colbourn, Charles.

In: Networks, Vol. 16, No. 4, 12.1986, p. 369-380.

Research output: Contribution to journalArticle

Brecht, TB & Colbourn, C 1986, 'IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS.', Networks, vol. 16, no. 4, pp. 369-380.
Brecht, Timothy B. ; Colbourn, Charles. / IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS. In: Networks. 1986 ; Vol. 16, No. 4. pp. 369-380.
@article{7c53966eb189453cad8127ed1883f611,
title = "IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS.",
abstract = "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 when k specified nodes are to communicate (k-terminal reliability); the latter case includes the first two. Each of these reliability measures is NP-hard to compute, and thus efficiently computable reliability bounds are of interest. To date, the all-terminal and 2-terminal cases have been treated separately, and few results apply to the k-terminal case. We develop a simple strategy to obtain k-terminal reliability bounds. We demonstrate improvements on the previous best bounds for all-terminal, k-terminal, and 2-terminal reliability. Computational experience with these new bounds is reported, by comparing the new lower bounds to existing lower bounds.",
author = "Brecht, {Timothy B.} and Charles Colbourn",
year = "1986",
month = "12",
language = "English (US)",
volume = "16",
pages = "369--380",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - IMPROVING RELIABILITY BOUNDS IN COMPUTER NETWORKS.

AU - Brecht, Timothy B.

AU - Colbourn, Charles

PY - 1986/12

Y1 - 1986/12

N2 - 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 when k specified nodes are to communicate (k-terminal reliability); the latter case includes the first two. Each of these reliability measures is NP-hard to compute, and thus efficiently computable reliability bounds are of interest. To date, the all-terminal and 2-terminal cases have been treated separately, and few results apply to the k-terminal case. We develop a simple strategy to obtain k-terminal reliability bounds. We demonstrate improvements on the previous best bounds for all-terminal, k-terminal, and 2-terminal reliability. Computational experience with these new bounds is reported, by comparing the new lower bounds to existing lower bounds.

AB - 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 when k specified nodes are to communicate (k-terminal reliability); the latter case includes the first two. Each of these reliability measures is NP-hard to compute, and thus efficiently computable reliability bounds are of interest. To date, the all-terminal and 2-terminal cases have been treated separately, and few results apply to the k-terminal case. We develop a simple strategy to obtain k-terminal reliability bounds. We demonstrate improvements on the previous best bounds for all-terminal, k-terminal, and 2-terminal reliability. Computational experience with these new bounds is reported, by comparing the new lower bounds to existing lower bounds.

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

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

M3 - Article

AN - SCOPUS:0022946035

VL - 16

SP - 369

EP - 380

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -