We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A dynamic algorithm used in multicast routing

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)
Xiongfei Li ; Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China ; Xiangqun Li ; Xiangni Li

A dynamic multicast routing algorithm called CRMR is presented. An initial multicast tree is constructed by the KPP algorithm and a virtual trunk (VT) is built simultaneously in the algorithm. The trigger function (TF) that associates the QoS effected by members update in this region is used in CRMR. We also introduce a bandwidth indication function to alter CRMR algorithm to fit multiple QoS guaranteed, which can deal with the constraints of bandwidth and delay. The performances are compared among CRMR algorithm with others by simulation. The results indicate that CRMR is better.

Published in:

Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on  (Volume:2 )

Date of Conference:

26-28 May 2004