抗扰动移动对等覆盖网的构建及性能评价  

Construction and performance evaluation of a churn-resistant mobile P2P overlay

作　　者：李军[1,2] 张国印[1] 王向辉[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨150001 [2]安庆师范学院数学与计算科学学院,安徽安庆246133

出　　处：《哈尔滨工程大学学报》2014年第10期1231-1235,共5页Journal of Harbin Engineering University

基　　金：国家自然科学基金资助项目(61073042);黑龙江省自然科学基金资助项目(F201121);中央高校基本研究业务费专项基金资助项目(HEUCF100612);安徽省高等学校省级自然科学研究重点资助项目(KJ2014A144)

摘　　要：为解决现有移动对等覆盖网络抗扰动性差和资源查询成功率低的问题,提出一种基于k-派系社区结构的移动对等覆盖网,按照节点加入的先后顺序形成多个k-派系,并通过对拓扑结构动态变化的自适应和资源列表共享实现系统的抗扰动性。利用改进的Gossip算法进行拓扑控制信息和资源共享列表的数据分发,保证系统在扰动情况下的动态调整效率,有效降低网络负载。提出一个三维移动对等覆盖网在扰动情况下的性能评价模型,并对多种覆盖网在该模型下的性能进行了评估。评估结果表明,所提覆盖网在剧烈扰动情况下保持了较高的查询成功率。In order to solve the problem that churn-resistance capability of existing mobile peer-to-peer overlays is poor and the query success rate of their resources is low,a mobile P2 P overlay based on k-clique community structure was proposed. Multiple k-cliques are constructed according to the order of each node joining it and realized according to the churn-resistance of the system through the dynamic topology adaption and resource list sharing. The use of an improved Gossip algorithm for data dissemination of topology control information and sharing resource lists guarantee the efficiency of dynamic adjustment under churning,which effectively reduces the network load. A three-dimensional performance evaluation model for mobile P2 P overlay was proposed and a variety of overlays were evaluated using this model. Assessment results showed that the proposed overlay maintains a high query success rate under high churn.

关 键 词：移动对等覆盖网 k-派系 扰动 性能评价 Gossip算法 

分 类 号：TP302.1[自动化与计算机技术—计算机系统结构]