The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1987 vol.36)
pp: 1224-1232
S. Hariri , Department of Computer Science, Damascus University
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 conditibnal 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.
INDEX TERMS
terminal reliability, Conditional probability, cutsets, path enumeration, reliability evaluation. tool
CITATION
S. Hariri, C.S. Raghavendra, "SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods", IEEE Transactions on Computers, vol.36, no. 10, pp. 1224-1232, October 1987, doi:10.1109/TC.1987.1676862
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool