摘要
在分析选播通信模型的基础上,提出一种基于克隆策略的QoS选播路由算法,在保证带宽和时延的条件下对目标函数进行优化,对带时延约束的QoS选播路由问题作了深入研究。既保留了遗传算法较强的全局搜索能力,又避免了局部搜索性能差和早熟现象,实验结果表明与基于遗传算法的选播路由算法相比,此算法是有效可行的。
Based on studying anycast service, an anycast QoS routing algorithm based on clone strategies is presented in this paper.With the bandwidth and delay constraints, the algorithm optimizes objective function, the problem of delay-constrained QoS anycast routing is lubricated.It reserves superior search ability for global search in generation algorithm, and avoids poor performance of local search and precocious phenomenon.Simulation results show that compared with those based on genetic algorithm,the algorithm is feasible and effective.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第35期11-13,60,共4页
Computer Engineering and Applications
基金
国家创新基金项目(No.BT2008-22)
关键词
选播
路由算法
QOS参数
时延约束
克隆策略
anycast
routing algorithm
QoS parameters
delay constraint
clone strategies
