中文模板-网络安全试验室-清华大学.DOC

用Small-world设计无组织P2P系统的路由算法(? 周晋+, 李衍达 (清华大学 自动化系网络信息实验室,北京 100084) Using Small-world to Devise Routing Algorithm of Unstructured Peer-to-peer System* ZHOU Jin+, LI Yan-Da (Web Information Laboratory, Department of Automation, Tsinghua University, Beijing 100084, China) + Corresponding author: Phn 86-10-6277-8137, Fax 86-10-6278-1816, E-mail: zhoujin00@ /~zhoujin Received 2003-3-25; Accepted 2003-10-8 Zhou J, Li YD. Using Small-world to Devise Routing Algorithm of Unstructured Peer-to-peer System. Journal of Software, 2003, Abstract: Peer-to-peer systems have shown a great potential on file sharing in recent years and efficient search techniques has become a crucial research problem. Most unstructured peer-to-peer systems lacking cache scheme, with existing distributed routing algorithms, can only run blind search, but not global search. To address the problem, we purpose a novel key clustering algorithm, which divides routing space into two layers, AUT layer and HUB layer. Such an algorithm can does a well-ordered search from a global view. In order to improve scalability, we utilize theoretical results from small-world. In improved algorithm, a few shortcuts with distant peers will be inserted into routing tables with some probabilities, and average path length will be reduced. Through preliminary simulation, we demonstrate that key clustering algorithm with shortcuts is efficient and scalable. Key words: P2P routing; clustering; small-world; unstructured peer-to-peer system 摘 要: 由于Peer-to-peer系统在文件共享方面有着巨大的应用前景,Peer-to-peer搜索问题已成为目前学术界的重点研究问题之一.对于缺乏缓存机制的无组织P2P系统,已有的分布式路由算法缺乏全局导航能力,属于无序搜索.为此,本文提出一种Key clustering算法,将路由空间分HUB和AUT两层,从全局角度进行有序搜索.为提高Key clustering算法的可扩展性,我们借鉴Small-world领域的研究成果,在路由表中以一定概率插入连接远距离节点的快捷连接,以缩短平均路径长度.初步仿真试验表明,引入快捷连接的Key clustering算法具有良好的搜索能力和扩展性. 关键词: P2P路由; 聚类; 小世界; 无组织Peer-to-peer系统 中图法分类号: TP393　　　文献标识码: A 简介 近来,Peer-to-peer系统(简称P2P系统)在文件共享和信息搜索等方面得到了越来越多的应用. P2P系统是由一组地位相等的节点构成,节点间可以直接通讯,无需第三方参与.与集中式结构相比,P2P结构在可扩展性、实时性、可靠性和负载平衡等方面具有天生优势