Performance Evaluation of a Game Theory-Based Fault Diagnosis Algorithm Under Partial Comparison Syndrome
MetadataShow full item record
This paper introduces a novel diagnosis approach, using game theory, to solve the comparison-based system- level fault identiﬁcation problem in distributed and parallel systems based on the asymmetric comparison model. Under this diagnosis model tasks are assigned to pairs of nodes and the results of executing these tasks are compared. Using the agreements and disagreements among the nodes’ outputs, i.e., the input syndrome, the fault diagnosis algorithm identiﬁes the fault status of the system’s nodes, under the assumption that at most t of these nodes can permanently fail simultaneously. Since the introduction of the comparison model, signiﬁcant progress has been made in both theory and practice associated with the original model and its offshoots. Nevertheless, the problem of efﬁciently identifying the set of faulty nodes when not all the comparison outcomes are available to the fault identiﬁcation algorithm prior to initiating the diagnosis phase, i.e., partial syndromes, remains an outstanding research issue. In this paper, we ﬁrst show how game theory can be adapted to solve the fault diagnosis problem by maximizing the payoffs of all players (nodes). We then demonstrate, using results from a thorough simulation, the effectiveness of this approach in solving the fault identiﬁcation problem using partial syndromes from randomly generated diagnosable systems of different sizes and under various fault scenarios.