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

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

作　　者：王德志[1] 余镇危[1] 甘金颖[2] 王德毓[2] 

机构地区：[1]中国矿业大学研究生院,北京100083 [2]华北科技学院电信系,北京101601

出　　处：《计算机工程》2007年第3期105-107,共3页Computer Engineering

基　　金：教育部博士点基金资助项目(20030290003)

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

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

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