Sciweavers

Share
SRDS
2000
IEEE

An Investigation of Membership and Clique Avoidance in TTP/C

9 years 11 months ago
An Investigation of Membership and Clique Avoidance in TTP/C
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 are going to 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.
Günther Bauer, Michael Paulitsch
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where SRDS
Authors Günther Bauer, Michael Paulitsch
Comments (0)
books