By Topic

Many-to-many multicast routing with temporal quality of service guarantees

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)
Hung-ying Tyan ; IP Networking Res., Fujitsu Labs of America, Sunnyvale, CA, USA ; Hou, J.C. ; Bin Wang

In this paper, we address the problems of constructing both source-based and core-based many-to-many multicast trees for applications with delay and/or delay jitter constraints. We use the source-destination delay bound and the interdestination delay fitter bound as the QoS requirement and formulate the delay and delay jitter constrained many-to-many multicast tree (D2M3T) problems. For the source-based, many-to-many multicast paradigm, we extend an existing scheme that builds a one-to-many, QoS-compliant multicast tree and devise a solution scheme that first finds a feasible multicast tree for each source node in the multicast group and then a minimum cover of these multicast trees such that there exists at least one feasible multicast tree in the minimum cover for each source node. For the core-based, many-to-many multicast paradigm, we first derive a necessary and sufficient condition for a core-based multicast tree to be feasible and then devise a solution scheme based on the condition derived. We validate and evaluate both proposed schemes via simulations.

Published in:

Computers, IEEE Transactions on  (Volume:52 ,  Issue: 6 )