A P2P Network Model Based on Hierarchical Interest Clustering Algorithm

A hierarchical clustering P2P network model based on user interest is presented in this paper to improve search efficiency. The routers in the network are abstracted as the activated peer node, and the activated routing table is constructed to depict the character of the interest cluster. The P2P network is divided into different subnets according into their interest character, and the corresponding topological structure is build. The corresponding search strategy is proposed based on the above mention method. The simulation results show that compared with the traditional algorithm the interest cluster method proposed in this paper can form cluster more rapidly, and gain the appropriate resources faster.

[1]  Jun Li,et al.  Scalable supernode selection in peer-to-peer overlay networks , 2005 .

[2]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[3]  Dimitrios Tsoumakos,et al.  A Comparison of Peer-to-Peer Search Methods , 2003, WebDB.

[4]  Kup-Sze Choi,et al.  A framework using cluster-based hybrid network architecture for collaborative virtual surgery , 2009, Comput. Methods Programs Biomed..

[5]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[6]  Li Xiao,et al.  Exploiting Content Localities for Efficient Search in P2P Systems , 2004, DISC.

[7]  ZhuYingwu,et al.  Enhancing Search Performance on Gnutella-Like P2P Systems , 2006 .

[8]  Raimo Kantola,et al.  ICN: interest-based clustering network , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[9]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[10]  Jian Yang,et al.  An efficient interest-group based search mechanism in unstructured peer-to-peer networks , 2003, 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003..

[11]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[12]  Anna R. Karlin,et al.  Spectral analysis of data , 2001, STOC '01.

[13]  Guo-Fu Feng.  PeerRank:A Strategy for Resource Discovery in Unstructured P2P Systems , 2006 .

[14]  Mohamed S. Kamel,et al.  Hierarchically Distributed Peer-to-Peer Document Clustering and Cluster Summarization , 2009, IEEE Transactions on Knowledge and Data Engineering.

[15]  Huang Jian-hua.  Searching mechanism based on network topological and peer interest in P2P system , 2008 .

[16]  Edith Cohen,et al.  A case for associative peer to peer overlays , 2003, CCRV.

[17]  Xie Jing.  Search Algorithm Based on User Interest-proximity Measurement , 2008 .

[18]  Athanasios V. Vasilakos,et al.  SOBIE: A Novel Super-node P2P Overlay Based on Information Exchange , 2009, J. Comput..

[19]  Jun Li,et al.  Scalable supernode selection in peer-to-peer overlay networks , 2005, Second International Workshop on Hot Topics in Peer-to-Peer Systems.

[20]  Steffen Staab,et al.  Remindin': semantic query routing in peer-to-peer networks based on social metaphors , 2004, WWW '04.

[21]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Kai Guo,et al.  A New Efficient Hierarchical Distributed P2P Clustering Algorithm , 2008, 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery.

[23]  Yiming Hu,et al.  Enhancing Search Performance on Gnutella-Like P2P Systems , 2006, IEEE Transactions on Parallel and Distributed Systems.

[24]  Yiming Hu,et al.  To unify structured and unstructured P2P systems , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.