Skip to main content
SpringerLink
Log in

Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation

  • Conference paper
  • First Online:
Algorithms — ESA 2001 (ESA 2001)

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

Included in the following conference series:

Abstract

We examine the replica placement aspect of a distributed peer-to-peer file system that replicates and stores files on ordinary desktop computers. It has been shown that some desktop machines are available for a greater fraction of time than others, and it is crucial not to place all replicas of any file on machines with low availability. In this paper we study the efficacy of three hill-climbing algorithms for file replica placement. Based on large-scale measurements, we assume that the distribution of machine availabilities be uniform. Among other results we show that the MinMax algorithm is competitive, and that for growing replication factor the MinMax and MinRand algorithms have the same asymptotic worst-case efficacy.

Due to lack of space we omit most of the proofs in this extended abstract. The complete paper is available as Microsoft Research technical report MSR-TR-2001-62.

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. Ross Anderson. The eternity service. Proceedings of Pragocrypt, 1996.

    Google Scholar 

  2. Thomas E. Anderson, Michael Dahlin, Jeanna M. Neefe, David A. Patterson, Drew S. Roselli, and Randolph Wang. Serverless network file systems. ACM Transactions on Computer Systems, 14(1):41–79, February 1996.

    Google Scholar 

  3. William J. Bolosky, John R. Douceur, David Ely, and Marvin Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computing Systems, 2000.

    Google Scholar 

  4. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

    Google Scholar 

  5. Yuan Chen, Jan Edler, Andrew Goldberg, Allan Gottlieb, Sumeet Sobti, and Peter Yianilos. A prototype implementation of archival intermemory. In Proceedings of the Fourth ACM International Conference on Digital Libraries, 1999.

    Google Scholar 

  6. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system, 2000.

    Google Scholar 

  7. Edward G. Coffman, M.R. Garey, and David S. Johnson. Appromxiation algorithms for bin packing: A survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1995.

    Google Scholar 

  8. John Douceur and William Bolosky. A large-scale study of file-system contents. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computing Systems, pages 59–70, New York, May 1–4 1999.

    Google Scholar 

  9. John Douceur and Roger Wattenhofer. Competitive hill-climbing strategies for replica placement in a distributed file system. In Proceedings of the 15th International Symposium on Distributed Computing, 2001.

    Google Scholar 

  10. John Douceur and Roger Wattenhofer. Optimizing file availability in a server-less distributed file system. In Proceedings of the 20th Symposium on Reliable Distributed Systems, 2001. Also see http://research.microsoft.com/sn/farsite/.

  11. Gnutella. See http://gnutelladev.wego.com.

  12. Leslie A. Hall. Approximation algorithms for scheduling. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1995.

    Google Scholar 

  13. Sandy Irani and Anna R. Karlin. Online computation. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1995.

    Google Scholar 

  14. John Kubiatowicz, David Bindel, Patrick Eaton, Yan Chen, Dennis Geels, Ramakr-ishna Gummadi, Sean Rhea, Westley Weimer, Chris Wells, Hakim Weatherspoon, and Ben Zhao. OceanStore: An architecture for global-scale persistent storage. A CM SIGPLAN Notices, 35(11):190–201, November 2000.

    Google Scholar 

  15. Napster. See http://www.napster.com.

  16. Roger T. Reich and Doyle Albee. S.M.A.R.T. phase-II. White paper WP-9803-001, Maxtor Corporation, February 1998.

    Google Scholar 

  17. Chandramohan A. Thekkath, Timothy Mann, and Edward K. Lee. Frangipani: A scalable distributed file system. In Proceedings of the 16th Symposium on Operating Systems Principles (SOSP-97), volume 31,5 of Operating Systems Review, pages 224–237, New York, October 5–8 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, Redmond, WA, 98052, USA

    John R. Douceur & Roger P. Wattenhofer

Authors
  1. John R. Douceur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roger P. Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, 33095, Paderborn, Germany

    Friedhelm Meyer auf der Heide

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Douceur, J.R., Wattenhofer, R.P. (2001). Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44676-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44676-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation