Translator Disclaimer
15 April 2004 QoS multicast routing based on simulated annealing algorithm
Author Affiliations +
Proceedings Volume 5282, Network Architectures, Management, and Applications; (2004) https://doi.org/10.1117/12.520383
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China
Abstract
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xi-lian Wang and Zhen Jiang "QoS multicast routing based on simulated annealing algorithm", Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); https://doi.org/10.1117/12.520383
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top