How to assign votes in a distributed system
Journal of the ACM (JACM)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Introduction to algorithms
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Replica control in distributed systems: as asynchronous approach
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal multi-writer multi-reader atomic register
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Tolerating bounded inconsistency for increasing concurrency in database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Randomized algorithms
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
The availability of quorum systems
Information and Computation
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
The Load and Availability of Byzantine Quorum Systems
SIAM Journal on Computing
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Secure and Scalable Replication in Phalanx
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Secure reliable multicast protocols in a WAN
Distributed Computing
Distributed Computing
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks
IEEE Transactions on Dependable and Secure Computing
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Randomized registers and iterative algorithms
Distributed Computing
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Distributed Computing - Special issue: PODC 04
ACM Transactions on Information and System Security (TISSEC)
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
ACM SIGACT News
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
A distributed location service for MANET using swarm intelligence
MWS'09 Proceedings of the 2009 IEEE conference on Mobile WiMAX
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Research of replication mechanism in P2P network
WSEAS Transactions on Computers
Consistability: describing usually consistent systems
HotDep'08 Proceedings of the Fourth conference on Hot topics in system dependability
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distributed double spending prevention
Proceedings of the 15th international conference on Security protocols
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
ELS: energy-aware some-for-some location service for ad hoc mobile networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Byzantine and multi-writer k-quorums
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Core persistence in peer-to-peer systems: relating size to lifetime
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
On the availability of non-strict quorum systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that can be achieved with these techniques. Copyright 2001 Academic Press.