Optimistic Replication Algorithms (2000)
| Venue: | International Symposium on Distributed Computing |
| Citations: | 8 - 0 self |
BibTeX
@TECHREPORT{Saito00optimisticreplication,
author = {Yasushi Saito},
title = {Optimistic Replication Algorithms},
institution = {International Symposium on Distributed Computing},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Optimistic replication algorithms allow replica contents to be stale but in a controlled way. By propagating updates in background and allowing any replica to be read most of the time, they become more available and more efficient than traditional replication algorithms using unreliable network media and inexpensive computers. The use of optimistic replication has recently grown explosively due to the proliferation of the Internet and mobile computing devices, but its systematic study has begun only recently. We survey optimistic replication algorithms in this report. In particular, we focus on the update propagation mechanisms invented for optimistic replication and study how these mechanisms affect the functional characteristics of the systems, including data consistency guarantees and performance.
Keyphrases
optimistic replication optimistic replication algorithm survey optimistic replication algorithm traditional replication allow replica content unreliable network medium data consistency guarantee functional characteristic update propagation mechanism systematic study controlled way inexpensive computer
