Reliability evaluation algorithms for distributed systems
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.Keywords
This publication has 5 references indexed in Scilit:
- Distributed program reliability analysisIEEE Transactions on Software Engineering, 1986
- A New Algorithm for the Reliability Analysis of Multi-Terminal NetworksIEEE Transactions on Reliability, 1981
- Reliability Evaluation in Computer-Communication NetworksIEEE Transactions on Reliability, 1981
- Derivation and use of a survivability criterion for DDP systemsPublished by Association for Computing Machinery (ACM) ,1980
- An Efficient Method for Reliability Evaluation of a General NetworkIEEE Transactions on Reliability, 1978