doi: 10.4304/jsw.8.5.1262-1267
A P2P Network Model Based on Hierarchical Interest Clustering Algorithm
2School of mathematics and computer, Jiaxin University, Jiaxin, Zhejiang, China
Abstract—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.
Index Terms—Interest cluster, P2P, activated peer node, search strategy.
Cite: Fanbin Meng, Lei Ding, Sheng Peng, Guangxue Yue, "A P2P Network Model Based on Hierarchical Interest Clustering Algorithm," Journal of Software vol. 8, no. 5, pp. 1262-1267, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]