Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
复制标题
DOI：
10.1145/502034.502053
复制
发表时间：
2001-10
期刊：
影响因子：
--
通讯作者：
A. Rowstron;P. Druschel
中科院分区：
文献类型：
--
作者：
A. Rowstron;P. Druschel
本文介绍和评估的存储管理和缓存在PAST，一个大规模的对等持久存储实用程序。PAST是基于一个自组织的、基于互联网的存储节点覆盖网络，这些存储节点协作地路由文件查询、存储文件的多个副本、以及缓存流行文件的附加副本。在PAST系统中，存储节点和文件各自被分配均匀分布的标识符，并且文件的副本被存储在标识符与文件的标识符最接近地匹配的节点处。这种将文件统计分配到存储节点的方式大致平衡了每个节点上存储的文件数量。然而，非均匀的存储节点容量和文件大小需要更显式的存储负载平衡，以在高全局存储利用率下实现优雅的行为;同样，文件的非均匀流行度需要缓存来最小化获取距离并平衡查询负载。我们介绍并评估PAST，重点是它的存储管理和缓存系统。广泛的跟踪驱动的实验表明，该系统最大限度地减少了取距离，它平衡了流行的文件的查询负载，它显示优雅的性能下降，作为全球存储利用率增加超过95%。
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%.