Name
Abstract | ||
|---|---|---|
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. A prototype service built using the Q/U protocol outperforms the same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution. Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1145/1095810.1095817 | SOSP |
Keywords | Field | DocType |
state machine,byzantine fault tolerance,services | State machine replication,Telecommunications network,Computer science,Byzantine fault tolerance,Finite-state machine,Real-time computing,Fault tolerance,Throughput,Quantum Byzantine agreement,Distributed computing,Scalability | Conference |
Volume | Issue | ISSN |
39 | 5 | 0163-5980 |
ISBN | Citations | PageRank |
1-59593-079-5 | 149 | 6.06 |
References | Authors | |
35 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Abd-El-Malek | 1 | 647 | 28.60 |
| Gregory R. Ganger | 2 | 4560 | 383.16 |
| Garth R. Goodson | 3 | 679 | 43.14 |
| Michael K. Reiter | 4 | 8695 | 764.03 |
| Jay J. Wylie | 5 | 685 | 44.29 |