Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Distributed Algorithms
Bus Architectures for Safety-Critical Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Quantifying the Reliability of Proven SPIDER Group Membership Service Guarantees
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Maintenance-Oriented Fault Model for the DECOS Integrated Diagnostic Architecture
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Design Time Reliability Analysis of Distributed Fault Tolerance Algorithms
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Computer Standards & Interfaces
| Hi-index | 0.00 |
We present a reliability evaluation of a group membership protocol (GMP), by computing the probability of violating the fault assumptions made in its proof. The evaluation of the reliability of a GMP is of paramount importance because group membership services are often used as building blocks in the design of fault-tolerant applications. The GMP that we consider here has been proposed for dual scheduled TDMA networks such as FlexRay, a protocol that is likely to become the de-facto standard for next generation automotive networks. Our study is carried out by modeling the GMP with discrete-time Markov chains. The models consider different fault scenarios, including permanent, transient and common-mode faults, affecting both channels and nodes. Furthermore we perform a sensitivity analysis to assess the influence of different parameters on the protocol's reliability. The results show that the GMP can achieve reliability levels in the range required for safety critical applications.