Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fault Detection for Byzantine Quorum Systems
 

Summary: Fault Detection for Byzantine
Quorum Systems
Lorenzo Alvisi, Member, IEEE Computer Society, Dahlia Malkhi,
Evelyn Pierce, and Michael K. Reiter
Abstract–In this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal
is to detect arbitrary failures of data servers in a system where each client accesses the replicated data at only a subset (quorum) of
servers in each operation. In such a system, some correct servers can be out-of-date after a write and can therefore, return values
other than the most up-to-date value in response to a client's read request, thus complicating the task of determining the number of
faulty servers in the system at any point in time. We initiate the study of detecting server failures in this context, and propose two
statistical approaches for estimating the risk posed by faulty servers based on responses to read requests.
Index Terms–Byzantine fault tolerance, replicated data, quorum systems, fault detection.
ś
1 INTRODUCTION
DATA replication is a well-known means of protecting
against data unavailability or corruption in the face of
data server failures. Several recent works have studied the
use of quorums for replicating data efficiently across a
potentially large set of data servers, and in a way that
ensures that clients receive correct data even in the presence
of arbitrary (Byzantine) server failures [3], [16], [18]. A

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin
Reiter, Michael - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences