计算机技术与发展2018，Vol.28Issue(5)：68-72,5.DOI:10.3969/j.issn.1673-629X.2018.05.016
基于节点兴趣非结构化P2P网络搜索机制研究
Research on Search Mechanism of Unstructured P2P Network Based on Node of Interest
摘要
Abstract
Peer-to-Peer(P2P) network,a distributed application architecture that divides tasks and workloads between peers,has recently attracted lots of concern since the growth of network users and network resources.Unstructured P2P networks have better usability and scalability,which makes it become the focus of P2P network research. Unstructured P2P network resource search algorithm is mainly based on improved flooding algorithm,but these algorithms exist some obvious problems.One is the central idea of the blind search algo-rithm,the search efficiency is not high;the two is the search process will produce a message sent to a large number of redundant messages from neighbor nodes,easy to cause network congestion.For these issues,we raise a binary searching tree based on interest unstructured P2P overlay network topology.A logical connection between similar nodes is used to reduce the blindness of message forwarding and to improve the search efficiency.The simulation shows that compared with the traditional flooding algorithm,the proposed unstructured P2P network search mechanism has shorter query time,less query message and higher search efficiency.关键词
P2P 网络/拓扑结构/兴趣相似度/二叉搜索树Key words
P2Pnetwork/topology structure/interest similarity/binary searching tree分类
信息技术与安全科学引用本文复制引用
庄伟..基于节点兴趣非结构化P2P网络搜索机制研究[J].计算机技术与发展,2018,28(5):68-72,5.基金项目
国家自然科学基金(61374180) （61374180）
