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.

[1]  Nello Cristianini,et al.  Kernel Methods for Pattern Analysis , 2003, ICTAI.

[2]  Juyang Weng,et al.  Hierarchical Discriminant Regression , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Junzhou Luo,et al.  QoS routing based on genetic algorithm , 1999, Comput. Commun..

[4]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[5]  Vladimir Vapnik,et al.  An overview of statistical learning theory , 1999, IEEE Trans. Neural Networks.

[6]  M.E. El-Hawary,et al.  Multicast routing with delay and delay variation constraints using genetic algorithm , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[7]  Erdun Zhao,et al.  Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001, Comput. Commun..

[8]  Zhang Ku.  A Multi-Constrained QoS Multicast Routing Algorithm Based on Simulated Annealing , 2005 .