摘要： 为解决结构化P2P语义路由过程效率低的问题，通过分析哈希函数，归纳出目的节点、传统语义路由中继节点序列、聚类邻居节点集三者之间的逻辑关联特性，提出一种自组织聚类的P2P语义路由算法，在提高路由效率的同时，保证P2P网络的对等性、自组织性及规模可缩放性。
关键词:
结构化P2P,
自组织聚类,
哈希函数,
语义路由
Abstract: In order to solve the problem of low efficiency of structured P2P semantic routing process, this paper analyzes the Hash function, concludes and applies the property that the logical relation among the destination node, the traditional semantic routing relay node sequence, and the clustering neighboring nodes. It proposes the self-organizing clustering P2P semantic routing algorithm to improve the efficiency of semantic routing, and guarantee the equivalence, self-organization and the possible of scaling scale of P2P network.
Key words:
structured P2P,
self-organizing clustering,
Hash function,
semantic routing
中图分类号:
向永生;张 颖;陈 曦. 自组织聚类的P2P语义路由算法[J]. 计算机工程, 2010, 36(9): 123-125.
XIANG Yong-sheng; ZHANG Ying; CHEN Xi. Self-organizing Clustering P2P Semantic Routing Algorithm[J]. Computer Engineering, 2010, 36(9): 123-125.