Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Framework for Dynamic Byzantine Storage Jean-Philippe Martin, Lorenzo Alvisi
 

Summary: A Framework for Dynamic Byzantine Storage
Jean-Philippe Martin, Lorenzo Alvisi
Laboratory for Advanced Systems Research
The University of Texas at Austin
{jpmartin,lorenzo}@cs.utexas.edu
Abstract
We present a framework for transforming sev-
eral quorum-based protocols so that they can dynamically
adapt their failure threshold and server count, allow-
ing them to be reconfigured in anticipation of possible
failures or to replace servers as desired. We demon-
strate this transformation on the dissemination quo-
rum protocol. The resulting system provides confirmable
wait-free atomic semantics while tolerating Byzan-
tine failures from the clients or servers. The system can
grow without bound to tolerate as many failures as de-
sired. Finally, the protocol is optimal and fast: only the
minimal number of servers --3f + 1-- is needed to toler-
ate any f failures and, in the common case, reads require
only one message round-trip.

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences