Bounding all‐terminal reliability in computer networks

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1988 English Publisher:WileyJournal:Networks, volume 18, pages 1-12 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: Charles J. Colbourn; Daryl D. Harms;

doi: 10.1002/net.3230180102

Bounding all‐terminal reliability in computer networks

- Summary
- Metrics

Abstract

AbstractMany 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.

Related Organizations

University of Saskatchewan
Canada
University of Waterloo
Canada

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	30
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%