基于自适应周期的流言机制快速构建自组Overlay拓扑  

Enabling Quick Overlay Topology Construction Using Adaptive Cycle Gossip

作　　者：孙晓[1] 王晖[1] 汪浩[1] 姜志宏[1] 陶钧[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073

出　　处：《软件学报》2008年第9期2422-2431,共10页Journal of Software

基　　金：湖南省自然科学基金~~

摘　　要：分析了overlay拓扑管理中流言机制的一般过程,发现固定周期的流言报文中存在的数据交换盲目性的弊端.为此,引入动态的自适应用期来代替固定周期,使得局部拓扑稳定的节点较少发出流言报文,而局部拓扑动荡的节点较多发出流言报文.这种方法提高了数据交换效率,节省了网络资源,允许在局部加快数据交换,从而提高拓扑的整体收敛速度.通过仿真实例对该方法的有效性进行了验证,并证实该方法在动态网络环境中尤其适用.Based on previous observation, a dynamic adaptive cycle into gossip-based topology management is introduced to replace the traditional fixed cycle and a quick topology convergence method based on adaptive cycle is also proposed. In this method, those nodes featured with local topology stability send fewer gossip packets, while nodes in frequently changing environment send more packets. This dynamic adaptive method improves data exchange efficiency, saves network resources, enables faster local data exchange, and consequently speeds up the overall topology convergence. In detail, by using logistic curve as the basic control function of the adaptive cycle, rules for accidental events is defined accordingly. Simulation is presented to show the validity of this approach and that it is especially suitable for dynamic network environment.

关 键 词：oveday 流言 自组织 收敛速度泊适应 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]