Abstract
An efficient heuristic multicast routing algorithm based on simulated annealing named SADDVS is proposed to solve delay and delay variation-bounded Steiner tree problem. This problem is known to be NP-complete. The proposed heuristic algorithm uses a procedure called paths switching to construct, neighbors in feasible region, which greatly reduces the search area and running time. We also give a method to dynamically reorganize the multicast tree in response to changes for the destinations. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms. Further, it performs excellent performance of delay and delay variation, high success ratio, rapid convergence and better real-time property.
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.
