Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10609857,p. 235-244
Abstract
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication complexity and cheap symmetric cryptography, and a shared coin protocol, with an expected low communication complexity and expensive asymmetric cryptography. The experimental evaluation was conducted on a LAN environment, by varying several system parameters, such as the fault types and number of processes. The analysis shows that there is a significant gap between the theoretical and the practical performance results of these protocols, and provides an important insight into what actually happens during their executionKeywords
This publication has 15 references indexed in Scilit:
- Randomized Intrusion-Tolerant Asynchronous Services2006
- From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without SignaturesThe Computer Journal, 2005
- Intrusion-Tolerant Architectures: Concepts and Design2003
- Security Architecture for the Internet Protocol1998
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Randomized Byzantine Agreements1984
- An asynchronous [(n - 1)/3]-resilient consensus protocol1984
- Randomized byzantine generals1983