How to assign votes in a distributed system
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computer related risks
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Optimal Primary-Backup Protocols
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Robust TCP Connections for Fault Tolerant Computing
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Synchronous Consensus for Dependent Process Failures
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
BASE: Using abstraction to improve fault tolerance
ACM Transactions on Computer Systems (TOCS)
Distributed Computing
Introduction to Reliable Distributed Programming
Introduction to Reliable Distributed Programming
Coping with dependent failures in distributed systems
Coping with dependent failures in distributed systems
Solving Consensus Using Structural Failure Models
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
Automatic Verification and Discovery of Byzantine Consensus Protocols
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A framework for the design of dependent-failure algorithms: Research Articles
Concurrency and Computation: Practice & Experience - Parallel and Distributed Computing (EuroPar 2005)
Designing algorithms for dependent process failures
Future directions in distributed computing
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Many replication protocols are using a threshold modelin which failures are independent and identically distributed (IID). In this model, one assumes that no more than tout of ncomponents can fail. In many real systems, however, failures are not IID, and a straightforward application of threshold protocols yields suboptimal results.Here, we examine the problem of optimally transforming threshold protocols into survivor-set protocols tolerating dependent failures. In particular, we are interested in threshold protocols where the number of components nand the number of failures tare related by n k·t, where kis a positive integer constant k. We develop an optimal transformationthat translates any such threshold protocol to a survivor-set dependent failure model, and hence, to adversarial structures. Our transformation does not require authentication, self-verification or encryption. We characterize equivalence classes of adversarial structures, regarding solvability, using certain hierarchical properties based on set intersection.