Affiliation:
1. Microsoft Research, Cambridge, United Kingdom
2. Rice University, Houston, TX
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, Internet-based 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 trace-driven 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%.
Publisher
Association for Computing Machinery (ACM)
Reference30 articles.
1. Napster. http://www.napster.com/.]] Napster. http://www.napster.com/.]]
2. The Gnutella protocol specification 2000. http: / / dss.clip2.com/GnuteUaProtocolO4.pdf.]] The Gnutella protocol specification 2000. http: / / dss.clip2.com/GnuteUaProtocolO4.pdf.]]
3. The design and implementation of an intentional naming system
Cited by
131 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献