Easy impossibility proofs for distributed consensus problems
Distributed Computing
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
A formally verified algorithm for clock synchronization under a hybrid fault model
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Interval-based Clock Synchronization
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
Formally Verified On-Line Diagnosis
IEEE Transactions on Software Engineering
A Network Time Interface M-Module for Distributing GPS-Timeover LANs
Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
Distributed Algorithms
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
COCA: A Secure Distributed On-line Certification Authority
COCA: A Secure Distributed On-line Certification Authority
Failure Mode Assumptions and Assumption Coverage
Failure Mode Assumptions and Assumption Coverage
Failure detection and consensus in the crash-recovery model
Distributed Computing
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Distributed Computing
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Online Diagnosis and Recovery: On the Choice and Impact of Tuning Parameters
IEEE Transactions on Dependable and Secure Computing
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Hi-index | 0.01 |
Abstract: We propose a new hybrid fault model for clock synchronization and single-round (approximate) agreement in synchronous distributed systems 1 , which accurately captures both node and link faults. Unlike conventional "global" fault models, which rest upon the total number of faulty nodes in the system, it solely relies upon the number of faults in any two non-faulty nodes' "perceptions" -conveyed by the messages from all other nodes- of the system. This way, arbitrary node and communication faults, including receiver-caused omission and time/value faults, can be modeled properly. As an example 2 , we show that the consistent broadcast primitive -and hence the clock synchronization algorithms- of Srikanth & Toueg can be analyzed under this model. As far as link faults are concerned, our analysis reveals that as few as 4f_{\ell a} +2f_{\ell s} +2f_{\ell o} +1 nodes are sufficient for tolerating at most f_{\ell a}, f_{\ell s}, and f_{\ell o} asymmetric, symmetric, and omission link faults at any receiving node.