A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Disconnected operation in the Coda file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
The availability of quorum systems
Information and Computation
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Dynamic voting for consistent primary components
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
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
Optimal availability quorum systems: theory and practice
Information Processing Letters
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Session guarantees for weakly consistent replicated data
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Scalable Update Propagation in Epidemic Replicated Databases
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Mariposa: a wide-area distributed database system
The VLDB Journal — The International Journal on Very Large Data Bases
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Replicated document management in a group communication system
CSCW '88 Proceedings of the 1988 ACM conference on Computer-supported cooperative work
Efficient synchronization for mobile XML data
Proceedings of the eleventh international conference on Information and knowledge management
A Survey of Mobile Transactions
Distributed and Parallel Databases
Safety, Visibility, and Performance in a Wide-Area File System
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
A declarative approach to agent-centered context-aware computing in ad hoc wireless environments
Software engineering for large-scale multi-agent systems
Towards organic active vision systems for visual surveillance
ARCS'11 Proceedings of the 24th international conference on Architecture of computing systems
Safety, visibility, and performance in a wide-area file system
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Hi-index | 0.00 |
We describe a new replicated‐object protocol designed for use in mobile and weakly‐connected environments. The protocol differs from previous protocols in combining epidemic information propagation with voting, and in using fixed per‐object currencies for voting. The advantage of epidemic protocols is that data movement only requires pair‐wise communication. Hence, there is no need for a majority quorum to be available and simultaneously connected at any single time. The protocols increase availability by using voting, rather than primary‐copy or primary‐commit schemes. Finally, the use of per‐object currencies allows voting to take place in an entirely decentralized fashion, without any server having complete knowledge of group membership. We show that currency allocation can be used to implement diverse policies. For example, uniform currency distributions emulate traditional voting schemes, while allocating all currency to a single server emulates a primary‐copy scheme. We present simulation results showing both schemes, as well as the performance advantages of using currency proxies to temporarily reallocate currency during planned disconnections. Furthermore, we discuss an initial design of the underlying replicated‐object system and present a basic API.