计算机应用研究2011，Vol.28Issue(9)：3463-3466,4.DOI:10.3969/j.issn.1001-3695.2011.09.073
MIKAD:一种多兴趣聚类的P2P网络模型
Multi-interest clustering P2P network model
摘要
Abstract
To reduce the routing hops of data retrieval in P2P network,proposed the MIKAD( multi-interest clustering KAD) network model. In the model, nodes' interest maintained by the documents cluster algorithm, through combining Kademlia and interesting-cluster together, and putting the nodes of similar interest in the neighboring position,which could improve routing efficiency in the peer-to-peer network. Simultaneously used synonymous characteristic of keywords to lower the network complexity and improve retrieval accuracy. Simulation experimental results show that this model can achieve better search performance with the increase of nodes and data.关键词
MIKAD/对等网(P2P)/兴趣聚类Key words
MIKAD/ P2P( peer-to-peer) / interesting-cluster分类
信息技术与安全科学引用本文复制引用
雷申,刘方爱..MIKAD:一种多兴趣聚类的P2P网络模型[J].计算机应用研究,2011,28(9):3463-3466,4.基金项目
国家自然科学基金资助项目(90612003) （90612003）
山东省自然科学基金资助项目(Y2007G11) （Y2007G11）
济南市高校院所自主创新项目(2010040072) （2010040072）
