首页 | 官方网站   微博 | 高级检索  
     

基于自适应周期的流言机制快速构建自组Overlay拓扑
引用本文:孙 晓,王 晖,汪 浩,姜志宏,陶 钧.基于自适应周期的流言机制快速构建自组Overlay拓扑[J].软件学报,2008,19(9):2422-2431.
作者姓名:孙 晓  王 晖  汪 浩  姜志宏  陶 钧
作者单位:国防科学技术大学,信息系统与管理学院,湖南,长沙,410073
摘    要:分析了overlay拓扑管理中流言机制的一般过程,发现固定周期的流言报文中存在的数据交换盲目性的弊端.为此,引入动态的自适应用期来代替固定周期,使得局部拓扑稳定的节点较少发出流言报文,而局部拓扑动荡的节点较多发出流言报文.这种方法提高了数据交换效率,节省了网络资源,允许在局部加快数据交换,从而提高拓扑的整体收敛速度.通过仿真实例对该方法的有效性进行了验证,并证实该方法在动态网络环境中尤其适用.

关 键 词:overlay  流言  自组织  收敛速度  自适应
收稿时间:7/1/2006 12:00:00 AM
修稿时间:2007/6/18 0:00:00

Enabling Quick Overlay Topology Construction Using Adaptive Cycle Gossip
SUN Xiao,WANG Hui,WANG Hao,JIANG Zhi-Hong and TAO Jun.Enabling Quick Overlay Topology Construction Using Adaptive Cycle Gossip[J].Journal of Software,2008,19(9):2422-2431.
Authors:SUN Xiao  WANG Hui  WANG Hao  JIANG Zhi-Hong and TAO Jun
Abstract: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.
Keywords:overlay  gossip  self-organization  converge  adaptive
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号