%0 Generic %1 Clement_makingbyzantine %A Clement, Allen %A Marchetti, Mirco %A Wong, Edmund %A Alvisi, Lorenzo %A Dahlin, Mike %D 2008 %K aardvark bft %T Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults (Superseded by %U http://citeseerx.ist.psu.edu/viewdoc/summary;jsessionid=4DFD65CD3F84EA4E6F2C837425A1A0FB?doi=10.1.1.140.1750 %X Abstract: This paper is motivated by a simple observation: although recently developed BFT state machine replication protocols are quite fast, they don’t actually tolerate Byznatine faults very well. In particular a single faulty client or server in PBFT, Q/U, HQ, and Zyzzyva can render each of these systems effectively unusable for many applications by reducing their throughput by two orders of magnitude or more, from thousands of requests per second to fewer than 10 requests per second. The problem comes not because these systems fail to meet the guarantees they promise, but because the guarantees they promise are insufficient for the high assurance systems for which BFT techniques are likely to be of most interest. In this paper, we describe Aardvark, a new BFT replication protocol that guarantees good performance during uncivil periods, when the network is reliable but when up to f servers and any number of clients are faulty. Aardvark gives up some performance compared to protocols that focus on optimizing for the best case, but Aardvark’s peak throughput of 40527 requests per second seems sufficient for many applications. Because Aardvark is less aggressively tuned for the fault free case, it is guaranteed to remain within a constant factor of 40527 when faults occur. We observe throughputs of between 11706and 40527for a broad range of injected faults. 1

@misc{Clement_makingbyzantine, abstract = {Abstract: This paper is motivated by a simple observation: although recently developed BFT state machine replication protocols are quite fast, they don’t actually tolerate Byznatine faults very well. In particular a single faulty client or server in PBFT, Q/U, HQ, and Zyzzyva can render each of these systems effectively unusable for many applications by reducing their throughput by two orders of magnitude or more, from thousands of requests per second to fewer than 10 requests per second. The problem comes not because these systems fail to meet the guarantees they promise, but because the guarantees they promise are insufficient for the high assurance systems for which BFT techniques are likely to be of most interest. In this paper, we describe Aardvark, a new BFT replication protocol that guarantees good performance during uncivil periods, when the network is reliable but when up to f servers and any number of clients are faulty. Aardvark gives up some performance compared to protocols that focus on optimizing for the best case, but Aardvark’s peak throughput of 40527 requests per second seems sufficient for many applications. Because Aardvark is less aggressively tuned for the fault free case, it is guaranteed to remain within a constant factor of 40527 when faults occur. We observe throughputs of between 11706and 40527for a broad range of injected faults. 1}, added-at = {2009-11-16T10:50:52.000+0100}, author = {Clement, Allen and Marchetti, Mirco and Wong, Edmund and Alvisi, Lorenzo and Dahlin, Mike}, biburl = {https://www.bibsonomy.org/bibtex/24840fa04e5b490504021dcc6ab150c86/giuliano.losa}, description = {Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults (Superseded by}, interhash = {f6c8b3fa69b51efb879529b6dbf0e10d}, intrahash = {4840fa04e5b490504021dcc6ab150c86}, keywords = {aardvark bft}, timestamp = {2009-11-16T10:50:52.000+0100}, title = {Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults (Superseded by}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary;jsessionid=4DFD65CD3F84EA4E6F2C837425A1A0FB?doi=10.1.1.140.1750}, year = 2008 }