Proactive Byzantine Quorum Systems

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzantine Quorum Systems protocol that provides atomic semantics despite the existence of Byzantine clients and servers. Moreover, this protocol is integrated with a protocol for proactive recovery of servers. In that way, the system tolerates any number of failures during its lifetime, since no more than f out of n servers fail during a small interval of time between recoveries. All solutions proposed in this paper can be used on asynchronous systems, which requires no time assumptions. The proposed quorum system read and write protocols have been implemented and their efficiency is demonstrated through some experiments carried out in the Emulab platform. © Springer-Verlag 2009.

Cite

CITATION STYLE

APA

Alchieri, E. A. P., Bessani, A. N., Pereira, F. C., & Fraga, J. D. S. (2009). Proactive Byzantine Quorum Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5870 LNCS, pp. 708–725). https://doi.org/10.1007/978-3-642-05148-7_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free