Detection of mutual inconsistency in distributed systems
Distributed systems, Vol. II: distributed data base systems
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Light-Weight Currency Management Mechanisms in Mobile and Weakly-Connected Environments
Distributed and Parallel Databases
Roam: A Scalable Replication System for Mobile Computing
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
MODELING REPLICA DIVERGENCE IN A WEAK-CONSISTENCY PROTOCOL FOR GLOBAL-SCALE DISTRIBUTED DATA BASES
MODELING REPLICA DIVERGENCE IN A WEAK-CONSISTENCY PROTOCOL FOR GLOBAL-SCALE DISTRIBUTED DATA BASES
ACM Computing Surveys (CSUR)
A mechanism for replicated data consistency in mobile computing environments
Proceedings of the 2007 ACM symposium on Applied computing
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
A distributed protocol for ensuring replicated database consistency in mobile computing environments
Proceedings of the 2010 ACM Symposium on Applied Computing
Decentralised commitment for optimistic semantic replication
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
| Hi-index | 0.00 |
Mobile and other loosely-coupled environments call for decentralized optimistic replication protocols that provide highly available access to shared objects, whilst ensuring an eventual convergence towards a strongly consistent state. In this paper we propose a novel epidemic weighted voting protocol for achieving such goal. Epidemic weighted voting approaches eliminate the single point of failure limitation of primary commit approaches. Our protocol introduces a significant improvement nover other epidemic weighted voting solutions by allowing multiple, causally related updates to be committed at a single distributed election round. We demonstrate that our proposed protocol is especially advantageous with the weak connectivity levels that characterize mobile and other loosely-coupled networks. We support such assumptions by presenting comparison results obtained from side-by-side execution of reference protocols in a simulated environment.