SIAM Journal on Computing
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Data communications, computer networks and open systems (4th ed.)
Data communications, computer networks and open systems (4th ed.)
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Agreement under faulty interfaces
Information Processing Letters
Consensus under unreliable transmission
Information Processing Letters
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Optimal Early Stopping in Distributed Consensus (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
The Byzantine Agreement Problem: Optimal Early Stopping
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Early stopping protocols for fault-tolerant distributed agreement
Early stopping protocols for fault-tolerant distributed agreement
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Hi-index | 0.00 |
The Byzantine Agreement (BA) problem is a fundamental problem to consider in designing a fault-tolerance distributed system. Most BA protocols require all the fault-free processors to reach a common agreement at the same round, called an Immediate Byzantine Agreement (IBA), whereas another type of BA protocol allows the fault-free processors to reach a common agreement, called an Eventual Byzantine Agreement (EBA), at different rounds when they receive enough information. Up to now, all the existing EBA protocols are designed to solve the EBA problem based on the single failure type assumption (dormant fault only or malicious fault only) as to fallible processors over a reliable fully connected network. However, in practice, most network topologies would not be fully connected, and the underlying network would not be reliable, which means both dormant and malicious faults may occur within the same network simultaneously. In this study, we shall propose a new protocol to solve the EBA problem with dual failure mode on both processors and communication media (both dormant and malicious faults can happen simultaneously to either the processors or the communication media or both) over an unreliable un-fully connected network. The proposed protocol is the optimal when the above assumptions are considered.