基于物理拓扑的双向搜索Chord路由  

Physical Topology-based Bidirectional Search Chord Routing

作　　者：卢卫青[1] 张振宇[1] 龚红翠[1] 沈庆涛[1] 

机构地区：[1]新疆大学信息科学与工程学院,乌鲁木齐830046

出　　处：《计算机工程》2009年第22期117-118,121,共3页Computer Engineering

摘　　要：Chord模型未充分利用逆时针上的路由信息,并且未考虑实际网络拓扑结构,使P2P系统存在高延迟、低效率的问题。针对该问题,充分利用节点路由表信息和节点在物理网络上的邻近性,并用超级节点存储最近同一簇内的查询结果,提出路由算法TB_Chord。模拟实验结果表明,该算法在路径长度、访问延迟方面的性能较Chord有一定的提高。Considering that Chord model does not make good use of the counterclockwise routing information and it does not consider the actual network topology which leads to high latency and low efficiency, this paper presents a routing algorithm, named Topology and Bidirection guided Chord（TB_Chord）, which makes full use of the routing information and takes the proximity of peers in underlying physical network into account. It stores the search results in the super-node in each cluster. Experimental results show that this method is superior to original Chord at path length and access latency.

关 键 词：对等网络 CHORD算法 拓扑 双向搜索 超级节点 

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