QoS multicast routing based on simulated annealing algorithm

Xi-lian Wang; Zhen Jiang

doi:10.1117/12.520383

15 April 2004 QoS multicast routing based on simulated annealing algorithm

Xi-lian Wang, Zhen Jiang

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available