GcChord:基于组和缓存的改进型DHT网络  

GcChord:enhanced DHT networks based on group and cache

作　　者：曲广强[1] 胡勇[1] 王贵竹[1] 

机构地区：[1]安徽大学电子科学与技术学院计算智能与信号处理教育部重点实验室,合肥230039

出　　处：《计算机工程与应用》2007年第29期132-134,139,共4页Computer Engineering and Applications

摘　　要：在基于DHT技术的对等网络中,一个重要的研究内容是减少逻辑网络和物理网络不匹配所带来的寻路时延过长的问题。文章提出一种利用组来匹配物理网络,利用超级节点缓存查询和地址信息,并且在普通节点收到查询请求时缓存查询源节点地址信息的路由算法GcChord(Group Cache based Chord)。仿真结果表明,GcChord的路由性能优于Chord系统,并且节点重复(有一定倾向)查询越多,其平均物理、逻辑跳数越少。Due to the mismatch between P2P overlay network and physical network,the routing latency is inefficient.This paper shows the idea that a topology-aware routing approach which uses groups and caches---GcChord（Group Cache based Chord）.Experiment results demonstrate that GcChord improves the routing performance effectively,especially when nodes are apt to send some query more than others ,both of the average logical hops and physical hop are improved observably.

关 键 词：对等网络 组 拓扑匹配 缓存 Chord系统 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]