The Community for Technology Leaders
Cluster Computing and the Grid, IEEE International Symposium on (2009)
Shanghai, China
May 18, 2009 to May 21, 2009
ISBN: 978-0-7695-3622-4
pp: 164-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.
INDEX TERMS
Peer to peer, Proximity, Distributed hash table
CITATION

H. Shen, "PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Shanghai, China, 2009, pp. 164-171.
doi:10.1109/CCGRID.2009.17
96 ms
(Ver 3.3 (11022016))