Research on Searching Mechanism Based on Interest in Kademlia
Kademlia protocol has been studied carefully in this paper. The Kademlia mechanism based on interest is proposed to support approximate search. The interest eigenvector is used to represent the peers interest. Moreover the interest router table that stores the peers interest information replaces the original one. Especially as a part of the interest router table, each K-bucket stores a certain number of the peers information that have high interest similarity. The query can be executed in the appropriate kbucket by calculating interest similarity and interest keyword. Through mining the latent interest, we found that two peers having high interest similarity are more possible to store the similar resource. Because the character restricts the query to a certain scope, the approximate search is realized and search efficiency is improved. The experiments show that the improved search mechanism obviously increases the recall, at the same time effectively reduces the number of visited peers.
search mechanism interest similarity Kademlia p2p
Chunxiao Zhao He Zhang
Department of Computer Beijing University of Civil Engineering and Architecture,Beijing,China School of Information Science & Engineering Bohai University Jinzhou, China
国际会议
2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)
沈阳
英文
1-4
2009-08-12（万方平台首次上网日期，不代表论文的发表时间）