Affiliation:
1. Hewlett-Packard Laboratories, Palo Alto, CA, USA
2. Microsoft Research Ltd., Cambridge, UK
Abstract
Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional “pessimistic” systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference138 articles.
1. Adly N. 1995. Management of replicated data in large scale systems. Ph.D. thesis Corpus Cristi College University of Cambridge.]] Adly N. 1995. Management of replicated data in large scale systems. Ph.D. thesis Corpus Cristi College University of Cambridge.]]
2. Lazy consistency using loosely synchronized clocks
3. Epidemic algorithms in replicated databases (extended abstract)
4. Albitz P. and Liu C. 2001. DNS and BIND 4th Ed. O'Reilly & Associates. Sebastopol CA. ISBN 0-596-00158-4.]] Albitz P. and Liu C. 2001. DNS and BIND 4th Ed. O'Reilly & Associates. Sebastopol CA. ISBN 0-596-00158-4.]]
5. Panasync
Cited by
285 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Approaches to Conflict-free Replicated Data Types;ACM Computing Surveys;2024-09-09
2. Quantifying the Performance of Conflict-free Replicated Data Types in InterPlanetary File System;Proceedings of the 4th International Workshop on Distributed Infrastructure for the Common Good;2023-12-11
3. Efficient Synchronization of CRDTs using VCube-PS;12th Latin-American Symposium on Dependable and Secure Computing;2023-10-16
4. Algebra of Data Reconciliation;Studia Scientiarum Mathematicarum Hungarica;2022-12-14
5. Efficient Renaming in Sequence CRDTs;IEEE Transactions on Parallel and Distributed Systems;2022-12-01