| 基于语义相似度的P2P平衡路由网络 |
| |
| 引用本文： | 陈明,鹿旸.基于语义相似度的P2P平衡路由网络[J].微电子学与计算机,2007,24(10):26-28. |
| |
| 作者姓名： | 陈明 鹿旸 |
| |
| 作者单位： | 中国石油大学,计算机科学与技术系,北京,102249 |
| |
| 摘 要： | 结构化的路由算法已逐渐成为P2P的一个热点研究领域。针对目前结构化P2P算法中存在的难以有效支持基于内容的定位问题,提出了一种基于语义相似度的P2P平衡路由网络S-Tree,构造了基于平衡网络树的覆盖网络和语义拓扑。模拟实验表明,与已有的结构化P2P算法相比,S-Tree能有效提高网络的查全率,同时降低路由的延迟。
|
| 关 键 词： | 语义相似度 自组织 聚类 |
| 文章编号： | 1000-7180（2007）10-0026-03 |
| 修稿时间： | 2007-06-18 |
A Semantic Similarity Based and Routing Balanced P2P Overlay Network |
| |
| CHEN Ming,LU Yang.A Semantic Similarity Based and Routing Balanced P2P Overlay Network[J].Microelectronics & Computer,2007,24(10):26-28. |
| |
| Authors: | CHEN Ming LU Yang |
| |
| Affiliation: | Department of Computer Science and Technology, China University of Petroleum, Beijing 102249, China |
| |
| Abstract: | 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. |
| |
| Keywords: | P2P |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
