Cart (Loading....) | Create Account
Close category search window
 

A fast 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)
Baoxian Zhang ; Sch. of Electron. & Inf. Eng., Northern Jiaotong Univ., Beijing, China ; Kruntz, M.M. ; Changjia Chen

In this paper, we propose a fast multicast routing heuristic, called DCMA, for delay-sensitive applications. The running complexity of DCMA is O(m log m+|V|), where m is the size of the multicast group and |V| is the number of nodes in the network. We first present a unicast version of DCMA, called SDCR, which is used to setup an end-to-end, cost effective delay-constrained path between two nodes. SDCR can always find a delay-constrained path if one exists. Its running complexity is O(|V|). SDCR is used in constructing DCMA, which is guaranteed to be loop free. Simulation results are used to demonstrate the high performance and cost effectiveness of the proposed heuristic

Published in:

Communications, 2001. ICC 2001. IEEE International Conference on  (Volume:9 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.