一种基于互惠能力的P2P网络拓扑优化算法

J4 ›› 2016, Vol. 38 ›› Issue (06): 1091-1096.

一种基于互惠能力的P2P网络拓扑优化算法

刘浩1，张连明2，贺文华1

Technology,Loudi 417000,Hunan,P.R.China
刘浩1，张连明2，贺文华1（1.湖南人文科技学院信息科学与工程系，湖南娄底 417000；
2.湖南师范大学物理与信息科学学院,湖南长沙 410081）

收稿日期:2015-05-19 修回日期:2015-10-20 出版日期:2016-06-25 发布日期:2016-06-25
基金资助:
国家自然科学基金（61572191,61571188）;湖南省教育厅优秀青年科研项目（15B125）;湖南省计算机应用技术重点建设学科资助

A topology optimization algorithm
based on reciprocal capability in P2P networks

LIU Hao1，ZHANG Lianming2，HE Wenhua1

（1.Department of Information Science and Engineering,Hunan University of Humanities,Science and Technology,Loudi 417000；
2.College of Physics and Information Science，Hunan Normal University，Changsha 410081,China）

Received:2015-05-19 Revised:2015-10-20 Online:2016-06-25 Published:2016-06-25

摘要/Abstract

摘要：

高效的拓扑优化算法是非结构化对等网络的研究热点之一。针对现有对等网络拓扑优化算法大多基于理想的网络环境、缺乏对节点自身能力和外部环境的综合考虑的不足，给出了一种基于互惠能力的对等网络拓扑优化算法。它从节点自身能力和外部环境因素两个方面来计算节点的互惠能力，在此基础上对非结构化对等网络的拓扑结构进行优化。分析与实验结果表明，该拓扑优化算法能将互惠能力低的节点排挤到网络边缘，降低其对网络整体性能的影响，并能有效地提高对等网络的资源搜索效率。

关键词: 对等网络, 互惠能力, 自身能力, 外部环境, 拓扑优化

Abstract:

Efficient topology optimization algorithms are one of the research hotspots in the domain of unstructured P2P networks. In view that the existing P2P network topology optimization algorithms are mostly based on an ideal network environment, and the selfcapacity and externalsurroundings of nodes are not considered comprehensively, we present a topology optimization algorithm based on reciprocal capability in P2P networks. The reciprocal capability of nodes is calculated according to two aspects: selfcapacity and externalsurroundings, based on which the topology of the unstructured P2P network is optimized. Analysis and simulation show that the proposed algorithm is capable of forcing nodes of lower reciprocal capability to the margin of P2P networks, reducing their impact on the overall performance of the network and effectively improving the search efficiency of P2P networks.

Key words: peertopeer (P2P) network;reciprocal capability;selfcapacity;externalsurroundings;topology optimization

刘浩1，张连明2，贺文华1. 一种基于互惠能力的P2P网络拓扑优化算法[J]. J4, 2016, 38(06): 1091-1096.

LIU Hao1，ZHANG Lianming2，HE Wenhua1. A topology optimization algorithm
based on reciprocal capability in P2P networks [J]. J4, 2016, 38(06): 1091-1096.

参考文献［12］

［1］	Liu Hao,Zhang Lianming,Zeng Bing.An anonymous trustfulagentsbased trust model for P2P network［C］∥Proc of 2009 AsiaPacific Conference on Information Processing,2009:426429.
［2］	Liu Hao,Chen Zhigang.Research on P2P overlay network model with smallworld features ［J］.Journal of Networks,2013,8(9):20432049.
［3］	Huang Juncheng, Li Xiuqi, Wu Jie. A semantic searching scheme in heterogeneous unstructured P2P networks［J］.Journal of Computer Science and Technology,2011,26(6):925941.
［4］	Chen Cai,Yang Fangchun,Su Sen,et al.An effective topology optimization approach considering peer autonomous behavior for P2P networks［J］.Journal of Beijing University of Posts and Telecommunications,2011,34(1):1115.(in Chinese)
［5］	Liu Jiaqi, Chen Zhigang, Li Deng, et al. A topology constructing algorithm based on punishment and cultivation in mobile P2P［J］.Journal of Computer Research and Development,2012,49(2):278285.(in Chinese)
［6］	Ma Wenming, Meng Xiangwu, Zhang Yujie.Bidirectional random walk search mechanism for unstructured P2P network［J］.Journal of Software.2012,23(4):894911.(in Chinese)
［7］	Kim H,Kim Y,Kim K,et al.Restricted path flooding scheme in distributed P2P overlay networks［C］∥Proc of the International Conference on Information Science and Security (ICISS 2008).2008:5861.
［8］	Cao Huaihu,Zhu Jianming,Pan Yun,et al.Contextaware P2P mobile social network structure and discovery algorithm［J］.Chinese Journal of Computers,2012,35(6):12231234.(in Chinese)
［9］	Su Sen. On some key techniques based on semantics and node storage capacity in unstructured P2P networks ［D］.Beijing:Beijing University of Posts and Telecommunications,2011.(in Chinese)
［10］	Hu Jianli,Wu Quanyuan,Zhou Bin.TTEM:An effective trustbased topology evolution mechanism for P2P networks［J］.Journal of Communications,2008,3(7):876887.
［11］	Tian Huirong,Cheng Shiduan.Constructing efficient peertopeer overlay topologies by adaptive connection establishment［J］.Computer and Communications,2007,29(17):35673579.
［12］	Guo Shize,Lu Zheming.Basic theory of complex network ［M］.Beijing:Science Press,2012.(in Chinese)
	附中文参考文献：
［4］	陈才,杨放春,苏森,等.考虑节点自主特性的对等网络拓扑优化调整［J］.北京邮电大学学报,2011,34 (1):1115.
［5］	刘佳琦,陈志刚,李登,等.移动P2P中基于惩罚培育的拓扑构造算法［J］.计算机研究与发展,2012,49(2):278285.
［6］	马文明,孟祥武,张玉洁.面向非结构化P2P网络的双向随机漫步搜索机制［J］.软件学报,2012,23(4):894911.
［8］	曹怀虎,朱建明,潘耘,等.情景感知的P2P移动社交网络构造及发现算法［J］.计算机学报,2012,35(6):12231234.
［9］	苏森.无结构P2P网络中基于语义和节点存储能力的搜索关键技术研究［D］.北京:北京邮电大学,2011.
［12］	郭世泽,陆哲明.复杂网络基础理论［M］.北京:科学出版社,2012.

[1]	马满福1,2，何春玲1,2. 面向选择推荐节点的P2P网络信任模型[J]. 计算机工程与科学, 2018, 40(06): 977-983.
[2]	杨忠仪1,2，左克1. 一种适用于移动对等网络的分簇算法[J]. J4, 2014, 36(07): 1268-1274.
[3]	高晓燕. 基于QoS的P2P服务发现算法的研究[J]. J4, 2013, 35(6): 42-46.
[4]	左克，吴泉源，胡东敏. 移动对等网络支撑平台MOBIPEER的设计与实现[J]. J4, 2012, 34(12): 27-33.
[5]	蒋文斌1，余林琛1, 2，廖光贤1，廖小飞1，王鹏程1，陈珍1. 移动对等直播流媒体系统的服务质量保证机制研究[J]. J4, 2012, 34(10): 11-16.
[6]	许智宏,张竹楼,郭浩,李雪原. 双向主从式Chord资源搜索算法的研究[J]. J4, 2011, 33(11): 80-83.
[7]	周屹1，2，邢传军2，詹晓娟2. 基于用户相关度的P2P内容发布网络模型研究[J]. J4, 2010, 32(9): 5-8.
[8]	黄庆凤，李之棠. DHT协议设计选项与抖动问题关联分析[J]. J4, 2010, 32(6): 13-15.
[9]	孙波张代远. 一种改进的对等网络信任模型[J]. J4, 2008, 30(7): 33-35.
[10]	水超王怀民周斌邹鹏. 一种P2P环境下的单值区间搜索算法[J]. J4, 2007, 29(9): 76-78.
[11]	章勤刘宇张浩罗飞. 一种基于“相似属性”的层次性对等网络协议[J]. J4, 2007, 29(7): 13-15.
[12]	胡迎松郭守烈. 一种层次式的低延迟Chord协议扩展算法[J]. J4, 2007, 29(4): 74-77.
[13]	刘雪峰孟会. 蓝牙无线个人局域网的拓扑优化[J]. J4, 2007, 29(1): 8-10.
[14]	郑倩冰彭伟朱培栋卢锡城. 通用对等网络模拟器的设计与实现[J]. J4, 2006, 28(1): 9-11.