Skip to Main Content
Multicast communication in the internet has been growing rapidly over the last few years. Internet applications transmit data from one sender to many receivers, In Multicast protocols while packet broadcasts to a group of receivers the total numbers of packets swamped in a network decrease. Multicast communication reduces both the time it takes to send data to a large no of receivers and the amount of network resources. It has some drawbacks on added overhead occupied in maintaining globally unique group identifiers and in order to enable addressing a subset of the group the massive amount of state-establishment tasks are required. PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast-capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and optionally creates shortest path trees per source. It has some advantages considering the number of packets sent and simplicity of routing decisions. In this paper, we make an analysis of PIM-SM using NS according to different message types, finding that the register message and join/prune message cause most router processing load, while the join/prune message and bootstrap message consume most network bandwidth. This report presents the prominent features of a tree-based architecture (PIM-SM) by associating with MPLS protocols. Using simulation experiments in ns2, we compare the overhead of multicast signaling of PIM-SM with MPLS.