A Self-Stabilizing Hybrid-Fault Tolerant Synchronization Protocol

By: Nasa, National Aeronautics and Space Adm

In this report we present a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various severities including any number of arbitrary (Byzantine) faulty nodes. Our solution applies to realizable systems, while allowing for differences in the network elements, provided that the number of arbitrary faults is not more than a third of the network size. The only constraint on the behavior of a node is that the interactions with other nodes are restricted to defined links and interfaces. Our solution does not rely on assumptions about the initial state of the system and no central clock nor centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. We also present a mechanical verification of a proposed protocol. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV). The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization period. We believe that our proposed solution solves the general case of the clock synchronization problem. Malekpour, Mahyar R. Langley Research Center WBS 534723.02.02.07.30

• Format: Paperback
• Language: English
• ISBN: 1793971803
• ISBN13: 9781793971807
• Release Date: January 1
• Publisher: Independently Published
• Length: 28 Pages
• Weight: 0.20 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"