Multicast Routing Concepts

A routing algorithm where each router maintains a distance vector to other routers, providing a cost (hop count) to reach a destination.

A routing algorithm where a router calculates the shortest path to all destinations and uses that to forward packets.

A source-based multicast routing protocol that dynamically builds trees based on receiver requests.

A multicast routing solution that uses a central point to control the distribution of multicast data.

A message used in multicast routing to temporarily disable a routing table entry, effectively removing a link from the multicast tree.

The reverse path forwarding interface, used by multicast routers to determine the direction of incoming multicast data.

A message sent to re-activate a pruned routing table entry, re-establishing a link in the multicast tree.

A multicast routing method where a source floods multicast data to all connected networks and allows receivers to prune unnecessary paths.

A multicast routing protocol that constructs a shortest-path tree for each sender, ensuring the most efficient path from the sender to each receiver.

A multicast routing protocol that creates a single tree connecting all multicast group members. It's ideal for multiple senders but computationally expensive for large networks.

A multicast routing protocol that builds source-based trees, flooding data to all routers and then pruning branches based on receiver presence. It's used for efficiently delivering multicast data to receivers on the network.

A multicast routing protocol that builds core-based trees and source-based trees with explicit joins. It's suitable for large networks with sparsity and allows receivers to directly join multicast groups.

A multicast routing protocol that utilizes extensions to OSPF to build shortest-path trees using a link state database.

A multicast routing protocol that utilizes a core-based tree approach to distribute data. It's often used for large networks, where a central router manages the distribution of multicast data.

This method involves receivers knowing the source address, sending a Join message to their Reverse Path Forwarding (RPF) neighbor, creating (S,G) routing table entries to specify the source and group, and passing on the Join message toward the source.

A multicast routing solution where data is sent to a central point, or 'core,' before being forwarded to receivers. The core is known as a rendezvous point (RP) and is either statically configured or dynamically elected.

A core-based multicast routing approach where receivers know the rendezvous point's IP address and send Join messages to their RPF neighbor with respect to the core. This creates (*, G) routing table entries, enabling the router to forward data packets to the core and then toward the receivers.

In a core-based tree, the source sends data to the core, which in turn forwards it to all receivers based on the established routing table entries created through Join requests. This way, the source doesn't have to directly manage connections to every receiver.

A multicast routing model that relies on receivers proactively sending Join messages to announce their interest in receiving data from a specific source. This approach uses the source's IP address in the routing table entry to direct traffic.