By Topic

A dynamic multicast routing algorithm with load-balance and minimum bandwidth cost under delay constraint

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

2 Author(s)
Qiu Zang ; State Key Lab. of Inf. Photonics & Opt. Commun., Beijing Univ. of Posts & Telecommun., Beijing, China ; Chao Fang

Multicast services are becoming more popular in the current network. As a result, the multicast routing algorithm which is load-balanced and minimum bandwidth resource will be more important since the bandwidth resource is seriously scarce and the network load is imbalance. To solve these problems, this paper proposes a dynamic multicast routing algorithm for minimum bandwidth cost and load-balanced under delay constraint, which is called DCLB. With abundant of simulation experiments by MATLAB, the experiment results show that the algorithm DCLB can save bandwidth resource as well as accomplish load-balance under the exact delay constraint. Such algorithm can meet the desired network requirements well.

Published in:

Electrical and Control Engineering (ICECE), 2011 International Conference on

Date of Conference:

16-18 Sept. 2011