期刊文献+

基于双层ID空间的Peer-to-Peer文件系统设计与实现

Design and Implementation of Double ID Space Based Peer-to-Peer File System
下载PDF
导出
摘要 提出并实现了一种建立在Peer-to-Peer 搜索策略上的自组织、自适应、高效和可靠的文件系统DISPFS(Double ID Space basedPeer-to-peer File System)。它在双层ID 空间中构造虚拟存储节点,不仅有效地取得了文件系统内的负载均衡、提高系统利用率,而且保证了动态环境中文件的可靠、快速获取。试验数据表明,DISPFS 在系统接近满负荷运行和文件插入/删除操作频繁的双重压力下依然保持优良的性能。 The design and the implementation of D1SPFS (double ID space based peer-to-Peer file system), a file system based on double ID space, provide a new method to solve 2 key points in file system: load balancing and file availability. In DISPFS, the base ID space provides virtual storage nodes to approach to system load balancing. The virtual storage node maintains k replicas of each file in its responsibility through which strong availability is guaranteed. The upper ID space offers efficient file distribution and tile query through excellent peer-to-peer search service. DISPFS is an efficient and reliable peer-to-peer file systems, and it remains good performance under the conditions of heavy storage overhead and frequent file inserting or file disclaiming.
出处 《计算机工程》 EI CAS CSCD 北大核心 2005年第10期69-71,167,共4页 Computer Engineering
基金 中国科学院知识创新工程定向发布基金资助项目:"大型数字对象应用环境及其并行模拟"(KGCX-JG-09) 国家"863"计划基金资助项目"服务器操作系统"(2002AA1Z2101)
关键词 DISPFS PEER-TO-PEER 文件系统 双层ID空间 虚拟存储节点 DISPFS Peer-to-peer file system Double ID space Virtual storage node
  • 相关文献

参考文献11

  • 1Rowstron A, Druschel P. Pastry: Scalable, Distributed Environment[J].Theory of Computing Systems, 1999, 32:241-280
  • 2Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications[C]. In Proceedings of the ACM SIGCOMM'01 Conference, San Diego, California, 2001-08
  • 3Ratnasamy S, Francis P, Handley M, et al. A Scalable Contentaddressable Network[C]. In Proc. ACM SIGCOMM'01, San Die-go,CA, 2001-08
  • 4Zhao B Y, Kubiatowicz J D, Joseph A D. Tapestry: An Infrastructure of Fault-resilient Wide-area Location and Routing[R]. Technical Report UCB∥CSD-01-114l, U. C. Berkeley, 2001-04
  • 5Rowstron A, Druschel P. Storage Management and Caching in PAST.A Large-scale, Persistent Peer-to-peer Storage Utility[C]. In Proc.ACM SOSP'01, Banff, Canada. 2001 -10
  • 6Druschel P, Rowstron A. PAST: A Large-scale, Persistent Peer-to-peer Storage Utility[C]. In Proc. HotOS Ⅷ, Scholss Elmau, Germany,2001-05
  • 7Dabek F, Kaashoek M F, Karger D, et al. Wide-area Cooperative Storae with CFS[C]. in Proc. ACM SOSP'01, Banff, Canada, 2001-10
  • 8Napster[EB/OL]. http:∥www. napster. com/.
  • 9Byers J, Considine J, Mitzenmacher M. Simple Load Balancing for Distributed Hash Tables[C]. In Proc. IPTPS'03, Berkeley, CA, USA,2003
  • 10Mitzenmacher M, Richa A, Sitaraman R. The Power of Two Random Choices: A Survey of Techniques and Results[D]. Kluwer Academic Publishers, Norwell, MA, Edited by Pardalos P, Rajasekaran S, Reif J,et al. 2001: 255-312

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部