基于Chord的对等网络内容搜索技术的研究  

Research and Optimization of Content Search in Peer-to-Peer Network Based on Chord

作　　者：吴媛媛[1] 李斌[1] 孙春奇[1] 许政[1] 

机构地区：[1]哈尔滨工业大学网络与信息安全研究中心,哈尔滨150001

出　　处：《微计算机信息》2011年第1期164-166,共3页Control & Automation

摘　　要：结构化对等网络中,如何有效地进行资源查找是一个非常关键的问题。Chord是一种典型的结构化对等网络模型,它提供有效的路由算法,但是路由表中信息有限,查找效率并不高。本文提出一种基于Chord的A-Chord算法,它采用一种新的改进路由表结构的方式,并修改了Chord的资源查找机制。理论和实验结果证明,结点数为N的A-Chord与Chord相比,有效降低了平均查找路径长度,查找复杂度为O(log5N),提高了资源查找的效率。In structured peer-to-peer network,how to find resources effectively is a key issue.Chord is a typical structured peerto-peer network model,it provides an efficient routing algorithm,however,it has low search efficiency because the limited information in routing table.A-Chord algorithm which based on Chord is proposed in this paper.A-Chord uses a new way to improve the routing table structure and modify the mechanism to find resources in Chord.Both the theoretical and experimental results show that A-Chord can reduce the average lookup path length to O（log5N） and improve the efficiency of resource discovery.

关 键 词：对等网络 CHORD 路由表 平均查找路径长度 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]