Skip to main content
SpringerLink
Log in

Optimistic Replication for Internet Data Services

  • Conference paper
  • First Online:
Distributed Computing (DISC 2000)

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

Included in the following conference series:

Abstract

We present a new replication algorithm that supports repli- cation of a large number of objects on a diverse set of nodes. The algo- rithm allows replica sets to be changed dynamically on a per-object basis. It tolerates most types of failures, including multiple node failures, net- work partitions, and sudden node retirements. These advantages make the algorithm particularly attractive in large cluster-based data services that experience frequent failures and configuration changes. We prove the correctness of the algorithm and show that its performance is near- optimal.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yair Amir. Replication using group communication over a partitioned network. PhD thesis, Hebrew University of Jerusalem, 1995.

    Google Scholar 

  2. Gaurav Banga, Fred Douglis, and Michael Rabinovich. Optimistic deltas for WWW latency reduction.In USENIX Annual Technical Conference, 1997.

    Google Scholar 

  3. P. Bernstein and E. Newcomer.Principles of Tranasction Processing. Morgan Kaufmann, 1997.

    Google Scholar 

  4. K. Birman and T. Joseph.Reliable communication in the presence of failures. ACM Trans, on Computer Systems, 5(1):272–314, February 1987.

    Article  Google Scholar 

  5. Flaviu Christian and Frank Schmuck. Agreeing on processor group membership in asynchronous distributed systems.Technical Report CSE95-428, UC San Diego, 1995.

    Google Scholar 

  6. A. Demers, D. Greene, C. Hauser, W. Irish, and J. Larson. Epidemic algorithms for replicated database maintenance.In ACM Symp. on Princ. of Distr. Computing, pages 1–12,1987.

    Google Scholar 

  7. David K. Gifford. Weighted voting for replicated data. In 7th Symp. on Operating Systems Principles, pages 150–162,1979.

    Google Scholar 

  8. M. Harchol-Balter, T. Leighton, and D. Lewin. Resource discovery in distributed networks.In ACM Symp. on Princ. of Distr. Computing, pages 229–237,1999.

    Google Scholar 

  9. Maurice Herlihy. A quorum-consensus replication method for abstract data types. ACM Trans, on Computer Systems, 4(l):32–53, February 1986.

    Article  Google Scholar 

  10. Peter J. Keleher. Decentralized replicated-object protocols. In 18th ACM Symp. on Princ. of Distr. Computing, April 1999.

    Google Scholar 

  11. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.

    Article  MATH  Google Scholar 

  12. Barbara Liskov, Liuba Shrira, and John Wroclawski. Efficient at-most-once mes-sages based on synchronized clocks. ACM Trans, on Computer Systems, 9(2): 125–142, 1991.

    Article  Google Scholar 

  13. Microsoft. Windows 2000 Server Resource Kit. Microsoft Press, 2000.

    Google Scholar 

  14. David L. Mills. Improved algorithms for synchronizing computer network clocks. In SIGCOMM, pages 317–327, London, UK, September 1994. ACM.

    Google Scholar 

  15. P. V. Mockapetris and K. Dunlap. Development of the domain name system. In ACM SIGCOMM, August 1988.

    Google Scholar 

  16. K. Petersen, M. Spreitzer, D. Terry, M. Theimer, and A. Demers. Flexible update propagation for weakly consistent replication. In 16th Symp. on Operating Systems Principles, pages 288–301, October 1997.

    Google Scholar 

  17. M. Rabinovich, I. Rabinovich, and R. Rajaraman. Dynamic replication on the Internet. Technical Report HA6177000-980305-01-TM, AT&T Labs, March 1998.

    Google Scholar 

  18. David H. Ratner. Roam: A Scalable Replication System for Mobile and Distributed Computing. PhD thesis, UC Los Angeles, 1998. UCLA-CSD-970044.

    Google Scholar 

  19. Y. Saito, B. Bershad, and H. Levy. Manageability, availability and performance in Porcupine: a highly scalable, cluster-based mail service. In 17th Symp. on Operating Systems Principles, December 1999.

    Google Scholar 

  20. Yasushi Saito, Jeffrey Mogul, and Ben Verghese. A Usenet performance study. http://www.research.digital.com/wrl/projects/newsbench/, September 1998.

  21. Robert Thomas. A majority consensus approach to concurrency control for multi-ple copy databases. ACM Trans, on Database Systems, 4(2): 180–209, June 1979.

    Article  Google Scholar 

  22. R.van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Middleware, 1998.

    Google Scholar 

  23. O. Wolfson and S. Jajodia. Distributed algorithms for adaptive replication of data. In 11th ACM Symp. on Princ. of Database Systems, pages 149–163, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Washington, Seattle, WA, 98195, USA

    Yasushi Saito & Henry M. Levy

Authors
  1. Yasushi Saito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henry M. Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saito, Y., Levy, H.M. (2000). Optimistic Replication for Internet Data Services. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation