SYREL: A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS.

S. Hariri, C. S. Raghavendra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. The authors 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 disinct approach in which most of the computations performed are directly executable Boolean operations. The conditional probability is used to avoid applying at each iteration the most time-consuming loop in reliability algorithms (making a set of events mutually exclusive). The algorithm has been implemented on a VAX-11/750 and is efficient compared to existing reliability algorithms.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages293-302
Number of pages10
ISBN (Print)0818606940
StatePublished - Jan 1 1986
Externally publishedYes

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'SYREL: A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS.'. Together they form a unique fingerprint.

  • Cite this

    Hariri, S., & Raghavendra, C. S. (1986). SYREL: A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS. In Proceedings - IEEE INFOCOM (pp. 293-302). (Proceedings - IEEE INFOCOM). IEEE.