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

利用分散搜索算法实现受时延约束的多播路由
引用本文:赵强,张鹏飞,孙立镌.利用分散搜索算法实现受时延约束的多播路由[J].软件,2011(11):13-16.
作者姓名:赵强  张鹏飞  孙立镌
作者单位:哈尔滨理工大学计算机科学与技术学院;
基金项目:国家自然科学基金No.60173055~~
摘    要:提出一种新的基于分散搜索算法 (Scatter Search,SS) 来解决受时延约束的多播路由的方法。作为进化算法的一种,分散搜索算法不但继承了进化算法中通过杂交和变异算子来增强性能的机制,还独创性地运用了“分散 - 收敛集聚”的迭代机制。通过在受时延约束多播路由算法上应用 SS 算法,寻找包含所有组播节点在内的最小代价树。实验表明,本算法具有较好的收敛性和分布性。

关 键 词:多播路由算法  受时延约束  分散搜索算法  最小代价树

Using scatter search for Delay-constrained multicast routing
ZHAO Qiang,ZHANG Peng-Fei,SUN Li-Juan.Using scatter search for Delay-constrained multicast routing[J].Software,2011(11):13-16.
Authors:ZHAO Qiang  ZHANG Peng-Fei  SUN Li-Juan
Affiliation:ZHAO Qiang,ZHANG Peng-Fei,SUN Li-Juan(1.Computer Science & Technology College,Harbin University of Science and Technology,Harbin 150080,China)
Abstract:This paper proposed a new Delay-constrained multicast routing algorithm based on scatter search algorithm.As one of evolutionary methods,scatter search algorithm not only inherits the performance enhancing mechanism of using crossover and mutation operators as in genetic algorithm,but also creatively introduces an iterative mechanism which is called distributing-convergence collecting into it.Minimum cost tree containing all multicast nodes are found by applying SS in the Delay-constrained multicast routing...
Keywords:multicast routing algorithm  Delay-constrained  scatter search algorithm  minimum cost tree  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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