Bounding all‐terminal reliability in computer networks

Charles Colbourn, Daryl D. Harms

Research output: Contribution to journalArticle

27 Scopus citations

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

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Bounding all‐terminal reliability in computer networks'. Together they form a unique fingerprint.

  • Cite this