Sciweavers

35 search results - page 1 / 7
» Small Byzantine Quorum Systems
Sort
View
DSN
2002
IEEE
13 years 9 months ago
Small Byzantine Quorum Systems
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. ...
Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahl...
DSN
2000
IEEE
13 years 9 months ago
Dynamic Byzantine Quorum Systems
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
Lorenzo Alvisi, Evelyn Tumlin Pierce, Dahlia Malkh...
OTM
2009
Springer
13 years 11 months ago
Proactive Byzantine Quorum Systems
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 Byzan...
Eduardo Adílio Pelinson Alchieri, Alysson N...
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
13 years 11 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
PODC
1997
ACM
13 years 9 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool