西南交通大学学报（英文版）2006，Vol.14Issue(1)：29-33,5.
Efficient Search in P2P File Sharing System
Efficient Search in P2P File Sharing System
摘要
Abstract
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.关键词
Peer-to-peer network/Routing indices/Flooding/Random walk/File sharing system/QueryKey words
Peer-to-peer network/Routing indices/Flooding/Random walk/File sharing system/Query分类
信息技术与安全科学引用本文复制引用
Xiao Bo,Jin Wei,Hou Mengshu..Efficient Search in P2P File Sharing System[J].西南交通大学学报（英文版）,2006,14(1):29-33,5.基金项目
The Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry (No.2004527) （No.2004527）
