Sciweavers

53 search results - page 1 / 11
» Evaluating Byzantine Quorum Systems
Sort
View
SRDS
2005
IEEE
13 years 10 months ago
Agile Store: Experience with Quorum-Based Data Replication Techniques for Adaptive Byzantine Fault Tolerance
Quorum protocols offer several benefits when used to maintain replicated data but techniques for reducing overheads associated with them have not been explored in detail. It is d...
Lei Kong, Deepak J. Manohar, Mustaque Ahamad, Arun...
SRDS
2007
IEEE
13 years 11 months ago
Evaluating Byzantine Quorum Systems
Replication is a mechanism extensively used to guarantee the availability and good performance of data storage services. Byzantine Quorum Systems (BQS) have been proposed as a sol...
Wagner Saback Dantas, Alysson Neves Bessani, Joni ...
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
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...