Optimistic Replication

Abstract : Data replication is a key technology in distributed data sharing systems, enabling higher availability and performance. This paper surveys optimistic replication algorithms that allow replica contents to diverge in the short term, in order to support concurrent work practices and to 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 techniques are different from traditional ?pessimistic? ones. 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 paper 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.
keyword : optim rep syn
Complete list of metadatas

Cited literature [102 references]  Display  Hide  Download

https://hal.inria.fr/inria-00444768
Contributor : Marc Shapiro <>
Submitted on : Thursday, January 7, 2010 - 11:42:35 AM
Last modification on : Thursday, December 28, 2017 - 1:58:02 PM
Long-term archiving on : Friday, June 18, 2010 - 12:29:55 AM

File

tr-2003-60.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00444768, version 1

Collections

Citation

Yasushi Saito, Marc Shapiro. Optimistic Replication. [Technical Report] Microsoft Research. 2003. ⟨inria-00444768⟩

Share

Metrics

Record views

169

Files downloads

945