基于多环结构的P2P覆盖网络路由算法  

A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology

作　　者：马毅[1] 陈东明[1] 常桂然[2] 谭振华[1] 

机构地区：[1]东北大学软件学院,辽宁沈阳110819 [2]东北大学计算中心,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2013年第1期44-47,共4页Journal of Northeastern University(Natural Science)

基　　金：辽宁省自然科学基金资助项目(20102059);高等学校博士学科点专项科研基金资助项目(20110042120027);中国博士后科学基金资助项目(2012M510826);中央高校基本科研业务费专项资金资助项目(N110417006;N110204003)

摘　　要：P2P系统中采用的随机选择邻居节点的方法会降低路由效率以及增大网络开销.针对这一问题,在分析现有的路由算法的基础上,提出一种基于多环网络拓扑结构的P2P路由算法RMCT.该算法将P2P节点划分为若干簇并设立簇核节点进行管理.RMCT采用常数级别的路由表,设计了节点加入、退出算法以及簇的划分、簇核选举等算法.通过实验与经典Chord算法进行性能对比,证明了RMCT在路由性能方面有明显优势,是一种有效的路由算法.The routing algorithm of randomly selecting neighbor nodes is mostly used in P2P applications,which decreases the routing efficiency and increases the routing hops.To solve this problem,a new routing algorithm named RMCT based on multiple circle topology was presented.Nodes were dynamically divided into a number of clusters which used sub-supernodes to manage.A short routing table based on constant grade was defined.In RMCT,maintaining the route table for nodes entering/exiting were presented,as well as the clusters building method and distributed election algorithm for sub-supernodes.Compared to the performance of such typical algorithms as Chord,the RMCT algorithm greatly improved the performance in regard to routing table maintaining,routing hops,and network delay.Simulations and analysis results showed that the RMCT was an efficient routing algorithm though some problems were to be studied further.

关 键 词：P2P 多环结构 簇 路由算法 DHT 

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