Efficient Search in P2P File Sharing System

被引:0
作者
肖波 [1 ]
靳桅 [1 ]
侯孟书 [2 ]
机构
[1] EmeiBranch,SouthwestJiaotongUniversity,Emeishan,China
[2] SchoolofComputerScienceandEngineering,UniversityofElectronicScienceandTechnologyofChina,Chengdu,China
关键词
Peer-to-peer network; Routing indices; Flooding; Random walk; File sharing system; Query;
D O I
暂无
中图分类号
TP393.09 [];
学科分类号
080402 ;
摘要
A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding (FLD) and random walk (RW). The result shows that with the proposed design, the queries are routed effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.
引用
收藏
页码:29 / 33
页数:5
相关论文
共 2 条
[1]  
AdamicL,LukoseR,PuniyaniA,etal.Searchinpow er lawnetworks. PhysicalReviewE . 2001
[2]  
IanC.Adistributeddecentralizedinformationstorageand retrievalsystem. . 1999