Skip to Main Content
This paper has considered the problem of distributed diagnosis in dynamic fault environments for arbitrary network topologies under crash fault assumptions. Heartbeat based mechanisms are used to detect the failure and recovery event at a particular node. A diagnosis algorithm has been simulated and the results are presented. The result shows that failure and recovery events both take a constant time, i.e., O(1) round compared to other relevant algorithms that take at least O(log2 2 n) rounds in dynamic environments where n is the number of nodes in the system. The algorithm is shown to produce significantly shorter latency and state holding time than prior algorithms, which focused primarily on minimizing the number of tests at the expense of latency.