Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures
IEEE Transactions on Computers - Fault-Tolerant Computing
Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Replication and fault-tolerance in the ISIS system
Proceedings of the tenth ACM symposium on Operating systems principles
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Elements of discrete mathematics (McGraw-Hill computer science series)
Elements of discrete mathematics (McGraw-Hill computer science series)
Interval-based Clock Synchronization
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
Optimal Approximate Agreement with Omission Faults
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
How to Model Link Failures: A Perception-Based Fault Model
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
An Algorithm for Fault-Tolerant Clock State and Rate Synchronization
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Interval-based clock synchronization with optimal precision
Information and Computation
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Distributed Computing
Inner-Circle Consistency for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Attested append-only memory: making adversaries stick to their word
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Tiered fault tolerance for long-term integrity
FAST '09 Proccedings of the 7th conference on File and storage technologies
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Small trusted primitives for dependable systems
ACM SIGOPS Operating Systems Review
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Hi-index | 14.99 |
An important problem in fault-tolerant distributed systems is maintaining agreement between nonfaulty processes in the presence of undiagnosed faults. To achieve agreement, processes exchange their local "opinions" of a particular value, and then vote on the values received to arrive at a "consensus." Approximate Agreement defines a condition in which it is not necessary for consensus values to be identical. Rather, it is only necessary that they agree to within a predefined tolerance.Approximate Agreement can be achieved through a sequence of convergent voting rounds, in which the range of values held by nonfaulty nodes is reduced in each round. Recent research has revealed simple expressions for the convergence rate and fault tolerance of a broad family of convergent voting algorithms called Mean-Subsequence-Reduced (MSR) algorithms. These results were derived under the Thambidurai and Park hybrid fault model comprised of asymmetric, symmetric, and benign faults. However, these results apply only to synchronous systems, in which there is a known finite bound on computation and communications times. This paper extends the previous results to asynchronous systems, in which no such bound exists. In addition, we introduce two new hybrid fault models which further differentiate between omissive faults and transmissive faults. The new fault models permit tighter bounds on the fault-tolerance of asynchronous systems to be derived.