Optimistic replication

DMCA

Optimistic replication (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yasushi Saito , Marc Shapiro

Venue:	ACM COMPUTING SURVEYS
Citations:	273 - 15 self

BibTeX

@ARTICLE{Saito05optimisticreplication,
    author = {Yasushi Saito and Marc Shapiro},
    title = {Optimistic replication},
    journal = {ACM COMPUTING SURVEYS},
    year = {2005},
    volume = {37},
    pages = {42--81}
}

OpenURL

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.

Keyphrases

optimistic replication optimistic replication algorithm comprehensive survey key technology low-quality communication link optimistic algorithm propagates change traditional pessimistic one synchronous replica coordination final content key challenge discovers conflict solution space data replication optimistic replication technique concurrent work practice short term optimistic replication system replica divergence replica content mobile network

DMCA