首页 | 本学科首页   官方微博 | 高级检索  
     

基于多克隆策略的应用层组播路由算法
引用本文:王德志,余镇危,甘金颖,王德毓. 基于多克隆策略的应用层组播路由算法[J]. 计算机应用, 2006, 26(9): 2169-2171
作者姓名:王德志  余镇危  甘金颖  王德毓
作者单位:中国矿业大学(北京)机电与信息工程学院,北京,100083;华北科技学院,电子信息工程系,北京,101601
基金项目:高等学校博士学科点专项科研项目
摘    要:应用层组播作为当前网络研究的热点,其组播树是构造在虚拟完全连通覆盖网络上的。分析了应用层组播网络路由模型特点,针对带度约束平均延迟代价最小的应用层组播路由问题,提出了一种基于免疫多克隆策略的应用层组播路由算法。仿真实验表明,与基于遗传算法的组播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力,而且算法稳定、灵活,操作简单。

关 键 词:应用层组播  度约束  平均延迟  多克隆策略
文章编号:1001-9081(2006)09-2169-3
收稿时间:2006-03-14
修稿时间:2006-03-142006-05-26

Application level multicast routing algorithm based on poly-clonal strategies
WANG De-zhi,YU Zhen-wei,GAN Jin-ying,WANG De-yu. Application level multicast routing algorithm based on poly-clonal strategies[J]. Journal of Computer Applications, 2006, 26(9): 2169-2171
Authors:WANG De-zhi  YU Zhen-wei  GAN Jin-ying  WANG De-yu
Abstract:Application level multicast is a hot issue in current network study. Its multicast tree is constructed on the virtual completely-connected overlay network. The characteristic of an application level multicast routing model was analyzed in this paper. A new application level muhicast routing algorithm with degree and average delay constrains was proposed based on poly-elonal strategies. Simulations show that compared with those based on genetic algorithm, the application level multicast routing based on poly-clonal strategies has faster converging speed and better ability of global searching. And the proposed algorithm is stable, flexible and user-friendly.
Keywords:application level multicast   degree constrain   average delay   poly-clonal strategies
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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