Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
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
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Replication and fault-tolerance in the ISIS system
Proceedings of the tenth ACM symposium on Operating systems principles
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Survivable multicast communication in bus-based networks
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Design for survivability: a tradeoff space
Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead
Dynamic hybrid fault models and the applications to wireless sensor networks (WSNs)
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Multicast survivability in hierarchical broadcast networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Data aggregation in partially connected networks
Computer Communications
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
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Neighborhood monitoring in ad hoc networks
Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
Fault-models in wireless communication: towards survivable ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Error Rate Estimation for Defective Circuits via Ones Counting
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Computer Standards & Interfaces
A reliability evaluation of a group membership protocol
SAFECOMP'07 Proceedings of the 26th international conference on Computer Safety, Reliability, and Security
On the impact of jamming attacks on cooperative spectrum sensing in cognitive radio networks
Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
Hi-index | 14.98 |
In a fault-tolerant distributed system, it is often necessary for nonfaulty processes to agree on the value of a shared data item. The criterion of Approximate Agreement does not require processes to achieve exact agreement on a value; rather, they need only agree to within a predefined numerical tolerance. Approximate Agreement can be achieved through convergent voting algorithms. Previous research has studied convergent voting algorithms under mixed-mode or hybrid fault models, such as the Thambidurai and Park Hybrid fault model, comprised of three fault modes: asymmetric, symmetric, and benign. This paper makes three major contributions to the state of the art in fault-tolerant convergent voting. 1) We partition both the asymmetric and symmetric fault modes into disjoint omissive and transmissive submodes. The resulting five-mode hybrid fault model is a superset of previous hybrid fault models. 2) We present a new family of voting algorithms, called Omission Mean Subsequence Reduced (OMSR), which implicitly recognize and exploit omissive behavior in malicious faults while still maintaining full Byzantine fault tolerance. 3) We show that OMSR voting algorithms are more fault-tolerant than previous voting algorithms if any of the currently active faults is omissive.