Probabilistic Byzantine Quorum Systems

Ð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.

• Type: Conference
• Year: 1998
• Where: PODC
• Authors: Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Rebecca N. Wright
• Keywords: Asynchronous Replicated Data, Byzantine Server Failures, Data Servers, Distributed And Parallel Computing, PODC 1998