Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
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
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Optimal Approximate Agreement with Omission Faults
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Attested append-only memory: making adversaries stick to their word
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Data aggregation in partially connected networks
Computer Communications
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
Optimal resilience asynchronous approximate agreement
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.01 |
In a fault-tolerant distributed system, different non-faulty processes may arrive atdifferent values for a given system parameter. To resolve this disagreement, processesmust exchange and vote upon their respective local values. Faulty processes mayattempt to inhibit agreement by acting in a malicious or "Byzantine" manner. Approximate agreement defines one form of agreement in which the voted values obtained by the non-faulty processes need not be identical. Instead, they need only agree to within a predefined tolerance. Approximate agreement can be achieved by a sequence of convergent voting rounds, in which the range of values held by non-faulty processes isreduced in each round. Historically, each new convergent voting algorithm has beenaccompanied by ad-hoc proofs of its convergence rate and fault-tolerance, using anoverly conservative fault model in which all faults exhibit worst-case Byzantine behavior.This paper presents a general method to quickly determine convergence rate andfault-tolerance for any member of a broad family of convergent voting algorithms. Thismethod is developed under a realistic mixed-mode fault model comprised of asymmetric,symmetric, and benign fault modes. These results are employed to more accuratelyanalyze the properties of several existing voting algorithms, to derive a sub-family ofoptimal mixed-mode voting algorithms, and to quickly determine the properties ofproposed new voting algorithms.