作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (24): 98-100. doi: 10.3969/j.issn.1000-3428.2006.24.035

• 网络与通信 • 上一篇    下一篇

解决多约束QoS组播路由问题的遗传算法

宋乃斌,高随祥   

  1. (中国科学院研究生院,北京 100039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-20 发布日期:2006-12-20

Improved Heuristic Genetic Algorithm for Multicast Routing on Multiple Constrained QoS

SONG Naibin, GAO Suixiang   

  1. (Graduate School, Chinese Academy of Sciences, Beijing 100039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-20 Published:2006-12-20

摘要: 基于多种约束的QoS组播路由选择优化是当前通信网络中的一个重要问题,尽管有许多文献利用遗传算法解决这类问题,但仍然存在着收敛速度与全局收敛性之间的矛盾以及编解码难度大等问题。针对以上问题,提出了一种改进的遗传算法,通过采用预处理机制、特殊的树结构编码和合理的交叉变异策略,大大简化了编解码操作,并在全局收敛的基础上提高了算法的收敛速度。仿真表明,算法性能得到明显提高。

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

Abstract: Multiple constrained QoS routing optimization is an important problem in the current communication network research. Despite the broad application of Genetic Algorithm(GA) in multicast routing problem, it still has the paradox between the convergence speed and the global astringency. Aa improved GA is referred. It uses the preprocessing mechanism, the tree structure coding, the reasonable crossover technique and mutation process. It can simplify the coding and recoding process and increase the convergence speed based on the global astringency. Simulation results show that the proposed algorithm performs better than other algorithms when it be used to solve the multicast routing problem.

Key words: Quality of serve, Multicast routing, Genetic algorithm