Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the reliability of consensus-based fault-tolerant distributed computing systems
ACM Transactions on Computer Systems (TOCS)
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
Telecommunications and the computer (3rd ed.)
Telecommunications and the computer (3rd ed.)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Analysis of the link error monitoring protocols in the common channel signaling network
IEEE/ACM Transactions on Networking (TON)
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
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
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Reaching Fault Diagnosis Agreement under a Hybrid Fault Model
IEEE Transactions on Computers
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
Reaching fault diagnosis agreement on an unreliable general network
Information Sciences—Informatics and Computer Science: An International Journal
The bounds of faulty components on consensus with dual failure modes
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
Information Processing Letters
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
An early fault diagnosis agreement under hybrid fault model
Expert Systems with Applications: An International Journal
Data aggregation in partially connected networks
Computer Communications
Computers and Electrical Engineering
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Journal of Network and Computer Applications
Eventually Dual Failure Agreement
Fundamenta Informaticae
Efficient Diagnosis Protocol to Enhance the Reliability of a Cloud Computing Environment
Journal of Network and Systems Management
| Hi-index | 0.01 |
In early stage, the Byzantine agreement (BA) problem was studied with single faults on processors in either a fully connected network or a nonfully connected network. Subsequently, the single fault assumption was extended to mixed faults (also referred to as hybrid fault model) on processors. For the case of both processor and link failures, the problem has been examined in a fully connected network with a single faulty type, namely an arbitrary fault. To release the limitations of a fully connected network and a single faulty type, the problem is reconsidered in a general network. The processors and links in such a network can both be subjected to different types of fault simultaneously. The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement.