| A Byzantine-Fault Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems Contributor(s): Administration (Nasa), National Aeronaut (Author) |
|
 |
ISBN: ISBN-13: 9798672058689 Publisher: Independently Published OUR PRICE: $31.49 Product Type: Paperback Published: August 2020 * Not available - Not in print at this time * |
| Additional Information |
| BISAC Categories: - Reference | Research - Science | Space Science |
| Physical Information: 0.08" H x 8.5" W x 11.02" (0.25 lbs) 38 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Embedded distributed systems have become an integral part of safety-critical computing applications, necessitating system designs that incorporate fault tolerant clock synchronization in order to achieve ultra-reliable assurance levels. Many efficient clock synchronization protocols do not, however, address Byzantine failures, and most protocols that do tolerate Byzantine failures do not self-stabilize. Of the Byzantine self-stabilizing clock synchronization algorithms that exist in the literature, they are based on either unjustifiably strong assumptions about initial synchrony of the nodes or on the existence of a common pulse at the nodes. The Byzantine self-stabilizing clock synchronization protocol presented here does not rely on any assumptions about the initial state of the clocks. Furthermore, there is neither a central clock nor an externally generated pulse system. The proposed protocol converges deterministically, is scalable, and self-stabilizes in a short amount of time. The convergence time is linear with respect to the self-stabilization period. Proofs of the correctness of the protocol as well as the results of formal verification efforts are reported. Malekpour, Mahyar R. Langley Research Center NASA/TM-2006-214322, L-19262 WBS 457280.02.07.07 CLOCKS; SYNCHRONISM; PROVING; FAULT TOLERANCE; CONVERGENCE; EMBEDDING; ALGORITHMS; SAFETY; PROTOCOL (COMPUTERS); PROGRAM VERIFICATION (COMPUTERS); FAILURE |