By Topic

An efficient delay-constrained multicast routing algorithm

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)
Zhang Baoxian ; Sch. of Electr. & Inf., Northern Jiaotong Univ., Beijing, China ; Liu Yue ; Chen Changjia

We propose a simple multicast routing heuristic for delay-sensitive applications. The running complexity of it is O(m|V), where m is the number of group members and |V is the number of nodes in the network. Experimental results through simulations show that the DCMA achieves good performance

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:2 )

Date of Conference:

2000