Skip to Main content Skip to Navigation
New interface
Journal articles

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 metadata

Cited literature [105 references]  Display  Hide  Download
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Thursday, December 24, 2015 - 9:43:13 AM
Last modification on : Friday, November 18, 2022 - 9:23:25 AM
Long-term archiving on: : Friday, March 25, 2016 - 11:11:23 AM


Files produced by the author(s)



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



Record views


Files downloads