Abstract
Shared tree multicast uses a single core to handle entire multicast traffic load in a domain. In this paper, we present a new multicast approach with multiple cores to reduce the traffic load. Main objective of our present work is to create a group-to-core mapping table a priori, i.e. even before a multicast session begins; it is done immediately after the network is booted. To the best of our knowledge, there does not exist any such multicast architecture for PIM SM related to load sharing. We select statically a set of k primary cores for possible load share with complexity O(n2). This selection is done immediately after the network is booted. At the same time, we create statically k partitions on all possible multicast addresses. The ith partition maps to the ith core in the list of k cores – this means that any new multicast session with multicast group address belonging to the ith partition will use the ith core from the list of k cores to implement PIM SM. In addition, we have incorporated fault tolerance in our approach to tackle the problem of any number of primary core failures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adams, A., Nicholas, J., Siadak, W.: Protocol independent multicast - dense mode (PIM-DM). Internet Engineering Task Force (IETF), RFC-3973, January 2005
Ballardie, T.A.: Core based tree multicast routing architecture. Internet Engineering Task Force (IETF), RFC 2201, September 1997
Karaman, A., Hassanein, H.: Core selection algorithms in multicast routing – comparative and complexity analysis. J. Comput. Commun. 29(8), 998–1014 (2006)
Deering, S.E., Cheriton, D.R.: Multicast routing in datagram internetworks and extended LANs. ACM Trans. Comput. Syst. (TOCS) 8(2), 85–110 (1990)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE J. Sel. Areas Commun. 15(3), 346–356 (1997)
Fenner, B., Handley, M., Holbrook, H., Kouvelas, I.: Protocol independent multicast - sparse mode (PIM-SM), Internet Engineering Task Force (IETF), RFC-4601, August 2006
Jia, W., Zhao, W., Xuan, D., Xu, G.: An efficient fault-tolerant multicast routing protocol with core - based tree techniques. IEEE Trans. Parallel Distribut. Syst. 10(10), 984–1000 (1999)
Koneru, S., Gupta, B., Rahimi, S., Liu, Z.: Hierarchical pruning to improve bandwidth utilization of RPF-based broadcasting. In: IEEE Symposium on Computers and Communications (ISCC), Split, Croatia, pp. 96–100, July 2013
Koneru, S., Gupta, B., Debnath, N.: A novel DVR based multicast routing protocol with hierarchical pruning. Int. J. Comput. Appl. (IJCA) 20(3), 184–191 (2013)
Koneru, S., Gupta, B., Rahimi, S., Liu, Z., Debnath, N.: A highly efficient RPF-based broadcast protocol using a new two-level pruning mechanism. J. Comput. Sci. (JOCS) 5(3) (2014). SpringerLink, vol. 2345, pp. 1045–1056, Berlin, Heidelberg (2002)
Lin, H.-C., Lai, S.-C.: A simple and effective core placement method for the core-based tree multicast routing architecture. In: Proceedings of IEEE International Conference on Performance, Computing, and Communications, pp. 215–219, February 2000
Pusateri, T.: Distance vector multicast routing protocol, Juniper Networks, Internet Engineering Task Force (IETF), draft-ietf-idmr-dvmrp-v3-11.txt, October 2003
Shim, Y.-C., Kang, S.-K.: New center location algorithms for shared multicast trees. Lecture Notes in Computer Science, Vol. 2345, pp. 1045–1056. Springer, Heidelberg (2002)
Thaler, D.G., Ravishankar, C.V.: Distributed center-location algorithms. IEEE J. Sel. Areas Commun. 15(3), 291–303 (1997)
Waitzman, D., Partridge, C., Deering, S.E.: Distance vector multicast routing protocol (DVMRP), Internet Engineering Task Force (IETF), RFC 1075, November 1988
Jia, W., Tu, W., Zhao, W., Xu, G.: Multi-shared-trees based multicast routing control protocol using anycast selection. Int. J. Parallel Emerg. Distrib. Syst. 20(4), 69–84 (2005)
Shields, C., Garcia-Luna-Acevez, J.J.: The ordered core-based tree protocol. In: Proceedings of IEEE INFOCOM 1997 (1997)
Zappala, D., Fabbri, A., Lo, V.: An evaluation of shared multicast trees with multiple active cores. J. Telecommun. Syst. 19, 461–479 (2002)
Estrin, D., Handley, M., Helmy, A., Huang, P.: A dynamic bootstrap mechanism for rendezvous-based multicast routing. In: Proceedings of IEEE INFOCOM (1999)
Load Splitting IP Multicast Traffic over ECMP, Cisco, March 2015. www.cisco.com/c/en/us/td/docs/ios/12_4t/ip_mcast/configuration/guide/mctlsplt.html
Gupta, B., Alyanbaawi, A., Rahimi, N., Sinha, K., Liu, Z.: Novel low latency load shared multicore multicasting schemes─an extension to core migration. IJCA 25(3) (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Roy, I., Rekabdar, B., Kaluvakuri, S., Maddali, K., Gupta, B., Debnath, N. (2020). A Novel Multicore Multicasting Scheme for PIM-SM. In: Serrhini, M., Silva, C., Aljahdali, S. (eds) Innovation in Information Systems and Technologies to Support Learning Research. EMENA-ISTL 2019. Learning and Analytics in Intelligent Systems, vol 7. Springer, Cham. https://doi.org/10.1007/978-3-030-36778-7_69
Download citation
DOI: https://doi.org/10.1007/978-3-030-36778-7_69
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36777-0
Online ISBN: 978-3-030-36778-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)