摘要
应用层组播作为当前网络研究的热点,其组播树是构造在虚拟完全连通覆盖网络上的。分析了应用层组播网络路由模型特点,针对带度约束平均延迟代价最小的应用层组播路由问题,提出了一种基于免疫多克隆策略的应用层组播路由算法。仿真实验表明,与基于遗传算法的组播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力,而且算法稳定、灵活,操作简单。
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.
出处
《计算机应用》
CSCD
北大核心
2006年第9期2169-2171,共3页
journal of Computer Applications
基金
教育部博士点基金资助项目(20030290003)
关键词
应用层组播
度约束
平均延迟
多克隆策略
application level multicast
degree constrain
average delay
poly-clonal strategies
