Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Small Byzantine Quorum Systems Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin
 

Summary: Small Byzantine Quorum Systems
Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin
University of Texas at Austin - Dept. of Computer Science
Email:

jpmartin, lorenzo, dahlinĄ @cs.utexas.edu
Abstract
In this paper we present two protocols for asynchronous
Byzantine Quorum Systems (BQS) built on top of reli-
able channels--one for self-verifying data and the other
for any data. Our protocols tolerate ˘ Byzantine failures
with ˘ fewer servers than existing solutions by eliminat-
ing nonessential work in the write protocol and by using
read and write quorums of different sizes. Since engineer-
ing a reliable network layer on an unreliable network is dif-
ficult, two other possibilities must be explored. The first
is to strengthen the model by allowing synchronous net-
works that use time-outs to identify failed links or machines.
We consider running synchronous and asynchronous Byzan-
tine Quorum protocols over synchronous networks and con-

  

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