Sciweavers

11 search results - page 1 / 3
» Probabilistic Opaque Quorum Systems
Sort
View
OPODIS
2008
13 years 6 months ago
Write Markers for Probabilistic Quorum Systems
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
Michael G. Merideth, Michael K. Reiter
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
OPODIS
2007
13 years 6 months ago
Timed Quorum Systems for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
Vincent Gramoli, Michel Raynal
PERCOM
2006
ACM
14 years 4 months ago
Communication-Efficient Probabilistic Quorum Systems for Sensor Networks
Gregory Chockler, Seth Gilbert, Boaz Patt-Shamir
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...