Zyzzyva: Speculative Byzantine Fault Tolerance.
A longstanding vision in distributed systems is to build reliable systems from unreliable components. An enticing formulation of this vision is Byzantine fault-tolerant (BET) state machine replication, in which a group of servers collectively act as a correct server even if some of the servers misbe...
| Publicado en: | Communications of the ACM Vol. 51; no. 11; pp. 86 - 96 |
|---|---|
| Autores principales: | , , , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Nov2008
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=35211908&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 35211908 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Nov2008 vid: 51 iid: 11 pid: 68 pub: Association for Computing Machinery artinfo: ui: 35211908 10.1145/1400214.1400236 ppf: 86 ppct: 10 formats: tig: atl: Zyzzyva: Speculative Byzantine Fault Tolerance. aug: au: Kotla, Ramakrishna Clement, Allen Wong, Edmund Alvisi, Lorenzo Dahlin, Mike affil: Microsoft Research Sfticon VaLey, Mountain View, CA. Department of Computer Sciences, University of Texas, Austin. su: Fault-tolerant computing Distributed computing Computer reliability Self-stabilization (Computer science) Computer system failures Computer security Computer software sug: subj: Fault-tolerant computing Distributed computing Computer reliability Self-stabilization (Computer science) Computer system failures Computer security Computer software ab: A longstanding vision in distributed systems is to build reliable systems from unreliable components. An enticing formulation of this vision is Byzantine fault-tolerant (BET) state machine replication, in which a group of servers collectively act as a correct server even if some of the servers misbehave or malfunction in arbitrary ("Byzantine") ways. Despite this promise, practitioners hesitate to deploy BFT systems at least partly because of the perception that BFT must impose high overheads. In this article, we present Zyzzyva, a protocol that uses speculation to reduce the cost of BET replication. In Zyzzyva, replicas reply to a client's request without first running an expensive three-phase commit protocol to agree on the order to process requests. Instead, they optimistically adopt the order proposed by a primary server, process the request, and reply immediately to the client. If the primary is faulty, replicas can 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 and to achieve throughputs of tens of thousands of requests per second, making BET replication practical for a broad range of demanding services. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2008 holdings: @attributes: islocal: N |
|---|