Algorithm of QoS Multicast Routing Based on Genetic Simulated Annealing Algorithm
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 routes set is adopted, and the fitness function is adjusted. The cross-over and mutation method is improved, and simulated annealing algorithm is combined with. The results of simulation show that this approach can improve the speed of convergence and avoid premature convergence. It can meet the corresponding needs of QoS in multi-media communication networks.
multicast routing genetic simulated annealing algorithm QoS
Jinming Liu Guiyang Liu
The College of Information Technology Heilongjiang Bayi Agricultural University Daqing, China
国际会议
太原
英文
220-223
2010-10-22(万方平台首次上网日期,不代表论文的发表时间)