Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A formally verified algorithm for clock synchronization under a hybrid fault model
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A Note on Consensus on Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Formally Verified On-Line Diagnosis
IEEE Transactions on Software Engineering
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Interactive geometry remeshing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
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
Dual link fault diagnosis agreement
Journal of Systems and Software
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
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
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
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
Realistic Failures in Secure Multi-party Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Resilient multi-core systems: a hierarchical formal model for N-variant executions
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Computer Standards & Interfaces
Achieving high efficient agreement with malicious faulty nodes on a cloud computing environment
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Computers and Electrical Engineering
The anatomy study of consensus agreement in MANETs
Computers and Electrical Engineering
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
Fault-models in wireless communication: towards survivable ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
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
Eventually Dual Failure Agreement
Fundamenta Informaticae
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.05 |
The problem of achieving consensus in a distributed system is discussed. Systems aretreated in which either or both of two types of faults may occur: dormant (essentiallyomission and timing faults) and arbitrary (exhibiting arbitrary behavior, commonly referred to as Byzantine). Previous results showed that are number of dormant faults may be tolerated when there are no arbitrary faults and that, at most, (n-1/3) arbitrary faults may be tolerated when there are no dormant faults (n is the number of processors). Acontinuum is established between the previous results: an algorithm exists if n(f/submax/+2m/sub max/) and c(f/sub max/+m/sub max/) (where c is the system connectivity),when faults are constrained so that there are at most f/sub max/ and at most m/submax/ of these that are arbitrary. An algorithm is given and compared to known algorithms. A method is given to establish virtual links so that the communications graph appears completely connected.