2006 · 15 citations · 37 references
ComputingComputer ScienceComputer SystemsFault ToleranceFault-tolerant ComputingFault-tolerant SystemsCollective CommunicationConsensus ProtocolsDistributed ConsensusFault Tolerance In CommunicationFault-tolerant CommunicationReliable Distributed SystemsByzantine Attack MitigationByzantine BroadcastByzantine FaultsCommunication Protocol DesignFailure DetectorsFault-tolerant Consensus ProtocolsPerformance DegradationPractical Byzantine Fault Tolerance
This paper presents an adaptation of the JazzEnsemble group communication system that enables it to tolerate Byzantine failures. The work emphasizes scalability and good performance in the normal case, i.e., when there are no failures, while providing strong semantics to the application. The paper presents the main concepts and protocols that enable the Byzantine tolerant version of JazzEnsemble to obtain these goals. In particular, this includes fuzzy mute and fuzzy verbose failure detectors, an efficient Byzantine vector consensus protocol, and a novel Byzantine uniform broadcast protocol, as well as modifications at each layer of the system to overcome potential Byzantine attacks. Additionally, high-level protocols only rely on the oral messages model, and thus messages need to be signed only once at a low level of the system. Finally, the paper presents an extensive performance evaluation, which demonstrates the system’s scalability and efficiency, and is used to analyze the sources of performance degradation associated with various aspects of overcoming Byzantine failures.
37
The weakest failure detector for solving consensus
Tushar Chandra, Vassos Hadzilacos, Sam Toueg · Journal of the ACM · 1996 · 873 citations · Full text
Ken Birman, Mark Hayden, Öznur Özkasap et al. · ACM Transactions on Computer Systems · 1999 · 652 citations · Full text
Robbert van Renesse, Ken Birman, Silvano Maffeis · Communications of the ACM · 1996 · 626 citations · Full text