作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (03): 105-107. doi: 10.3969/j.issn.1000-3428.2007.03.038

• 网络与通信 • 上一篇    下一篇

基于免疫克隆的带度约束的应用层组播路由算法

王德志1,余镇危1,甘金颖2,王德毓2   

  1. (1. 中国矿业大学研究生院,北京 100083;2. 华北科技学院电信系,北京 101601)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-02-05 发布日期:2007-02-05

Application Level Multicast Routing Algorithm with Degree Constrain Based on Clonal Strategies

WANG Dezhi1, YU Zhenwei1, GAN Jinying2, WANG Deyu2   

  1. (1. Graduate College, China University of Mining and Technology, Beijing 100083; 2. Department of Electricity and Information, North China Institute of Science Technology, Beijing 101601)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-02-05 Published:2007-02-05

摘要: 应用层组播树构造在虚拟覆盖网络上,分析了应用层组播网络路由模型特点,针对带度约束平均延迟代价最小的应用层组播路由问题,提出了一种基于免疫克隆策略的路由算法。仿真实验表明,与基于遗传算法的组播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力,而且算法稳定、灵活,操作简单。

关键词: 应用层组播, 度约束, 平均延迟, 克隆策略

Abstract: The characteristic of an application level multicast routing model is analyzed, which is structured based on overlay network. A new application level multicast routing algorithm with degree and average delay constrains is advanced based on clonal strategies. Simulations show that compared with those based on genetic algorithm, the application level multicast routing based on clonal strategies has faster converging speed and better ability of global searching with property of stabilization, agility and operating simply.

Key words: Application level multicast, Degree constrain, Average delay, Clonal strategies