用small_world设计p2p路由.pdfVIP

1000-9825/2004/15(06)0915 )2004JournalofSoftware 软 件 学 报 Vo1.15,No.6 用Small-World设计无组织P2P系统的路由算法’ 周晋，路海明，李衍达 (清华大学 自动化系网络信息实验室，北京 100084) UsingSmall-WorldtoDeviseRoutingAlgorithm forUnstructuredPeer-to-Peer System ZHOUJin,LUHai-Ming,LIYan-Da (WebInformationLaboratory,DepartmentofAutomation,Tsin乡uaUniversity,Beijing100084,China) +Correspondingauthor:Phn:+86-10E-mail:zhoujin00@,/ -zhoujin Received2003-03-25;Accepted2003一10-08 ZhouJ,LuHM,LiYD.Usingsmall-worldtodeviseroutingalgorithmforunstructuredpeer-to-peersystem. JournalofSoftware,2004,15(6):915923. Abstract:Peer-to-Peersystemshaveshownagreatpotentialonfilesharinginrecentyears,anddeveloping efficientsearchtechniqueshasbecomeacrucialresearchproblem.Mostunstructuredpeer-to-peersystemswith existingdistributedroutingalgorithmscanonlyrunblindsearch,butnotglobalsearchduetothelackofcache scheme.Toaddresstheproblem,anovelkeyclusteringalgorithmisproposed,whichdividestheroutingspaceinto twolayers,AUTlayerandHUBlayer.Suchanalgorithmcanperformawell-orderedsearchfromaglobalview.In ordertoimprovescalability,theoreticalresultsfromsmall-worldareutilized.Intheimprovedalgorithm,afew shortcutswithdistantpeersareinsertedintotheroutingtableswithsomeprobabilities,andtheaveragepathlength isreduced.Thepreliminarysimulationresultsshowthatthekeyclusteringalgorithmwithshortcutsisefficientand scalable. Keywords: P2Prouting;clustering;small-world;unstructuredpeer-to-peersystem 摘 要:由于peer-to-peer系统在文件共享方面有着巨大的应用前景，peer-to-peer搜索问题已成为目前学术界 重点的研究问题之一对于缺乏缓存机制的无组织P2P系统，已有的分布式路由算法缺乏全局导航能力，属于无 序搜索.为此，提出一种keyclustering算法，将路由空间分为HUB和AUT两层，从全局角度进行有序搜索.为提高 keyclustering算法的可扩展性，借鉴Small-