东北大学学报(自然科学版) ›› 2007, Vol. 28 ›› Issue (10): 1446-1449.DOI: -

• 论著 • 上一篇    下一篇

基于混沌遗传算法的QoS组播路由

岳承君;郑秀萍;井元伟;   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004;辽宁沈阳110004;辽宁沈阳110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2007-10-15 发布日期:2013-06-26
  • 通讯作者: Yue, C.-J.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60274099);;

QoS multicast routing based on chaotic genetic algorithm

Yue, Cheng-Jun (1); Zheng, Xiu-Ping (1); Jing, Yuan-Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-10-15 Published:2013-06-26
  • Contact: Yue, C.-J.
  • About author:-
  • Supported by:
    -

摘要: 针对遗传算法在搜索最优组播树的过程中易发生早熟收敛的缺点,提出一种抑制早熟的混沌遗传算法.利用混沌的随机性和遍历性,将混沌扰动算子加入到遗传算法的操作中,当判断种群有早熟发生时,就对该种群进行类似变异的混沌扰动操作,从而增加了种群的多样性,既保留遗传算法的全局搜索能力又能有效改善算法性能.仿真结果表明,该算法能克服早熟收敛的缺点,又能快速、有效地构造出满足QoS约束要求的最优组播树.

关键词: 组播路由, 混沌, 遗传算法, 服务质量(QoS)

Abstract: To overcome the drawback that the premature convergence is liable to take place in the process of optimal multicast tree searching by genetic algorithm, a chaotic genetic algorithm is proposed to inhibit the premature. Introducing the intrinsic stochastic property and ergodicity of chaos, the algorithm proposed employs the chaotic perturbation in GA to operate the population with a mutation-like chaotic perturbation when judging that the premature happens. Thus, the population becomes more diverse and the premature convergence can be overcome effectively with GA's ability in global search kept and algorithm performance greatly improved. Simulation results showed that the proposed algorithm can also build an optimal multicast tree efficiently and quickly to meet the requirement of QoS restriction.

中图分类号: