Optimistic Replication

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.
Keywords : optim rep syn
Document type :
Journal articles
Complete list of metadatas

Cited literature [105 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248208
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:13 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on : Friday, March 25, 2016 - 11:11:23 AM

File

Optimistic_Replication_Computi...
Files produced by the author(s)

Identifiers

Collections

Citation

Yasushi Saito, Marc Shapiro. Optimistic Replication. ACM Computing Surveys, Association for Computing Machinery, 2005, 37 (1), pp.42--81. ⟨10.1145/1057977.1057980⟩. ⟨hal-01248208⟩

Share

Metrics

Record views

218

Files downloads

311