Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Stabilization and Pseudo-Stabilization
Stabilization and Pseudo-Stabilization
Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Adaptive containment of time-bounded byzantine faults
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. For t faulty processes, we give an algorithm that has at most t disagreements for 4t or more processes. Another algorithm is given for n ≥ 3t + 1 processes with the number of disagreements below t2/2. Both algorithms use O(n3) message bits for binary value agreement.