基于物理拓扑分组的Chord算法  

Improved chord algorithm based on physical topology

作　　者：邓亚平[1] 杜欢[1] 

机构地区：[1]重庆邮电大学计算机科学与技术学院,重庆400065

出　　处：《计算机工程与设计》2012年第10期3734-3738,共5页Computer Engineering and Design

摘　　要：为了解决Chord模型中节点物理拓扑结构和逻辑拓扑结构不统一,以及查询绕路问题,提出了基于物理拓扑分组的改进的Chord模型。在节点加入Chord网络时考虑了节点的物理位置信息,对节点进行了分域管理。在此基础上建立了节点的邻居表,根据Chord原始查询算法,设计了一种同时考虑节点指取表与邻居表的查询算法,从而有效解决了节点查询的绕路问题。使用Peersim作为仿真软件,选用事件驱动器,对不同规模网络进行了仿真实验,实验结果表明查询物理路径明显减少,查询效率提高。To solve disunity of physical topology and logical topology of node in Chord modle and detour problem when querying, a modified Chord modle based on physical topology is presented. Firstly, node＇ s information of physical position is considered when node is joining in network, nodes are managed by groups, and neighbor table is constructed. Then a new query algorithm considers finger table and neighbor table is presented based on original Chord query algorithm, the eases to solve detour problem. Peersim is used as simulation software, Selection of event drive, severl simulation experiments are done on different scale net- work. Experiments show that, the query physical path is significantly reduced.

关 键 词：结构化P2P网络 物理拓扑 Chord查询算法 哈希表 邻居表 

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