Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Information Processing Letters
Information Processing Letters
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
The Theory of Weak Stabilization
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Dining Philosophers with Crash Locality 1
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Weak vs. Self vs. Probabilistic Stabilization
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Self-stabilizing Byzantine digital clock synchronization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Bounding the impact of unbounded attacks in stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A fault-resistant asynchronous clock function
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Synchronous vs. asynchronous unison
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Research note: Self-stabilizing byzantine asynchronous unison
Journal of Parallel and Distributed Computing
| Hi-index | 5.23 |
Distributed fault-tolerance can mask the effect of a limited number of permanent faults, while self-stabilization provides forward recovery after an arbitrary number of transient faults hit the system. FTSS (Fault-Tolerant Self-Stabilizing) protocols combine the best of both worlds since they tolerate simultaneously transient and (permanent) crash faults. To date, deterministic FTSS solutions either consider static (i.e. fixed point) tasks, or assume synchronous scheduling of the system components. In this paper, we present the first study of deterministic FTSS solutions for dynamic tasks in asynchronous systems, considering the unison problem as a benchmark. Unison can be seen as a local clock synchronization problem as neighbors must maintain digital clocks at most one time unit away from each other, and increment their own clock value infinitely often. We present several impossibility results for this difficult problem and propose an FTSS solution (when the problem is solvable) for the state model that exhibits optimal fault-containment.