Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
A O(t3+ |E| ) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers - Fault-Tolerant Computing
A Distributed Algorithm for Fault Diagnosis in Systems with Soft Failures
IEEE Transactions on Computers
Dynamic Testing Strategy for Distributed Systems
IEEE Transactions on Computers
Undirected Graph Models for System-Level Fault Diagnosis
IEEE Transactions on Computers
Intermittent Fault Diagnosis in Multiprocessor Systems
IEEE Transactions on Computers
A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
IEEE Transactions on Computers
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Asymptotically Optimal Distributed Consensus (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Fault Identification Algorithmic: A New Formal Approach
FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Efficient agreement using fault diagnosis
Distributed Computing
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Hi-index | 0.00 |
The literature includes a variety of techniques to address the Byzantine Generals Problem and the generalization/specialization of it that we call the Byzantine approach. While the main goal within the Byzantine framework is to circumvent and mask the effect of unreliable units (e.g., traitors), much research has been done on identifying (i.e., demasking) unreliable units. This is often called fault identification in system diagnosis. This paper focuses on the identification of unreliable units within the Byzantine framework. Beyond its theoretical interest, an identification of faulty units contributes to accelerate the agreement process itself and drastically reduce the number of messages exchanged between units. The main features of this work are twofold. It does not impose additional assumptions or constraints on the agreement process. It limits the overhead for identifying unreliable units--the identification process is in O(n3).