摘要
结构化的路由算法已逐渐成为P2P的一个热点研究领域。针对目前结构化P2P算法中存在的难以有效支持基于内容的定位问题,提出了一种基于语义相似度的P2P平衡路由网络S-Tree,构造了基于平衡网络树的覆盖网络和语义拓扑。模拟实验表明,与已有的结构化P2P算法相比,S-Tree能有效提高网络的查全率,同时降低路由的延迟。
A fundamental problem that confronts peer-to-peer （P2P） systems is how to efficiently locate the node according to the content of their resources. In this paper, a semantic similarity based and routing balanced P2P overlay network, called S-Tree, is proposed. In this protocol, all participant nodes are grouped into tree based overlay network and semantic link network. A set of simulations to justify S-Tree is conducted, which shows that S-Tree is effective in improving the efficiency of search.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第10期26-28,共3页
Microelectronics & Computer
关键词
P2P
语义相似度
自组织
聚类
P2P
semantic similarity
self-organizing
clustering
