Data and computer communications
Data and computer communications
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Journal of the ACM (JACM)
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
Parallel program design: a foundation
Parallel program design: a foundation
Bounds on information exchange for Byzantine agreement
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
Reaching agreement on an unknown network with partial graphic information
ACM SIGOPS Operating Systems Review
Revisiting fault diagnosis agreement in a new territory
ACM SIGOPS Operating Systems Review
New application of reliable agreement: underlying an unsecured business environment
ACM SIGOPS Operating Systems Review
Reaching fault diagnosis agreement on an unreliable general network
Information Sciences—Informatics and Computer Science: An International Journal
Streets of consensus under unknown unreliable network
ACM SIGOPS Operating Systems Review
Eventually Dual Failure Agreement
Fundamenta Informaticae
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
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
Reaching reliable agreement on wireless mobile network
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
A fault-tolerant scheme for an autonomous local wireless sensor network
Computer Standards & Interfaces
Improving robustness in an autonomous local sensor network
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
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
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Eventually Dual Failure Agreement
Fundamenta Informaticae
A virtual grouping based fault-tolerant scheme for autonomous networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Traditionally, the Byzantine Agreement (BA) problem is studied either in a fully connected network or in a broadcast network. A generalized network model for BA is proposed in this paper. A fully-connected network or a broadcast network is a special case of the new network architecture. Under the new generalized network model, the BA problem is reexamined with the assumption of malicious faults on both processors and transmission medium (TM), as opposed to previous studies which consider malicious faults on processors only. The proposed algorithm uses the minimum number of message exchanges, and can tolerate the maximum number of allowable faulty components to make each healthy processor reach a common agreement for the cases of processor failures, TM failures, or processor/TM failures. The results can also be used to solve the interactive consistency problem and the consensus problem.