### 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 language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM |

Publisher | IEEE |

Pages | 293-302 |

Number of pages | 10 |

ISBN (Print) | 0818606940 |

State | Published - 1986 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(pp. 293-302). IEEE.

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - IEEE INFOCOM.*IEEE, pp. 293-302.

}

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 -