The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2008 vol.19)
pp: 476-488
In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on Explicit Multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Two optimization problems are formulated in this paper. The first one, MINSTATE, is to minimize the total number of routers storing forwarding states in a multicast tree. We design a distributed algorithm that obtains the optimal solution of the problem. The second one, BALANCESTATE, is to minimize the maximum number of forwarding states stored in a router for all multicast groups. We prove that the second problem is NP-hard and propose an approximation algorithm and a distributed algorithm for the problem. We prove that this allocation is a special case of our mechanism. From the simulation results, we show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance the forwarding states stored among routers, and also reduce the number of routers storing the forwarding states of a multicast tree. Therefore, our mechanism can improve the scalability of Source-Specific Multicast and traditional IP multicast.
Optimization, Multicast
De-Nian Yang, Wan-Jiun Liao, "Optimal State Allocation for Multicast Communications With Explicit Multicast Forwarding", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 4, pp. 476-488, April 2008, doi:10.1109/TPDS.2007.70754
[1] P.V. Mieghem, G. Hooghiemstra, and R. Hofstad, “On the Efficiency of Multicast,” IEEE/ACM Trans. Networking, vol. 9, no. 6, pp. 719-732, Dec. 2001.
[2] W. Fenner, “Internet Group Management Protocol Version 2,” IETF RFC 2236, Nov. 1997.
[3] D. Waitzman, C. Partridge, and S. Deering, “Distance Vector Multicast Routing Protocol,” IETF RFC 1075, 1988.
[4] J. Moy, “Multicast Routing Extensions for OSPF,” Comm. ACM, vol. 37, no. 8, pp. 61-66, 1994.
[5] T. Ballardie, P. Francis, and J. Crowcroft, “Core-Based Trees (CBT),” Proc. ACM SIGCOMM '93, pp. 85-95, 1993.
[6] S. Deering et al., “The PIM Architecture for Wide-Area Multicast Routing,” IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153-162, Apr. 1996.
[7] D. Thaler, M. Handley, and D. Estrin, The Internet Multicast Address Allocation Architecture, IETF RFC 2908, 2000.
[8] S. Bhattacharyya, An Overview of Source-Specific Multicast (SSM), IETF RFC 3569, July 2003.
[9] P.I. Radoslavov, E. Estrin, and R. Govindan, “Exploiting the Bandwidth-Memory Tradeoff in Multicast State Aggregation,” technical report, Dept. of Computer Science, Univ. of Southern California, pp. 99-697, 1999.
[10] T. Wong, R. Katz, and S. McCanne, “An Evaluation of Preference Clustering in Large-Scale Multicast Applications,” Proc. IEEE INFOCOM '00, pp. 451-460, 2000.
[11] S. Song, Z. Zhang, B. Choi, and D.H.C. Du, “Protocol Independent Multicast Group Aggregation Scheme for the Global Area Multicast,” Proc. IEEE GLOBECOM '00, pp. 370-375, 2000.
[12] A. Fei, J. Cui, M. Gerla, and M. Faloutsos, “Aggregated Multicast: An Approach to Reduce Multicast State,” Proc. IEEE GLOBECOM '01, pp. 1595-1599, 2001.
[13] J. Tian and G. Neufeld, “Forwarding State Reduction for Sparse Mode Multicast Communication,” Proc. IEEE INFOCOM '98, pp.711-719, 1998.
[14] I. Stoica, T.S.E. Ng, and H. Zhang, “REUNITE: A Recursive Unicast Approach to Multicast,” Proc. IEEE INFOCOM '00, pp.1644-1653, 2000.
[15] T. Wong and R. Katz, “An Analysis of Multicast Forwarding State Scalability,” Proc. Eighth IEEE Int'l Conf. Network Protocols (ICNP '00), pp. 105-115, 2000.
[16] V. Visoottiviseth, H. Kido, and Y. Takahashi, “Sender Initiated Multicast (SIM),” IETF Internet Draft, work in progress, Mar. 2003.
[17] A. Boudani and B. Cousin, “Simple Explicit Multicast (SEM),” IETF Internet Draft, work in progress, June 2003.
[18] A. Boudani, B. Cousin, and J. Bonnin, “An Effective Solution for Multicast Scalability: The MPLS Multicast Tree (MMT),” IETF Internet Draft, work in progress, June 2003.
[19] R. Boivie, N. Feldman, Y. Imai, W. Livens, and D. Ooms, Explicit Multicast (Xcast) Concepts and Options, IETF RFC 5058, Nov. 2007.
[20] R.M. Karp, “Reducibility among Combinatorial Problems,” Complexity of Computer Computations, Plenum Press, pp. 85-104, 1972.
[21] B.M. Waxman, “Routing of Multipoint Connections,” IEEE J.Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
[22] USC/ISI SCAN Project,, 2007.
[23] R. Chalmers and K. Almeroth, “On the Topology of Multicast Trees,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 153-165, Feb. 2003.
[24] Mwalk Project, http://www.nmsl.cs.ucsb.edumwalk/, 2007.
[25] H. Tangmunarunkit, R. Govindan, and J. Jamin, “Network Topology Generators: Degree-Based vs. Structurel,” Proc. ACM SIGCOMM '02, pp. 147-159, 2002.
[26] Inet Topology Generator, http://topology.eecs.umich.eduinet/, 2007.
[27] E.W. Zegura, K.L. Calvert, and M.J. Donahoo, “A Quantitative Comparison of Graph-Based Models for Internet Topology,” IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 770-783, Dec. 1997.
[28] G. Phillips, S. Shenker, and H. Tangmunarunkit, “Scaling of Multicast Trees: Comments on the Chuang-Sirbu Scaling Law,” Proc. ACM SIGCOMM '99, pp. 41-51, 1999.
[29] D.-N. Yang, “Scalability in Xcast-Based Multicast,” PhD dissertation, Nat'l Taiwan Univ., 2004.
478 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool