Reliability measures and their approximate evaluations for networks and distributed systems

C. S. Raghavendra, S. Hariri

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

Abstract

Approximate evaluations of various reliability measures for computer networks and distributed systems are derived using a uniform approach that finds set path-strings for the favorable events of interest. The path-strings are processed by a reliability evaluation algorithm based on paths and cutsets. During each iteration of the algorithm, lower bounds and upper bounds are computed. Using the improved symbolic reliability algorithm (ISYREL), the first k paths in the kth iteration are used to compute the reliability measure of interest. An advantage of this approach is that the result of k th iteration provides a lower bound from which an upper bound can be calculated, consuming only one additional path in each iteration. This process can be stopped when enough accuracy has been obtained or when enough computation power has been invested.

Original languageEnglish (US)
Title of host publicationGLOBECOM '90
PublisherPubl by IEEE
Pages669-673
Number of pages5
ISBN (Print)0879426322
StatePublished - Dec 1 1990
Externally publishedYes
EventIEEE Global Telecommunications Conference & Exhibition Part 3 (of 3) - San Diego, CA, USA
Duration: Dec 2 1990Dec 5 1990

Publication series

NameIEEE Global Telecommunications Conference and Exhibition
Volume2

Other

OtherIEEE Global Telecommunications Conference & Exhibition Part 3 (of 3)
CitySan Diego, CA, USA
Period12/2/9012/5/90

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Reliability measures and their approximate evaluations for networks and distributed systems'. Together they form a unique fingerprint.

Cite this