基于超节点的结构化P2P路由算法的研究  

Research of routing algorithms in structured P2P network based on super nodes

作　　者：王红玉[1] 董健全[1] 王孟孟[1] 钱小军[1] 

机构地区：[1]上海大学计算机工程与科学学院,上海200072

出　　处：《计算机应用》2006年第11期2550-2553,共4页journal of Computer Applications

基　　金：上海市科委发展基金资助项目(7A05722)

摘　　要：在对经典的结构化P2P路由算法研究的基础上,提出了BSNCCC(Based Super Node Cube-Connect-Cycle)路由算法。该算法节点维护的信息为O(1),查询步长为O(d)(节点个数N=d*2d),在充分考虑节点性能差异性的基础上,将性能好的节点作为路由过程中的主节点。模拟试验结果表明,在动态变化的P2P网络中,BSNCCC路由算法的效率优于Cycloid等算法。Based on the research of classical routing algorithms in structured P2P network, a new routing algorithm, named Based Super Node Cube-Connect-Cycle （BSNCCC） was proposed. Based on O（d） （ N = d ＊ 2^d） hops per lookup request by using O（1） neighbors per node, the algorithm took advantage of the difference of nodes＇ capabilities in the network. The algorithm guaranteed that the nodes with the best capabilities served as the primary nodes. The simulation results show that BSNCCC muting algorithm has higher location efficiency than Cycloid in large scale and dynamic P2P networks that have frequent nodes arrival and departure.

关 键 词：结构化P2P 路由算法 超立方体 

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