By Topic

Two multi-constrained multicast QoS routing algorithms

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)
Huang Lin ; Dalian Univ. of Technol., Dalian ; Zhang Yu-lin ; Ren Yong-Hong

Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks.In the paper,for the multi-constrained minimum Steiner tree problem, we proposed a CBT-based multi-constrained multicast routing algorithm(CMCMRA) and a SPH-based multi-constrained multicast routing algorithm(SMCMRA). Anlysis showed the algorithms are easy to implement and the time complexities are quite and simulation results illustrated the algorithms have features of well performance of cost and guarantee QoS multiple constraints efficiently.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on  (Volume:3 )

Date of Conference:

July 30 2007-Aug. 1 2007