| 基于超节点的结构化P2P路由算法的研究 |
| |
| 引用本文： | 王红玉,董健全,王孟孟,钱小军.基于超节点的结构化P2P路由算法的研究[J].计算机应用,2006,26(11):2550-2553. |
| |
| 作者姓名： | 王红玉 董健全 王孟孟 钱小军 |
| |
| 作者单位： | 上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072 |
| |
| 摘 要： | 在对经典的结构化P2P路由算法研究的基础上，提出了BSNCCC(Based Super Node Cube Connect Cycle)路由算法。该算法节点维护的信息为O(1)，查询步长为O(d)(节点个数N=d*2d)，在充分考虑节点性能差异性的基础上，将性能好的节点作为路由过程中的主节点。模拟试验结果表明，在动态变化的P2P网络中，BSNCCC路由算法的效率优于Cycloid等算法。
|
| 关 键 词： | 结构化P2P 路由算法 超立方体 |
| 文章编号： | 1001-9081（2006）11-2550-04 |
| 收稿时间： | 2006-05-10 |
| 修稿时间： | 2006-05-10 |
Research of routing algorithms in structured P2P network based on super nodes |
| |
| WANG Hong-yu,DONG Jian-quan,WANG Meng-meng,QIAN Xiao-jun.Research of routing algorithms in structured P2P network based on super nodes[J].journal of Computer Applications,2006,26(11):2550-2553. |
| |
| Authors: | WANG Hong-yu DONG Jian-quan WANG Meng-meng QIAN Xiao-jun |
| |
| Affiliation: | School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China |
| |
| Abstract: | 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*2d)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 routing algorithm has higher location efficiency than Cycloid in large scale and dynamic P2P networks that have frequent nodes arrival and departure. |
| |
| Keywords: | structured P2P routing algorithm hyper-cube |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
