By Topic

Multicast routing for delay and delay variation bounded Steiner tree using simulated annealing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kun Zhang ; Dept. of Comput. Sci. & Technol., Nanjing Univ. of Sci. & Technol., China ; Heng Wang ; Fengyu Liu

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.

Published in:

Networking, Sensing and Control, 2005. Proceedings. 2005 IEEE

Date of Conference:

19-22 March 2005