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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ross Anderson. The eternity service. Proceedings of Pragocrypt, 1996.
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.
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.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
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.
Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system, 2000.
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.
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.
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.
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/.
Gnutella. See http://gnutelladev.wego.com.
Leslie A. Hall. Approximation algorithms for scheduling. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1995.
Sandy Irani and Anna R. Karlin. Online computation. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1995.
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.
Napster. See http://www.napster.com.
Roger T. Reich and Doyle Albee. S.M.A.R.T. phase-II. White paper WP-9803-001, Maxtor Corporation, February 1998.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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