沈阳工业大学学报2012，Vol.34Issue(1)：79-82,110,5.
基于Kleinberg模型的P2P网络搜索协议
P2P network search protocol based on Kleinberg model
摘要
Abstract
In order to solve such problems as low routing efficiency and load imbalance existing in structurized P2P networks based on DHT technology,a structurized P2P network protocol was designed according to Kleinberg small world model.The P2P network is composed of some node clusters which are mutually connected,and there exist either short-range links or long-range links between the node clusters.The proposed protocol has certain small world characteristics,which decreases the average path length of search routing.The P2P network load can be balanced through setting the maximum value of internal node number of node clusters.The spending of P2P network search was analyzed.An upper bound existed for the average path length of P2P network search based on Kleinberg small world model.The experimental results show that with increasing the network scale,the average search path length increases in a logarithm function mode.With increasing the number of long-range links,the average search path length can be reduced,and the decreasing trend shows as an inverse ratio function mode.关键词
对等网络/小世界现象/搜索/分布式哈希表/路由/扩展性/上界/平均搜索步数/负载平衡Key words
peer-to-peer(P2P) network/small world phenomenon/search/distributed hash table/routing/scalability/upper bound/average search path length/load balance分类
信息技术与安全科学引用本文复制引用
史庆伟,乔晓东,农国武..基于Kleinberg模型的P2P网络搜索协议[J].沈阳工业大学学报,2012,34(1):79-82,110,5.基金项目
国家“十二五”科技支撑计划项目 （）
辽宁省教育厅基金资助项目 （）
