adplus-dvertising
frame-decoration

Question

Protocol Independent Multicast (PIM) has two independent multicast Protocols, those are

a.

PIM-DM and PIM-DS

b.

PIM-DM and PIM-DR

c.

PIM-DM and PIM-DL

d.

PIM-DM and PIM-SM

Posted under Networking

Answer: (d).PIM-DM and PIM-SM

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Protocol Independent Multicast (PIM) has two independent multicast Protocols, those are

Similar Questions

Discover Related MCQs

Q. Reverse Path Forwarding (RPF) is not based on

Q. In an autonomous system, we are dealing with routers and

Q. A metric is the cost assigned for passage of a packet through a

Q. In Unicast Routing, triggered updating process, when a node detects some failure in the neighboring links which results in a distance change to

Q. The Core-Based Tree (CBT) is a

Q. In broadcast communication, the relationship between the source and the destination is

Q. In Core-Based Tree (CBT), if a router wants to leave the group then it sends a leave message to its

Q. Reverse Path Forwarding (RPF) eliminates the loop in the

Q. CBT stands for

Q. Good examples of transit Autonomous Systems are national and international

Q. In Unicast Routing, to avoid two-node instability we can use split horizon strategy combined with

Q. Techniques can make the size of the routing table manageable and also handle issues such as

Q. Protocol Independent Multicast-Sparse Mode (PIM-SM) is used when there is a slight possibility that each router is involved in

Q. Protocol Independent Multicast-Sparse Mode (PIM-SM) is used in sparse multicast environment such as

Q. BGP stands for

Q. In Multicast Routing Protocol, the teleconferencing is the application of

Q. Multicasting is more efficient than

Q. When the source and destination of the packet are located on the same physical network, then

Q. In Unicast Routing, If the instability is between three nodes, stability cannot be

Q. In Unicast Routing, the Dijkstra algorithm creates a shortest path tree from a