MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Consistency Management in Optimistic Replication Algorithms

Download:
pdf
unknown authors
http://www.hpl.hp.com/personal/Yasushi_Saito/replica.pdf
Add To MetaCart

Abstract:

Optimistic replication algorithms allow replica contents to become stale but in a controlled way. In return, they become far more efficient and available than traditional replication algorithms that keep all the replicas consistent, especially when the network and computers are unreliable. The use of optimistic replication has grown explosively due to the proliferation of the use of the Internet and mobile computing devices, but its systematic study has begun only recently. This report surveys optimistic replication algorithms. In particular, it focuses on mechanisms for propagating updates among replicas and studies how they affect the functional characteristics of the systems, including data consistency guarantees and performance. 1

Citations

1747 Time, clocks and the ordering of events in a distributed system – Lamport - 1978
1320 Concurrency Control and Recovery in Database Systems – Bernstein, Hadzilacos, et al. - 1987
1074 Impossibility of distributed consensus with one faulty process – Fischer, Lynch, et al. - 1985
796 Distributed snapshots: Determining global states of distributed systems – Chandy, Lamport - 1985
749 Disconnected Operation in the CODA file system – Satyanarayanan, Kistler - 1992
540 Lightweight causal and atomic group multicast – Birman, Schiper, et al. - 1991
501 Virtual time and global states of distributed systems – Mattern - 1989
459 Weighted voting for replicated data – Gifford - 1979
456 A Hierarchical Internet Object Cache – Chankhunthod, Danzig, et al. - 1996
449 Reliable communication in the presence of failures – Birman, Joseph - 1987
417 Epidemic algorithms for replicated database maintenance – Demers, Greene, et al. - 1987
375 Measurements of a Distributed File System – Baker, Hartman, et al. - 1991
353 Practical byzantine fault tolerance – Castro, Liskov - 1999
344 The dangers of replication and a solution – Gray, Helland, et al.
282 Managing update conflicts in bayou, a weakly connected replicated storage system – Terry, Theimer, et al. - 1995
278 A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases – THOMAS - 1979
226 A trace-driven analysis of the UNIX 4.2 BSD file system – Ousterhout, Costa, et al. - 1985
221 On the Scale and Performance of Cooperative Web Proxy Caching – Wolman, Voelker, et al. - 1999
207 Flexible update propagation for weakly consistent replication – Petersen, Spreitzer, et al. - 1997
195 Data caching issues in an information retrieval system – Alonso, Barbará, et al. - 1990
173 Grapevine: An exercise in distributed computing – BIRRELL, LEVIN, et al. - 1982
168 K.: Development of the Domain Name System – Mockapetris, Dunlap - 1988
164 Consistency in Partitioned Networks – Davidson, García-Molina, et al. - 1985
163 Exploiting weak connectivity for mobile file access – Mummert, Ebling, et al. - 1995
148 Replica control in distributed system: An asynchronous approach – Pu, Leff - 1991
142 World-Wide Web Cache Consistency – Gwertzman, Seltzer - 1996
128 Design and evaluation of a continuous consistency model for replicated services – Yu, Vahdat - 2000
122 Session guarantees for weakly consistent replicated data – Terry, Demers, et al. - 1994
118 Improved algorithms for synchronizing computer network clocks – Mills - 1994
101 Weak Consistency group communications and memberships – Golding - 1992
96 Manageability, availability and performance in Porcupine: A highly scalable, cluster-based mail service – Saito, Bershad, et al. - 1999
94 Detection of mutual inconsistency in distributed systems – PARKER, POPEK, et al. - 1983
84 Efficient solutions to the replicated log and dictionary problems – WUU, BERNSTEIN - 1984
83 Optimistic Deltas for WWW Latency Reduction – Banga, Douglis, et al. - 1997
79 Flexible and safe resolution of file conflicts – Kumar, Satyanarayanan - 1995
70 Epidemic algorithms in replicated databases – AGRAWAL, ABBADI, et al. - 1997
68 The Escrow Transactional Method – O'Neil - 1986
66 Ashutosh Rege. A digital fountain approach to reliable distribution of bulk data – Byers, Luby, et al. - 1998
63 RFC977: Network news transfer protocol. Available at http://www. faqs.org/rfcs/rfc977.html – KANTOR, P - 1986
60 Decentralized replicated-object protocols – Keleher - 1999
59 Logbased directory resolution in the Coda file system – Kumar, Satyanarayanan - 1993
53 Hierarchical cache consistency in a WAN – YIN, ALVISI, et al. - 1999
36 Rfc 2616: Hypertext transfer protocol – Fielding, Gettys, et al. - 1999
36 RFC 1035: Domain names — implementation and specification – Mockapetris - 1987
34 RFC 1305: Network time protocol (version 3) specification, implementation – Mills - 1992
32 Drinking from the firehose: Multicast USENET news – LIDL, OSBORNE, et al. - 1994
32 ROAM: A scalable replication system for mobile and distributed computing – Ratner - 1997
31 Efficient update propagation in epidemic replicated databases – RABINOVICH, GEHANI, et al. - 1996
28 Khazana: An Infrastructure for Building Distributed Services – Carter, Ranganathan, et al.
27 Two phase gossip: Managing distributed event histories – Heddaya, Hsu, et al. - 1989