一种基于移动P2P改进的Gossip算法  

Improved Gossip Algorithm Based on Mobile P2P Networks

作　　者：张国印[1] 李军[1] 王向辉[1] 徐国坤[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机科学》2013年第9期103-105,110,共4页Computer Science

基　　金：国家自然科学基金(61073042)移动P2P网络数据分发机制研究项目;黑龙江省自然科学基金(F201121)移动P2P网络拓扑构造与数据分发机制研究项目;哈尔滨市科技创新人才研究专项资金项目(2012RFQXG097);中央高校基本科研业务费专项资金(HEUCF100612)资助

摘　　要：随着移动智能终端设备的普及,移动对等网络的研究不断走向深入。经典的Gossip算法虽然可以用于移动对等网络中的数据分发,但不能很好地适应移动网络的要求,尤其是对扰动的适应性。因此,为了实现拓扑控制信息的有效传播并保持节点资源列表的副本一致性,提出了一种基于特定拓扑结构改进的Gossip算法,其通过动态调节邻居节点数据分发概率来实现同k-派系内所有节点的资源列表更新。模拟实验表明,采用此算法的数据分发效率较经典Gossip算法有明显改善,在保证网络负载较低的同时达到了泛洪数据分发策略的效率。With the wide use of intelligent mobile terminals, the research of mobile peer-to-peer networks came to be in- depth continuously. Although the classic Gossip algorithm can be applied to data dissemination in mobile peer-to-peer networks, it cannot adapt to the requirement of mobile networks, especially to the adaptability of churn. Therefore, in order to realize the effective transmission of topology control information and to maintain replica consistency of the node resource lists, an improved Gossip algorithm based on the specific topology was presented to update the resource lists of nodes which belong to the same k-clique, by dynamically adjusting data dissemination probability of each neighbor node. Simulation results show that data dissemination efficiency of the proposed algorithm is improved significantly than the classic Gossip algorithm. It achieves the efficiency of flooding data dissemination strategy and ensures the lower network load.

关 键 词：移动对等网络 GOSSIP 数据分发 

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