“Proactive Byzantine Quorum Systems”

From Navigators

Revision as of 14:41, 14 January 2013 by Jcraveiro (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Eduardo Alchieri, Alysson Bessani, Joni Fraga, Fernando Pereira

in Proceedings of the XI International Symposium on Distributed Objects and Applications (DOA'09). LNCS XXXX. Vilamoura, Portugal., Nov. 2009.

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.

Download paper

Download Proactive Byzantine Quorum Systems

Export citation

BibTeX

Project(s):

Research line(s): Fault And Intrusion Tolerance in Open Distributed Systems (FIT)

Personal tools
Navigators toolbox