Zyzzyva: Speculative Byzantine fault tolerance

By R. Kotla, Lorenzo Alvisi, M. Dahlin, Allen Clement, Edmund L. Wong. TOCS, 2009

398 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/0a9cc699ed94b4729de3255d76305b91b6a56aaa

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Elaine Shi
2. Andrew K. Miller
3. Dawn Song
4. Miguel Pupo Correia
5. Laphou Lao
6. Paulo Jorge Esteves Veríssimo
7. Alysson Neves Bessani
8. Rachid Guerraoui

In Computer Vision and Pattern Recognition

1. Elaine Shi
2. Dawn Song
3. Rachid Guerraoui
4. Mohamed Amine Ferrag
5. Leandros A. Maglaras
6. Peng Ning

Citations in the corpus

• Mencius: Building Efficient Replicated State Machine for WANs (2008, neutral): “PBFT [7] and Zyzzyva [19] propose practical protocols for high-throughput consensus when processes can fail arbitrarily.”
• The Next 700 BFT Protocols (2015, methodology): “[2008], who concluded for instance that “PBFT [Castro and Liskov 2002] offers more predictable performance and scales better with payload size compared to Zyzzyva [Kotla et al. 2010]; in contrast, Zyzzyva offers greater absolute throughput in wider-area, lossy networks.”
• Efficient Byzantine Fault-Tolerance (2013, methodology): “BFT algorithms typically require 3f þ 1 servers (or replicas(2)) to tolerate f Byzantine (or faulty) servers [12], [17], [26], [39].”
• The Honey Badger of BFT Protocols (2016, methodology): “We use Practical Byzantine Fault Tolerance (PBFT) [20], the classic leader-based BFT protocol, a representative example to describe how an adversarial network scheduler can cause a class of leader-based BFT protocols [4, 6, 10, 22, 33, 50] to grind to a halt.”
• The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication (2015, neutral): “In more than three decades of research, BFT protocol prototypes have been shown to be practical [10], reaching practically minimal latencies allowed by the network, and supporting tens of thousands transactions per second (see e.g., [35, 3]).”
• Security and Privacy for Green IoT-Based Agriculture: Review, Blockchain Solutions, and Challenges (2020, methodology): “Note that there are more variations of PBFT algorithm such as Aardvark [128], Zyzzyva [129], HQ [130], Q/U [131], and Abstract [132].”
• A Survey of IoT Applications in Blockchain Systems (2020, methodology): “A typical SBFT protocol is introduced in Zyzzyva [Kotla et al. 2007], which significantly improves PBFT efficiency.”