DocumentCode :
2016228
Title :
PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System
Author :
Shen, Haiying
Author_Institution :
Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR
fYear :
2009
fDate :
18-21 May 2009
Firstpage :
164
Lastpage :
171
Abstract :
Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. On the other hand, clustering peers by their physical proximity can also improve file query performance. Few current works are able to cluster peers based on both peer interest and physical proximity. It is even harder to realize it in structured P2Ps due to their strictly defined topologies, although they provide higher file query efficiency than unstructured P2Ps. In this paper, we introduce a proximity-aware and interest-clustered P2P file sharing system (PAIS) based on a structured P2P. It groups peers based on both interest and proximity. PAIS supports sophisticated routing and clustering strategies based on a hierarchical topology. Theoretical analysis and simulation results demonstrate that PAIS dramatically reduces the overhead and enhances efficiency in file sharing.
Keywords :
peer-to-peer computing; query processing; file query performance; hierarchical topology; peer interest; physical proximity; proximity-aware interest-clustered peer-to-peer file sharing system; sophisticated routing; strategies; Analytical models; Bandwidth; Computer science; Floods; Grid computing; Network topology; Peer to peer computing; Routing; Scalability; Spine; Distributed hash table; Peer to peer; Proximity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster Computing and the Grid, 2009. CCGRID '09. 9th IEEE/ACM International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3935-5
Electronic_ISBN :
978-0-7695-3622-4
Type :
conf
DOI :
10.1109/CCGRID.2009.17
Filename :
5071868
Link To Document :
بازگشت