This Article 
 Bibliographic References 
 Add to: 
Many to Many Multicast Routing With Temporal Quality of Service Guarantees
June 2003 (vol. 52 no. 6)
pp. 826-832

Abstract—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 jitter bound as the QoS requirement and formulate the Delay and Delay Jitter Constrained Many-to-Many Multicast Tree (D^2 M^3 T) 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.

[1] A. Ballardie, Core Based Trees (CBT) Multicast Routing Architecture technical memo, IETF RFC 2201, 1999.
[2] F. Bauer and A. Varma, Degree-Constrained Multicasting in Point-to-Point Networks Proc. IEEE Conf. Computer Comm. (INFOCOM '95), pp. 369-376, Apr. 1995.
[3] S. Chen and K. Nahrstedt, An Overview of Quality of Service Routing for the Next Generation of High Speed Networks: Problems and Solutions IEEE Network, 1998.
[4] S. Chopra and M.R. Rao, The Steiner Tree Problem I: Formulation, Compositions and Extension of Facets Math. Programming, vol. 64, 1994.
[5] D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C.-G. Liu, P. Sharma, and L. Wei, Protocol Independent Multicast Sparse Mode (PIM-SM): Protocol Specification technical memo, RFC 2362, 1998.
[6] J. Moy, Multicast Extensions to OSPF technical memo, RFC 1584 Mar. 1994.
[7] T. Pusateri, Distance Vector Multicast Routing Protocol working draft, Aug. 2000, .
[8] G. Rouskas and I. Baldine, Multicast Routing with End-to-End Delay and Delay Variation Constraints IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 346-356, Apr. 1997.
[9] H.-Y. Tyan, J.C. Hou, and B. Wang, Many to Many Multicast Routing with Temporal Quality of Service Guarantees technical report, Dept. of Computer Science, Univ. of Illinois at Urbana Champaign, Nov. 2001.
[10] B. Wang and J.C. Hou, Multicast Routing and Its QoS Extensions: Problems, Algorithms, and Protocols IEEE Network, vol. 14, no. 1, Jan./Feb. 2000.
[11] B.M. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
[12] P. Winter, Steiner Problem in Networks: A Survey Networks, vol. 17, 1987
[13] Q. Zhu, M. Parsa, and J.J. Garcia Aceves Luna, A Source Based Algorithm for Delay-Constrained Minimum-Cost Multicasting IEEE Proc. IEEE Conf. Computer Comm. (INFOCOM '95), pp. 377-385, Apr. 1995.

Index Terms:
QoS, many-to-many multicast routing, delay and delay jitter constraints, source-based multicast tree, core-based multicast tree.
Hung-Ying Tyan, Jennifer C. Hou, Bin Wang, "Many to Many Multicast Routing With Temporal Quality of Service Guarantees," IEEE Transactions on Computers, vol. 52, no. 6, pp. 826-832, June 2003, doi:10.1109/TC.2003.1204837
Usage of this product signifies your acceptance of the Terms of Use.