计算机科学 ›› 2007, Vol. 34 ›› Issue (8): 72-73.
• 软件工程与数据库技术 • 上一篇 下一篇
关中
出版日期:
发布日期:
GUAN Zhong (Guangzhou City Polytechnic,Guangzhou510230)
Online:
Published:
摘要: P2P搜索问题已成为目前学术界的研究热点,Key clustering算法将路由空间分成HUB和AUT两层,从全局角度进行有序搜索,借鉴Small-world领域的研究成果,在路由表中以一定概率插入连接远距离节点的快捷连接,以缩短平均路径长度.仿真试验表明,引入快捷连接的Key clustering算法具有良好的搜索能力、扩展性和容错能力.
关键词: 搜索算法 索引表 P2P 分布式路由
Abstract: An efficient search technique has become a crucial research problem in P2P system. Key clustering algorithm divides routing space into AUT layer and HUB layer. Such an algorithm can does a well-ordered search from a global view. To improve scalability, a
Key words: Searching algorithm, Indexing table, Peer-to-Peer, Distributed routing
关中. 一种改进的基于键聚类的P2P网络搜索算法[J]. 计算机科学, 2007, 34(8): 72-73. https://doi.org/
GUAN Zhong (Guangzhou City Polytechnic,Guangzhou510230). [J]. Computer Science, 2007, 34(8): 72-73. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2007/V34/I8/72
Cited