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

Salim A Hariri, C. S. Raghavendra

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

5 Citations (Scopus)

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 - 1986
Externally publishedYes

Fingerprint

Boolean algebra
Computer terminals
Complex networks
Computer networks
Set theory

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

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

SYREL : A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS. / Hariri, Salim A; Raghavendra, C. S.

Proceedings - IEEE INFOCOM. IEEE, 1986. p. 293-302.

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

Hariri, SA & Raghavendra, CS 1986, SYREL: A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS. in Proceedings - IEEE INFOCOM. IEEE, pp. 293-302.
Hariri SA, Raghavendra CS. SYREL: A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS. In Proceedings - IEEE INFOCOM. IEEE. 1986. p. 293-302
Hariri, Salim A ; Raghavendra, C. S. / SYREL : A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS. Proceedings - IEEE INFOCOM. IEEE, 1986. pp. 293-302
@inproceedings{c5d7c18b0da7476ca99d4c5a544e029f,
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. 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.",
author = "Hariri, {Salim A} and Raghavendra, {C. S.}",
year = "1986",
language = "English (US)",
isbn = "0818606940",
pages = "293--302",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - SYREL

T2 - A SYMBOLIC RELIABILITY ALGORITHM BASED ON PATH AND CUTSET METHODS.

AU - Hariri, Salim A

AU - Raghavendra, C. S.

PY - 1986

Y1 - 1986

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:0022594531

SN - 0818606940

SP - 293

EP - 302

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -