An implementation of the Buzacott algorithm for network global-reliability

Author

Monticone, Leone C.

Author_Institution

The MITRE Corp., McLean, VA, USA

Volume

42

Issue

1

fYear

1993

fDate

3/1/1993 12:00:00 AM

Firstpage

46

Lastpage

49

Abstract

This study presents an implementation of the Buzacott algorithm (1980), and is based on a sequence-generating algorithm that lends itself to a simple computational procedure to locate probability values at any computation. A comparison made with the polychain algorithm on various network-sizes shows that polychain outperformed the algorithm presented by J.A. Buzacott (1980) by several orders of magnitude on sparse networks. The Buzacott algorithm outperformed polychain on fully connected and on dense, but less than fully connected, networks. A complexity model of the implementation is given

Keywords

combinatorial mathematics; computational complexity; probability; reliability theory; Buzacott algorithm; combinatorics; complexity model; dense networks; fully connected networks; network global-reliability; polychain algorithm; probability values; sequence-generating algorithm; sparse networks; Combinatorial mathematics; Computer networks; Iterative algorithms; Parallel processing; Reliability theory; Telecommunication network reliability;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.210270

Filename

210270