• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility (2001)

Cached

  • Download as a PDF

Download Links

  • [www.mpi-sws.mpg.de]
  • [iris.csail.mit.edu]
  • [www.cs.rice.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.uoi.gr]
  • [www.ssrc.ucsc.edu]
  • [www.cs.ucsd.edu]
  • [www.eecg.toronto.edu]
  • [sosp.org]
  • [www.cs.virginia.edu]
  • [www.cs.wisc.edu]
  • [www.research.microsoft.com]
  • [www.cs.cornell.edu]
  • [www.cs.rice.edu]
  • [www.cs.rice.edu]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.research.microsoft.com]
  • [www.cs.cornell.edu]
  • [research.microsoft.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Antony Rowstron , Peter Druschel
Citations:607 - 22 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2

Version History

Metadata Version 2

User correction supplied by mph

DatumValueSource
TITLE Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility SVM HeaderParse 0.2
AUTHOR NAME Antony Rowstron user correction
AUTHOR AFFIL Microsoft Research user correction
AUTHOR ADDR St. George House, 1 Guildhall Street; Cambridge, CB2 3NH, United Kingdom. user correction
AUTHOR NAME Peter Druschel user correction
ABSTRACT This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache additional copies of popular files. In the PAST system, storage nodes and files are each assigned uniformly distributed identifiers, and replicas of a file are stored at nodes whose identifier matches most closely the file’s identifier. This statistical assignment of files to storage nodes approximately balances the number of files stored on each node. However, non-uniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, non-uniform popularity of files requires caching to minimize fetch distance and to balance the query load. We present and evaluate PAST, with an emphasis on its storage management and caching system. Extensive tracedriven experiments show that the system minimizes fetch distance, that it balances the query load for popular files, and that it displays graceful degradation of performance as the global storage utilization increases beyond 95%. user correction
YEAR 2001 INFERENCE
VENUE TYPE CONFERENCE INFERENCE
PAGES 188--201 INFERENCE
CITATIONS 30 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University