首页 | 本学科首页   官方微博 | 高级检索  
     

用Small-World设计无组织P2P系统的路由算法
引用本文:周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法[J].软件学报,2004,15(6):915-923.
作者姓名:周晋  路海明  李衍达
作者单位:清华大学自动化系网络信息实验室,北京100084
摘    要:由于peer-to-peer系统在件共享方面有着巨大的应用前景,peer-to-peer搜索问题已成为目前学术界重点的研究问题之一.对于缺乏缓存机制的无组织P2P系统。已有的分布式路由算法缺乏全局导航能力,属于无序搜索.为此,提出一种key clustering算法,将路由空间分为HUB和AUT两层,从全局角度进行有序搜索.为提高key clustering算法的可扩展性,借鉴Small-world领域的研究成果,在路由表中以一定概率插入连接远距离节点的快捷连接,以缩短平均路径长度.初步仿真实验表明,引入快捷连接的key clustering算法具有良好的搜索能力和扩展性。

关 键 词:P2P路由  聚类  小世界  无组织peer-to-peer系统

Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System
ZHOU Jin,LU Hai-Ming,LI Yan-Da.Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System[J].Journal of Software,2004,15(6):915-923.
Authors:ZHOU Jin  LU Hai-Ming  LI Yan-Da
Abstract:Peer-to-Peer systems have shown a great potential on file sharing in recent years, and developing efficient search techniques has become a crucial research problem. Most unstructured peer-to-peer systems with existing distributed routing algorithms can only run blind search, but not global search due to the lack of cache scheme. To address the problem, a novel key clustering algorithm is proposed, which divides the routing space into two layers, AUT layer and HUB layer. Such an algorithm can perform a well-ordered search from a global view. In order to improve scalability, theoretical results from small-world are utilized. In the improved algorithm, a few shortcuts with distant peers are inserted into the routing tables with some probabilities, and the average path length is reduced. The preliminary simulation results show that the key clustering algorithm with shortcuts is efficient and scalable.
Keywords:P2P routing  clustering  small-world  unstructured peer-to-peer system
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号