QoS multicast routing based on simulated annealing algorithm
Xilian Wang, Zhen Jiang · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2004
The optimization of multicast routing is discussed and the delay-constrained minimum cost multicast tree is constructed by simulated annealing algorithm. A model of multicast routing is presented and the result of simulation is shown. Compared with genetic algorithm , simulated annealing algorithm has the ability to get the optimal solution in a short time. The result indicates that the simulated annealing algorithm has characteristics such as high-efficient in multicast routing.