On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the reliability of consensus-based fault-tolerant distributed computing systems
ACM Transactions on Computer Systems (TOCS)
Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
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
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
LOCUS a network transparent, high reliability distributed system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
SuperWeb: Towards a Global Web-Based Parallel Computing Infrastructure
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
Streets of consensus under unknown unreliable network
ACM SIGOPS Operating Systems Review
Eventually Dual Failure Agreement
Fundamenta Informaticae
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
A fault-tolerant scheme for an autonomous local wireless sensor network
Computer Standards & Interfaces
Zone-Oriented byzantine agreement on zone-based wireless ad-hoc network
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Secure computation with partial message loss
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Eventually Dual Failure Agreement
Fundamenta Informaticae
Hi-index | 0.00 |
Traditionally, the problems of Byzantine agreement, consensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are reexamined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure, link failure, or processor and link failure.