Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
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
Information and Computation
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
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
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
Formally Verified Byzantine Agreement in Presence of Link Faults
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Consensus with Byzantine Failures and Little System Synchrony
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
IEEE Transactions on Dependable and Secure Computing
Improving Fast Paxos: being optimistic with no overhead
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Lower bounds for asynchronous consensus
Future directions in distributed computing
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Formal verification of consensus algorithms tolerating malicious faults
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: tolerating permanent and transient value faults
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
Consensus encalpsulates the inherent problems of building fault tolerant distributed systems. In this context, the classic model of Byzantine faulty processes can be restated such that messages from a subset of processes can be arbitrarily corrupted (including addition and omission of messages). We consider the case of dynamic and transient faults,that may affect all processes and that are not permanent, and we model them via corrupted communication. For corrupted communication it is natural to distinguish between the safety of communication, which is concerned with the number of altered messages, and the liveness of communication, which restricts message loss. We present two consensus algorithms, together with sufficient conditions on the system to ensure correctness. Our first algorithm needs strong conditions on safety but requires weak conditions on liveness in order to terminate. Our second algorithm tolerates a lower degree of communication safety at the price of stronger liveness conditions. Our algorithms allow us to circumvent the resilience lower bounds from Santoro/Widmayer and Martin/Alvisi.