地理异构的超级邻接路由算法  

SUPER PROXIMITY ROUTING ALGORITHM IN HETEROGENEOUS GEOGRAPHY ENVIRONMENT

作　　者：吴增德[1] 傅律君[1] 黄新力[2] 

机构地区：[1]华东理工大学计算机科学与工程系,上海200237 [2]华东师范大学计算机科学技术系,上海200241

出　　处：《计算机应用与软件》2010年第9期7-8,62,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(60803127)

摘　　要：在结构化对等网络中,结点基于结点标识选择下一路由跳。路由过程与IP网络独立,路由时延较高。针对结构化对等网络路由时延较高的问题,提出了超级邻接路由算法,该算法在选择路由时同时考虑了对等网络路由表和IP网络的邻近性。把对等网络连接矩阵表示为R,IP网络连接矩阵表示为T。提出的超级邻接路由算法通过R×T2连接矩阵选择下一路由跳。实验结果表明,超级邻接路由算法极大地提高了路由效率、降低了对等结点平均负载。In structured P2P networks, the node selects next hop based on the node identifier （ID）. The routing path selection is inde- pendent to IP networks, which cause higher routing latency. Aiming at improving the efficiency of structured P2P routing algorithms, this pa- per proposed the super proximity routing algorithm, which takes the P2P routing table and the proximity of IP network into consideration while selecting routing. Let R be the connection matrix of P2P network, T be the connection matrix of IP network. The super proximity routing algo- rithm which we proposed selects next hop through the connection matrix R × T2. Experimental results show that, the super proximity routing algorithm greatly improves the routing efficiency, and lowers the average load of P2P nodes.

关 键 词：分布式系统 对等网络 路由 

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