A new solution for the byzantine generals problem
Information and Control
Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
A tradeoff between safety and liveness for randomized coordinated attack protocols
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Reliable communication over unreliable channels
Journal of the ACM (JACM)
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
Atomic broadcast: from simple message diffusion to Byzantine agreement
Information and Computation
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Crash failures vs. crash + link failures
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
A Continuum of Failure Models for Distributed Computing
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Asymptotically Optimal Distributed Consensus (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Distributed Function Evaluation in the Presence of Transmission Faults
SIGAL '90 Proceedings of the International Symposium on Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
How to Model Link Failures: A Perception-Based Fault Model
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Formally Verified Byzantine Agreement in Presence of Link Faults
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Failure Mode Assumptions and Assumption Coverage
Failure Mode Assumptions and Assumption Coverage
Uniform consensus is harder than consensus
Journal of Algorithms
Failure detection and consensus in the crash-recovery model
Distributed Computing
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Distributed Computing
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing
Reconciling fault-tolerant distributed algorithms and real-time computing
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 5.23 |
We introduce a comprehensive hybrid failure model for synchronous distributed systems, which extends a conventional hybrid process failure model by adding communication failures: Every process in the system is allowed to commit up to f"@?^s send link failures and experience up to f"@?^r receive link failures per round here, without being considered faulty; up to some f"@?^s^a@?f"@?^s and f"@?^r^a@?f"@?^r among those may even cause erroneous messages rather than just omissions. In a companion paper (Schmid et al. (2009) [14]), devoted to a complete suite of related impossibility results and lower bounds, we proved that this model surpasses all existing link failure modeling approaches in terms of the assumption coverage in a simple probabilistic setting. In this paper, we show that several well-known synchronous consensus algorithms can be adapted to work under our failure model, provided that the number of processes required for tolerating process failures is increased by small integer multiples of f"@?^s, f"@?^r, f"@?^s^a, f"@?^r^a. This is somewhat surprising, given that consensus in the presence of unrestricted link failures and mobile (moving) process omission failures is impossible. We provide detailed formulas for the required number of processes and rounds, which reveal that the lower bounds established in our companion paper are tight. We also explore the power and limitations of authentication in our setting, and consider uniform consensus algorithms, which guarantee their properties also for benign faulty processes.