基于GFS-Net的动态复制  

Dynamic Replication Based on GFS-Net

作　　者：夏前军[1] 李庆虎[1] 叶晓俊[1] 

机构地区：[1]清华大学软件学院,北京100084

出　　处：《计算机科学》2005年第8期67-69,82,共4页Computer Science

基　　金：国家863项目(2003AA4132301)

摘　　要：GFS-Net是一种新的DHT覆盖网络。本文介绍了 GFS-Net的拓扑结构,并完善了其搜索算法,提出了与GFS-Net相适应的动态复制算法,它包括两个部分;(1)根据文件的请求频率增减副本数目;(2)根据下载性能较低的站点的分布确定新增副本的位置。该算法可以根据副本的请求频率和分布,动态调整副本的数目和分布,平衡各个站点的负载,降低用户下载文件的响应时间。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 adjustment of the number and the distribution of replicas, automatic load balancing for each site, and reducing the response time when downloading files from the network.

关 键 词：P2P 覆盖网络 GFS-Net 动态复制 复制 NET 搜索算法 拓扑结构 动态调整 响应时间 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术] Q523[自动化与计算机技术—计算机科学与技术]