Abstract: An approach based on genetic simulated annealing algorithm is proposed, which is used to solve bandwidth, delay, delay variation constraints minimum-cost multicast routing problem. In the algorithm, aiming at the limitation of genetic algorithm, integral sequence encoding method based on the preparative paths set is adopted, and the fitness function is adjusted. The cross and mutation method is improved, and simulated annealing algorithm is combined with. The simulation results show that this approach can improve the speed of convergence and avoid premature convergence. It can meet the corresponding needs of QoS in multimedia communication networks.

Key words: Multicast routing, Genetic simulated annealing algorithm, QoS

摘要： 提出了一种基于遗传模拟退火算法的带宽、时延和时延抖动约束费用最小的组播路由选择方法，该方法针对遗传算法的局限性，采用基于备选路径集的整数队列编码机制，对适应度函数进行了调整，改进了交叉和变异操作，结合了模拟退火算法。实验表明，该算法能够有效地提高收敛速度、避免早熟收敛、满足多媒体网络对相应QoS的需求。

关键词: 组播路由, 遗传模拟退火算法, QoS

CLC Number: 

• TP393