Byzantine quorum systems |
| |
Authors: | Dahlia Malkhi Michael Reiter |
| |
Affiliation: | (1) AT&T Labs – Research, Florham Park, NJ 07932-0971, USA (e-mail: {dalia,reiter}@research.att.com) , US |
| |
Abstract: | Summary. Quorum systems are well-known tools for ensuring the consistency and availability of replicated data despite the benign failure
of data repositories. In this paper we consider the arbitrary (Byzantine) failure of data repositories and present the first
study of quorum system requirements and constructions that ensure data availability and consistency despite these failures.
We also consider the load associated with our quorum systems, i.e., the minimal access probability of the busiest server.
For services subject to arbitrary failures, we demonstrate quorum systems over servers with a load of , thus meeting the lower bound on load for benignly fault-tolerant quorum systems. We explore several variations of our quorum
systems and extend our constructions to cope with arbitrary client failures.
Received: October 1996 / Accepted June 1998 |
| |
Keywords: | :Quorum systems – Byzantine failures – Replication – Fault tolerance |
本文献已被 SpringerLink 等数据库收录! |
|