| 基于兴趣域中心节点的P2P网络拓扑 |
| |
| 引用本文： | 赵新慧,冯锡炜,石元博.基于兴趣域中心节点的P2P网络拓扑[J].科学技术与工程,2011,11(21). |
| |
| 作者姓名： | 赵新慧 冯锡炜 石元博 |
| |
| 作者单位： | 辽宁石油化工大学计算机与通信工程学院,抚顺,113001 |
| |
| 摘 要： | 资源搜索是P2P应用所面临的最核心问题之一，相关的非结构化P2P系统主要采用了查询消息泛洪和信息索引机制。通过对分布非结构化的搜索算法以及对现有改进算法的研究，参考网络中的小世界性给出了一种基于兴趣域中心节点的P2P网络拓扑结构。该算法使得节点能在短时间内查找到有效的资源，减少了查询信息量，缩短了路由路径，提高了搜索效率。
|
| 关 键 词： | P2P网络 非结构化 兴趣域 中心节点 网络拓扑 |
| 收稿时间： | 4/10/2011 7:40:38 PM |
| 修稿时间： | 4/26/2011 2:59:02 PM |
P2P Network Topological Based on Interest Domain with Central Node |
| |
| zhaoxinhui,fengxiwei and shiyuanbo.P2P Network Topological Based on Interest Domain with Central Node[J].Science Technology and Engineering,2011,11(21). |
| |
| Authors: | zhaoxinhui fengxiwei and shiyuanbo |
| |
| Institution: | Liaoning Shihua University,Liaoning Shihua University |
| |
| Abstract: | One of the essential problems in P2P is the strategy for resource searching.The related methods for unstructured P2P either depend on the flooding or utilize various information indices.The unstructured P2P systems' searching algorithm and the relative research are studied.And a P2P network topological based on interest domain with central node is given.When searching,peers can find resource in the shortest time.So the routing distance and searching message are reduced,and the network efficiency is improved... |
| |
| Keywords: | peer-to-peer(P2P) network unstructured interest domain central node network topological |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
