The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—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 <it>source-destination delay bound</it> and the <it>interdestination delay jitter bound</it> as the QoS requirement and formulate the <it>Delay and Delay Jitter Constrained Many-to-Many Multicast Tree</it> (<tmath>D^2 M^3 T</tmath>) 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.</p>
INDEX TERMS
QoS, many-to-many multicast routing, delay and delay jitter constraints, source-based multicast tree, core-based multicast tree.
CITATION

H. Tyan, J. C. Hou and B. Wang, "Many to Many Multicast Routing With Temporal Quality of Service Guarantees," in IEEE Transactions on Computers, vol. 52, no. , pp. 826-832, 2003.
doi:10.1109/TC.2003.1204837
95 ms
(Ver 3.3 (11022016))