Affiliation:
1. Cornell Univ., Ithaca, NY
Abstract
The designer of a fault-tolerant distributed system faces numerous alternatives. Using a stochastic model of processor failure times, we investigate design choices such as replication level, protocol running time, randomized versus deterministic protocols, fault detection, and authentication. We use the probability with which a system produces the correct output as our evaluation criterion. This contrasts with previous fault-tolerance results that guarantee correctness only if the percentage of faulty processors in the system can be bounded. Our results reveal some subtle and counterintuitive interactions between the design parameters and system reliability.
Publisher
Association for Computing Machinery (ACM)
Reference28 articles.
1. Stopping times of distributed consensus protocols: A probabilistic analysis
2. BABAO~ LU 0. Distributed consensus in the presence of probabilistic failures. Dept. of Computer Science Cornell Univ. Ithaca N. Y. in preparation. BABAO~ LU 0. Distributed consensus in the presence of probabilistic failures. Dept. of Computer Science Cornell Univ. Ithaca N. Y. in preparation.
3. A Simple and Efficient Randomized Byzantine Agreement Algorithm
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computer Science and Game Theory;The New Palgrave Dictionary of Economics;2018
2. Modeling security in cyber–physical systems;International Journal of Critical Infrastructure Protection;2012-12
3. Introduction;Principles of Distributed Database Systems, Third Edition;2011
4. Computer Science and Game Theory;Game Theory;2010
5. Computer Science and Game Theory;The New Palgrave Dictionary of Economics;2008