Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
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
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Distributed consensus revisited
Information Processing Letters
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A Note on Consensus on Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Agreement under faulty interfaces
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)
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
Reaching agreement on an unknown network with partial graphic information
ACM SIGOPS Operating Systems Review
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
An early fault diagnosis agreement under hybrid fault model
Expert Systems with Applications: An International Journal
Computers and Electrical Engineering
The anatomy study of consensus agreement in MANETs
Computers and Electrical Engineering
Efficient Diagnosis Protocol to Enhance the Reliability of a Cloud Computing Environment
Journal of Network and Systems Management
A virtual grouping based fault-tolerant scheme for autonomous networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
The reliability of the distributed system has always been an important topic of research. Byzantine Agreement (BA) protocol, which allows the fault-free processors to agree on a common value, is one of the most fundamental problems studied in a distributed system. In previous works, the problem was visited in a fully connected network or an unfully connected network with fallible processors. In this paper, the BA problem is reexamined in a group-oriented network, which has the feature of grouping, and the network topology does not have to be fully connected. We also enlarge the fault tolerant capability by allowing dormant faults and malicious faults (also called as the dual failure mode) to exist in a group-oriented network simultaneously. The proposed protocol is more efficient than the traditional BA protocols and can tolerate the maximum number of tolerable faulty processors.