An investigation of membership and clique avoidance in TTP/C
- 7 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called clique avoidance. The clique avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper, we investigate the properties of this algorithm by analyzing its performance, elaborating the properties and showing how the clique avoidance algorithm interacts with the implicit acknowledgement algorithm of TTP/C.Keywords
This publication has 7 references indexed in Scilit:
- Failure mode assumptions and assumption coveragePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The timed asynchronous distributed system modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Formal Verification of the TTP Group Membership AlgorithmPublished by Springer Science and Business Media LLC ,2000
- Low-overhead time-triggered group membershipPublished by Springer Science and Business Media LLC ,1997
- Synchronous and asynchronousCommunications of the ACM, 1996
- TTP-a protocol for fault-tolerant real-time systemsComputer, 1994
- Dependability: Basic Concepts and TerminologyPublished by Springer Science and Business Media LLC ,1992