Skip to main content

Scaling Optimistic Replication

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2584))

Abstract

Replication improves the performance and availability of sharing information in a largescale network. Classical, pessimistic replication incurs network access before any access, in order to avoid conflicts and resulting stale reads and lost writes. Pessimistic protocols assume some central locking site or necessitate distributed consensus. The protocols are fragile in the presence of network failures, partitioning, or denial-of-service attacks. They are safe (i.e., stale reads and lost writes do not occur) but at the expense of performance and availability, and they do not scale well.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Balasubramaniam and Benjamin C. Pierce. What is a file synchronizer? In Int. Conf. on Mobile Comp. and Netw. (MobiCom’ 98). ACM/IEEE, October 1998.

    Google Scholar 

  2. Per Cederqvist, Roland Pesch, et al. Version management with CVS, 2001. http://www.cvshome.org/docs/manual.

  3. Richard A. Golding. Design choices for weak-consistency group communication. Technical report, UC Santa Cruz, December 1992.

    Google Scholar 

  4. Jim Gray, Pat Helland, Patrick O’Neil, and Dennis Shasha. Dangers of replication and a solution. In Int. Conf. on Management of Data, pages 173–182, Montréal, Canada, June 1996.

    Google Scholar 

  5. Brian Kantor and Phil Rapsey. RFC977: Network news transfer protocol. http://info.internet.isi.edu/in-notes/rfc/files/rfc977.txt, February 1986.

  6. Patrick E. O’Neil. The Escrow transactional method. ACM Transactions on Database Systems, 11(4):405–430, December 1986.

    Article  Google Scholar 

  7. Karin Petersen, Mike J. Spreitzer, Douglas B. Terry, Marvin M. Theimer, and Alan J. Demers. Flexible update propagation for weakly consistent replication. In 16th Symp. on Op. Sys. Principles (SOSP), pages 288–301, St. Malo, France, October 1997.

    Google Scholar 

  8. Nuno Preguiça, Marc Shapiro, and Caroline Matheson. Effficient semantics-aware reconciliation for optimistic write sharing. Technical Report MSR-TR-2002-52, Microsoft Research, Cambridge (UK), May 2002.

    Google Scholar 

  9. Norman Ramsey and Elδ Csirmaz. An algebraic approach to file synchronization. In 9th Int. Symp. on the Foundations of Softw. Eng. (FSE), Austria, September 2001.

    Google Scholar 

  10. Neil Rhodes and Julie McKeehan. Palm Programming: The Developer’s Guide. O’Reilly, December 1998.

    Google Scholar 

  11. Yasushi Saito, Christos Karamanolis, Magnus Karlsson, and Mallik Mahalingam. Taming aggressive replication in the pangaea wide-area file system. In Symp. on Op. Sys. Design and Impl. (OSDI), Boston, MA, USA, 2002.

    Google Scholar 

  12. Yasushi Saito and Marc Shapiro. Replication: Optimistic approaches. Technical Report HPL-2002-33, Hewlett-Packard Laboratories, February 2002.

    Google Scholar 

  13. Robert Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Sys. (TODS), 4(2):180–209, June 1979.

    Article  Google Scholar 

  14. An-I Andy Wang, Peter Reiher, and Rajive Bagrodia. A simulation framework and evaluation for optimistically replicated filing environments. Technical Report CSD-010046, Computer Science Department, University of California, Los Angeles, Los Angeles CA (USA), 2001.

    Google Scholar 

  15. Haifeng Yu and Amin Vahdat. Design and evaluation of a continuous consistency model for replicated services. In 4th Symp. on Op. Sys. Design and Implemen. (OSDI), pages 305–318, San Diego, CA, USA, October 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Shapiro, M., Saito, Y. (2003). Scaling Optimistic Replication. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-37795-6_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00912-2

  • Online ISBN: 978-3-540-37795-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics