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 Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin
The University of Texas at Austin
Mirco Marchetti
The University of Modena and Reggio Emilia
Abstract
This paper argues for a new approach to building Byzan-
tine fault tolerant replication systems. We observe that
although recently developed BFT state machine replica-
tion protocols are quite fast, they don't tolerate Byzantine
faults very well: a single faulty client or server is capa-
ble of rendering PBFT, Q/U, HQ, and Zyzzyva virtually
unusable. In this paper, we (1) demonstrate that exist-
ing protocols are dangerously fragile, (2) define a set of
principles for constructing BFT services that remain use-
ful even when Byzantine faults occur, and (3) apply these
principles to construct a new protocol, Aardvark. Aard-
vark can achieve peak performance within 40% of that of
the best existing protocol in our tests and provide a sig-

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin
Dahlin, Michael D. - Department of Computer Sciences, University of Texas at Austin
Montresor, Alberto - Dipartimento di Ingegneria e Scienza dell'Informazione, UniversitÓ di Trento

 

Collections: Computer Technologies and Information Sciences