Journal ArticleDOI
Self-stabilizing clock synchronization in the presence of Byzantine faults
Shlomi Dolev,Jennifer L. Welch +1 more
TLDR
A study of bounded clock synchronization under a more severe fault model than that proposed by Lamport and Melliar-Smith [1985] is initiated, and two randomized self-stabilizing protocols for synchronizing bounded clocks in the presence of Byzantine processor failures are presented.Abstract:
We initiate a study of bounded clock synchronization under a more severe fault model than that proposed by Lamport and Melliar-Smith [1985]. Realistic aspects of the problem of synchronizing clocks in the presence of faults are considered. One aspect is that clock synchronization is an on-going task, thus the assumption that some of the processors never fail is too optimistic. To cope with this reality, we suggest self-stabilizing protocols that stabilize in any (long enough) period in which less than a third of the processors are faulty. Another aspect is that the clock value of each processor is bounded. A single transient fault may cause the clock to reach the upper bound. Therefore, we suggest a bounded clock that wraps around when appropriate.We present two randomized self-stabilizing protocols for synchronizing bounded clocks in the presence of Byzantine processor failures. The first protocol assumes that processors have a common pulse, while the second protocol does not. A new type of distributed counter based on the Chinese remainder theorem is used as part of the first protocol.read more
Citations
More filters
Journal ArticleDOI
Fast computation by population protocols with a leader
TL;DR: In this paper, it is shown that when a unique leader agent is provided in the initial population, the population can simulate a virtual register machine with high probability in which standard arithmetic operations like comparison, addition, subtraction, and multiplication and division by constants can be simulated in O(n log5cffff n) interactions using a simple register representation or in O (n log2cffff n)-interaction initialization step.
Proceedings ArticleDOI
Fast self-stabilizing byzantine tolerant digital clock synchronization
TL;DR: The optimal probabilistic solution to the digital clock synchronization problem, which consists of agreeing on bounded integer counters, and increasing these counters regularly, is obtained, both in terms of convergence time and in Terms of resilience to Byzantine adversaries.
Journal ArticleDOI
Fault-Tolerant Clock Synchronization Over Unreliable Channels in Wireless Sensor Networks
TL;DR: This paper proposes a resilient consensus-type algorithm based on the so-called mean subsequence reduced (MSR) technique, where each normal node ignores the outliers in the clock data collected from its neighbors and makes updates using data from the past if new data have not arrived yet.
Book ChapterDOI
Self-stabilizing pulse synchronization inspired by biological pacemaker networks
TL;DR: In this paper, a robust and self-stabilizing pulse synchronization algorithm for distributed computer systems is presented, which attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Journal ArticleDOI
Self-stabilizing systems in spite of distributed control
TL;DR: In this paper, the synchronization task between loosely coupled cyclic sequential processes is viewed as keeping the relation "the system is in a legitimate state" invariant, and each individual process step that could possibly cause violation of that relation is preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed.
Journal ArticleDOI
Probabilistic clock synchronization
TL;DR: A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays and can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms.