首页 | 官方网站   微博 | 高级检索  
     

基于GFS-Net的动态复制
引用本文:夏前军,李庆虎,叶晓俊.基于GFS-Net的动态复制[J].计算机科学,2005,32(8):67-69.
作者姓名:夏前军  李庆虎  叶晓俊
作者单位:清华大学软件学院,北京,100084;清华大学软件学院,北京,100084;清华大学软件学院,北京,100084
基金项目:国家863项目(2003AA4132301).
摘    要:GFS-Net是一种新的DHT覆盖网络。本文介绍了GFS-Net的拓扑结构,并完善了其搜索算法,提出了与GFS-Net相适应的动态复制算法,它包括两个部分:(1)根据文件的请求频率增减副本数目;(2)根据下裁性能较低的站点的分布确定新增副本的位置。该算法可以根据副本的请求频率和分布,动态调整副本的数目和分布,平衡各个站点的负载,降低用户下裁文件的响应时间。

关 键 词:P2P  覆盖网络  GFS-Net  动态复制

Dynamic Replication Based on GFS-Net
Xia QianJun;Li QingHu;Xie XiaoJun.Dynamic Replication Based on GFS-Net[J].Computer Science,2005,32(8):67-69.
Authors:Xia QianJun;Li QingHu;Xie XiaoJun
Abstract:GFS-Net is a new DHT overlay network. This paper introduces its topology, a search algorithm used in searching useful information over the network, and a dynamic replicating algorithm which mainly consists of two steps: determine the number of replicas per file based on request frequencies and change the locations of replicas according to the distribution of those sites of poor downloading performance. The major advantages of the algorithm are dynamic ad- justment of the number and the distribution of replicas, automatic load balancing for each site, and reducing the re- sponse time when downloading files from the network.
Keywords:P2P  Overlay network  GFS-Net  Dynamic replication
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号