首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的非结构化P2P网络搜索方法
引用本文:彭俊杰,卢正鼎,李瑞轩. 一种改进的非结构化P2P网络搜索方法[J]. 微电子学与计算机, 2006, 23(9): 16-19
作者姓名:彭俊杰  卢正鼎  李瑞轩
作者单位:华中科技大学计算机科学与技术学院,湖北,武汉,430074
基金项目:国家自然科学基金;湖北省自然科学基金;国家重点实验室基金
摘    要:如何高效地搜索资源是P2P网络中最为关键的问题。非结构化的对等网络,一般以广播方式作为其搜索的基本策略,引发较大的网络流量,因此,提出改进的搜索策略,包括把节点划分为拥有丰富资源的核心节点和稀疏资源的边缘节点,并为每个节点引入朋友节点,模拟测试表明改进算法稳定有效,降低了网络开销。

关 键 词:对等网络  非结构化  搜索
文章编号:1000-7180(2006)09-0016-04
收稿时间:2006-04-28

A Search Method Improvement for Unstructured Peer-to-Peer Networks
PENG Jun-jie,LU Zheng-ding,LI Rui-xuan. A Search Method Improvement for Unstructured Peer-to-Peer Networks[J]. Microelectronics & Computer, 2006, 23(9): 16-19
Authors:PENG Jun-jie  LU Zheng-ding  LI Rui-xuan
Affiliation:School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 China
Abstract:How to search the resources efficiently is the key problem in peer-to-peer networks.Unstructured peer-to-peer networks usually use broadcasting as its basic search strategy and cause a larger network flows.This paper introduces some improved search approaches,including dividing nodes into two types:kernel-nodes with more resources and edge-nodes with less resources,and introducing friend-nodes to each peer.Simulation results show that improved methods enhance the search efficiency and reduce the network costs.
Keywords:Peer-to-Peer network   Unstructured P2P   Search
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号