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
Type de document :
Article dans une revue
ACM Computing Surveys, Association for Computing Machinery, 2005, 37 (1), pp.42--81. 〈10.1145/1057977.1057980〉
Liste complète des métadonnées

Littérature citée [105 références]  Voir  Masquer  Télécharger

Contributeur : Alain Monteil <>
Soumis le : jeudi 24 décembre 2015 - 09:43:13
Dernière modification le : jeudi 28 décembre 2017 - 13:58:02
Document(s) archivé(s) le : vendredi 25 mars 2016 - 11:11:23


Fichiers produits par l'(les) auteur(s)




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〉



Consultations de la notice


Téléchargements de fichiers