###
DOI:
Journal of Software:2004.15(6):915-923

用Small-WorId 设计无组织P2P系统的路由算法
周晋,路海明,李衍达
(清华大学,自动化系,网络信息实验室,北京,100084)
Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System
ZHOU Jin,LU Hai-Ming,LI Yan-Da
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3888   Download 3555
Received:June 01, 2004    
> 中文摘要: 由于peer-to-peer系统在文件共享方面有着巨大的应用前景,peer-to-peer搜索问题已成为目前学术界重点的研究问题之一.对于缺乏缓存机制的无组织P2P系统,已有的分布式路由算法缺乏全局导航能力,属于无序搜索.为此,提出一种key clustering算法,将路由空间分为HUB和AUT两层,从全局角度进行有序搜索.为提高key clustering算法的可扩展性,借鉴Small-world领域的研究成果,在路由表中以一定概率插入连接远距离节点的快捷连接,以缩短平均路径长度.初步仿真实验表明,引入快捷连接的key clustering算法具有良好的搜索能力和扩展性.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Natural Science Foundation of China under Grant No60003004(国家自然科学基金) Supported by the National Natural Science Foundation of China under Grant No60003004(国家自然科学基金)
Foundation items:
Reference text:

周晋,路海明,李衍达.用Small-WorId 设计无组织P2P系统的路由算法.软件学报,2004,15(6):915-923

ZHOU Jin,LU Hai-Ming,LI Yan-Da.Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System.Journal of Software,2004,15(6):915-923