一种基于社会行为的非结构化P2P搜索算法  

Search algorithm based on social behavior for unstructured P2P network

作　　者：朱国晖[1] 张武强[1] 鲁春兰 

机构地区：[1]西安邮电大学通信与信息工程学院,陕西西安710121

出　　处：《西安邮电大学学报》2016年第2期111-114,共4页Journal of Xi’an University of Posts and Telecommunications

基　　金：陕西省教育厅科学研究计划资助项目(07JK377)

摘　　要：针对非结构化对等网络(P2P)中信息资源搜索效率低的问题,给出一种基于社会行为的单跳算法。为网络中每个节点引入朋友列表和查询记录列表,记录过去的搜索经验,用于同伴选择和路线查询,之后排列节点价值,更新列表。利用基于推荐节点搜索、基于有用的朋友节点搜索和基于邻居节点搜索3种机制,搜索所需资源。仿真结果表明,所给算法可减少搜索跳数,提高搜索成功率,减少冗余消息,节省内存空间。To soup up unstructured peer-to-peer（P2P）network in information searching,a one-hop algorithm based on social behavior patterns is proposed.A friends list and a query records list are introduced to each node in the network,to keep an account of the past search experience for peer selection and route query later.the nodes are rearranged by their list values,and therewith,the lists are updated.As for information searching,there are three methods,which are recommended node based searching,useful friend based searching and neighbour based searching.Simulation results show that,the proposed algorithm can decrease the searching hop,improve the searching rates,reduce the redundant information,and save the memory space.

关 键 词：P2P网络 社会行为 节点关系 单跳算法 

分 类 号：TN929.53[电子电信—通信与信息系统]