Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An efficient multicast routing algorithm based on simulated annealing for multimedia communications

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., Nanjing Univ. of Sci. & Technol., China ; Fengyu Liu ; Yi Zhong

To support various quality-of-service performance requirements of multimedia communications, more real-time applications need to transmit information in manner of multicasting. In this paper, an efficient multicast routing algorithm based on simulated annealing named SAMRA is proposed to solve delay- and delay variation-bounded Steiner tree problem. This problem is known to be NP-complete. To avoid enlargement of search area and increase of computing time, the proposed heuristic algorithm uses 'paths-switching' strategy to construct neighbors in the range of feasible solutions according to the relationship between delay and delay variation. Simulations demonstrates that the algorithm has characteristics of feasibility, stability and rapid convergence, and it can effectively construct multicast tree with lower cost according to QoS request, and has better real-time property.

Published in:

Systems, Man and Cybernetics, 2005 IEEE International Conference on  (Volume:1 )

Date of Conference:

10-12 Oct. 2005