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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
