Best-effort cache synchronization with source cooperation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Weakly Coupled Adaptive Gossip Protocol for Application Level Active Networks
POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
Effective page refresh policies for Web crawlers
ACM Transactions on Database Systems (TODS)
A mechanism for replicated data consistency in mobile computing environments
Proceedings of the 2007 ACM symposium on Applied computing
A distributed protocol for ensuring replicated database consistency in mobile computing environments
Proceedings of the 2010 ACM Symposium on Applied Computing
Meaningful metrics for evaluating eventual consistency
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
An efficient and fault-tolerant update commitment protocol for weakly connected replicas
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Distributed database systems for wide-area networks must scale to very large numbers of replicas in order to provide acceptable availability and response time. Weak-consistency replication protocols, such as the *timestamped anti-entropy* (TSAE) protocol we have developed, allow a database to scale to hundreds or thousands of replicas. The TSAE protocol allows updates to be processed by a single replica, then propagated from one replica to another in the background, causing replicas to temporarily diverge. The divergence is resolved in a short time and is resolved correctly even in the presence of temporary replica failure and network partition. We present a detailed analysis of the update propagation latency and the divergence between replicas caused by this protocol.