Peaceable Self-Stabilizing Byzantine Pulse Synchronization
Shaolin Yu, Jihong Zhu, Jiali Yang

TL;DR
This paper introduces a fast, resource-efficient self-stabilizing Byzantine pulse synchronization method that combines multiple processes and primitives, achieving optimal resilience and quick stabilization for real-time systems.
Contribution
It proposes a novel framework integrating absorption and emergency processes for rapid, resource-efficient Byzantine pulse synchronization and clock synchronization.
Findings
Constant-time two-stage absorption process
Deterministic linear stabilization time in basic solutions
Resource occupation proportional to approximate agreement
Abstract
For reaching fast and efficient self-stabilizing Byzantine pulse synchronization (SSBPS) upon the bounded-delay message-passing networks, we consider the peaceable SSBPS problem where the resource occupation in the stabilized system is required to be as sparse as possible and the stabilization of the system is required to be as fast as possible. To solve it, the decoupled absorption process and emergency process are investigated under a general framework. The constant-time two-stage absorption process and more than one kind of emergency process are provided in integrating the merits of temporal trails, approximate agreements, deterministic and randomized Byzantine agreements, and self-stabilizing protocols. With this, not only SSBPS but self-stabilizing Byzantine clock synchronization can be fast established and efficiently maintained. In the optimal-resilient basic solutions, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Time Synchronization Technologies · Distributed systems and fault tolerance · Advanced Frequency and Time Standards
