DocumentCode
2751949
Title
An Interest-Based P2P File Sharing System
Author
Shen, Haiying
Author_Institution
Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR
fYear
2009
fDate
10-13 Jan. 2009
Firstpage
1
Lastpage
2
Abstract
Efficient file query is important to the overall performance of Peer-to-Peer (P2P) file sharing systems. In this paper, we introduce an interest-based P2P file sharing system based on a structured P2P. It groups peers based on both interest and proximity. The proposed system is able to support sophisticated routing and clustering strategies based on the file attribute and topology used. Simulation results demonstrate the efficiency of the proposed system in comparison with another P2P file sharing system. It dramatically reduces the overhead and yields significant improvements in file query efficiency.
Keywords
peer-to-peer computing; telecommunication network routing; cycloid routing; file query efficiency; peer-to-peer file sharing system; shortest path routing; Broadcasting; Centralized control; Clustering algorithms; Computer science; Costs; Delay; Network topology; Optimization; Peer to peer computing; Routing protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-2308-8
Electronic_ISBN
978-1-4244-2309-5
Type
conf
DOI
10.1109/CCNC.2009.4784810
Filename
4784810
Link To Document