Bounding all‐terminal reliability in computer networks

Charles Colbourn, Daryl D. Harms

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

Many bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the Ball‐Provan bounds. Computational results on these new bounds are also reported.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
JournalNetworks
Volume18
Issue number1
DOIs
StatePublished - 1988
Externally publishedYes

Fingerprint

Computer networks
Linear programming
Polynomials

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

Bounding all‐terminal reliability in computer networks. / Colbourn, Charles; Harms, Daryl D.

In: Networks, Vol. 18, No. 1, 1988, p. 1-12.

Research output: Contribution to journalArticle

Colbourn, Charles ; Harms, Daryl D. / Bounding all‐terminal reliability in computer networks. In: Networks. 1988 ; Vol. 18, No. 1. pp. 1-12.
@article{1449484ad3894a3b8f852e26b4634f00,
title = "Bounding all‐terminal reliability in computer networks",
abstract = "Many bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the Ball‐Provan bounds. Computational results on these new bounds are also reported.",
author = "Charles Colbourn and Harms, {Daryl D.}",
year = "1988",
doi = "10.1002/net.3230180102",
language = "English (US)",
volume = "18",
pages = "1--12",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Bounding all‐terminal reliability in computer networks

AU - Colbourn, Charles

AU - Harms, Daryl D.

PY - 1988

Y1 - 1988

N2 - Many bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the Ball‐Provan bounds. Computational results on these new bounds are also reported.

AB - Many bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the Ball‐Provan bounds. Computational results on these new bounds are also reported.

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

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

U2 - 10.1002/net.3230180102

DO - 10.1002/net.3230180102

M3 - Article

AN - SCOPUS:84986958670

VL - 18

SP - 1

EP - 12

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -