SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

Salim Hariri; C. S. Raghavendra

doi:10.1109/TC.1987.1676862

SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

Salim Hariri, C. S. Raghavendra

Research output: Contribution to journal › Article › peer-review

106 Scopus citations

Abstract

Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditidnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.

Original language	English (US)
Pages (from-to)	1224-1232
Number of pages	9
Journal	IEEE Transactions on Computers
Volume	C-36
Issue number	10
DOIs	https://doi.org/10.1109/TC.1987.1676862
State	Published - Oct 1987
Externally published	Yes

Keywords

Conditional probability
cutsets
path enumeration
reliability evaluation tool
terminal reliability

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/TC.1987.1676862

Cite this

@article{c0b34cf532244445a9ba962277798f2e,

title = "SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods",

abstract = "Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditidnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.",

keywords = "Conditional probability, cutsets, path enumeration, reliability evaluation tool, terminal reliability",

author = "Salim Hariri and Raghavendra, {C. S.}",

year = "1987",

month = oct,

doi = "10.1109/TC.1987.1676862",

language = "English (US)",

volume = "C-36",

pages = "1224--1232",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - SYREL

T2 - A Symbolic Reliability Algorithm Based on Path and Cutset Methods

AU - Hariri, Salim

AU - Raghavendra, C. S.

PY - 1987/10

Y1 - 1987/10

N2 - Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditidnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.

AB - Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditidnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.

KW - Conditional probability

KW - cutsets

KW - path enumeration

KW - reliability evaluation tool

KW - terminal reliability

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

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

U2 - 10.1109/TC.1987.1676862

DO - 10.1109/TC.1987.1676862

M3 - Article

AN - SCOPUS:33646098092

SN - 0018-9340

VL - C-36

SP - 1224

EP - 1232

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 10

ER -

SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this