1. Ziv Dayan200388130 Tom Afek Kafka200637247 Instructor Ittay Eyal

2.  What is a failure detector?  Our failure detector  Software Implementation  Gossip style  Independent local unit

4.  Communication – by messages  Each message contains a list of heartbeats  Each heartbeat contains  IP of creator  Time since creation  Each node contains its own Local Node: Local Node Net Members Node Neighbors Versions Neighbor Version

6. Repeat periodically:  Choose the node whose threshold is closest to expiration  Wait until the threshold has expired  Check the local time of creation of the last heartbeat received by the suspected node:  If changed – the node is OK  Else – the suspected node had crashed

7. Computer Listener Main Message Handler Message Sender Sender Detector

8.  A new abstract class is added – NetMessage  Method 1: Handle() – decodes the received message using the proper version and returns Message  Method 2: toString() – used for serialization NetMessage SHA1MessageNormalMessage Message

11.  H = f(P, n, threshold)  Assumptions required  Simplicity Vs Efficiency  Full topology  Spread time << threshold

12.  Assumption – Local Information  Strong Assumption  Reliability  x – number of messages -  Probability for false detection  We want  Result :

13.  Linear Performance  The bigger is P the bigger is the slope

14.  Assumptions  Synchrony  Consistency  Calculation for average case

15.  High Performance

16.  Comparison Categories  Efficiency  Scalability  Dynamism  Reliability