Share Email Print

Proceedings Paper

QoS multicast routing based on simulated annealing algorithm
Author(s): Xi-lian Wang; Zhen Jiang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 15 April 2004
PDF: 6 pages
Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.520383
Show Author Affiliations
Xi-lian Wang, Beijing Jiaotong Uinv. (China)
Zhen Jiang, Harbin Univ. of Science and Technology (China)

Published in SPIE Proceedings Vol. 5282:
Network Architectures, Management, and Applications
S. J. Ben Yoo; Kwok-wai Cheung; Yun-Chur Chung; Guangcheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top