Zyzzyva: Speculative byzantine fault tolerance (2007)
Cached
Download Links
- [www.sosp2007.org]
- [www.cs.utexas.edu]
- [www.cs.ucla.edu]
- [www.icir.org]
- [www.cs.ucla.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Symposium on Operating Systems Principles (SOSP |
| Citations: | 78 - 10 self |
BibTeX
@INPROCEEDINGS{Kotla07zyzzyva:speculative,
author = {Ramakrishna Kotla and Lorenzo Alvisi and Mike Dahlin and Allen Clement and Edmund Wong},
title = {Zyzzyva: Speculative byzantine fault tolerance},
booktitle = {In Symposium on Operating Systems Principles (SOSP},
year = {2007}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client’s request without first running an expensive three-phase commit protocol to reach agreement on the order in which the request must be processed. Instead, they optimistically adopt the order proposed by the primary and respond immediately to the client. Replicas can thus become temporarily inconsistent with one another, but clients detect inconsistencies, help correct replicas converge on a single total ordering of requests, and only rely on responses that are consistent with this total order. This approach allows Zyzzyva to reduce replication overheads to near their theoretical minima.
