### 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 - Jan 1 1986 |

Externally published | Yes |

### Publication series

Name | Proceedings - 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

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