Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
 

Summary: Making Byzantine Fault Tolerant Systems
Tolerate Byzantine Faults
Allen Clement1, Mirco Marchetti2, Edmund Wong1,
Lorenzo Alvisi1, and Mike Dahlin1
1The University of Texas at Austin, 2,University of Modena and Reggio Emilia,
{aclement, mirco, elwong, lorenzo, dahlin}@cs.utexas.edu
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 Byz-
natine 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 as-
surance systems for which BFT techniques are likely to be
of most interest.
In this paper, we describe Aardvark, a new BFT replica-

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin
Dahlin, Michael D. - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences