Multicast routing via non-minimal paths
View Patent ↗A method of routing traffic for multi-cast routing through a node of a network that utilizes loop-free alternative paths is presented. The method includes receiving a join in the node from a second node in the network on a shortest path between the node and the second node; retrieving loop-free alternative paths to the second node; and adding an entry to a multi-cast routing table at the node that is based on a group that includes the shortest path to the second node and the loop-free alternative paths to the second node as cost equivalent paths.
1. A network node comprising:
a memory; and
a processor coupled to the memory, the processor being configured to:
receive, from another network node, a multicast join message for a multicast group on a shortest path between the network node and the another network node;
in response to the multicast join message, process the multicast join message, wherein the processing of the multicast join message comprises:
determining loop-free alternative paths to the another network node;
adding an entry to a multicast routing table stored in the memory, the entry identifying as multicast paths to the another network node for the multicast group a single logical ECMP (Equal Cost Multiple Paths) interface that groups together the shortest path between the network node and the another network node and each of the loop-free alternative paths as equal cost paths, each of the loop-free alternative paths being a tunneled path set up to enable the another network node to receive multicast traffic with valid reverse-path forwarding (RPF) checks passed when the multicast traffic is transmitted on the single logical ECMP interface via any one of the shortest path and each of the loop-free alternative paths;
after processing the multicast join message, load-share multicast traffic to the multicast group across the shortest path and each of the loop-free alternative paths by transmitting the multicast traffic on the single logical ECMP interface, wherein the load-sharing comprises:
receiving multicast packets for replication to the multicast group; and
replicating the multicast packets to the another network node on the single logical ECMP interface, wherein replicating the multicast packets comprises:
for each multicast packet, choosing a particular path to replicate the multicast packet, the particular path being one of the shortest path between the network node and the another network node and each of the loop-free alternative paths included in the single logical ECMP interface, the particular path being chosen to load-share the multicast packets across the shortest path and the loop-free alternative paths; and
replicating the multicast packets on the single logical ECMP interface, each multicast packet being replicated via the particular path chosen for the multicast packet, to perform said load-sharing and cause the another network node to receive each multicast packet with a valid RPF check passed regardless of the path chosen as the particular path.
2. The network node of claim 1 , wherein to determine the loop-free alternative paths the processor is further configured to look up the loop-free alternative paths in a unicast routing table.
3. The network node of claim 1 , wherein to determine the loop-free alternative paths the processor is further configured to determine trees from a topology between the network node to the another network node.
4. The network node of claim 1 , wherein the loop-free alternative paths include all of the loop-free alternative paths between the network node and the another network node.
5. A method of routing traffic, comprising:
receiving, by a first network node from a second network node, a multicast join message for a multicast group on a shortest path between the first network node and the second network node;
in response to the multicast join message, processing the multicast join message, wherein the processing of the multicast join message comprises:
determining, by the first network node, loop-free alternative paths to the second network node;
adding, by the first network node, an entry to a multicast routing table stored in a memory of the first network node, the entry identifying as multicast paths to the second network node for the multicast group a single logical ECMP (Equal Cost Multiple Paths) interface that groups together the shortest path between the first network node and the second network node and each of the loop-free alternative paths as equal cost paths, each of the loop-free alternative paths being a tunneled path set up to enable the second network node to receive multicast traffic with valid reverse-path forwarding (RPF) checks passed when the multicast traffic is transmitted on the single logical ECMP interface via any one of the shortest path and each of the loop-free alternative paths;
after processing the multicast join message, load-sharing multicast traffic to the multicast group across the shortest path and each of the loop-free alternative paths by transmitting the multicast traffic on the single logical ECMP interface, wherein the load-sharing comprises:
receiving, by the first network node, multicast packets for replication to the multicast group; and
replicating, by the first network node, the multicast packets to the second network node on the single logical ECMP interface, the replicating comprising:
for each multicast packet, choosing a particular path to replicate the multicast packet, the particular path being one of the shortest path between the first network node and the second network node and each of the loop-free alternative paths included in the single logical ECMP interface, the particular path being chosen to load-share the multicast packets across the shortest path and the loop-free alternative paths; and
replicating the multicast packets on the single logical ECMP interface, each multicast packet being replicated via the particular path chosen for the multicast packet, to perform said load-sharing and cause the second network node to receive the multicast packet with a valid RPF check passed regardless of the path chosen as the particular path.
6. The method of claim 5 , wherein determining the loop-free alternative paths comprises looking up the loop-free alternative paths in a unicast routing table.
7. The method of claim 5 , wherein determining the loop-free alternative paths comprises determining trees from a topology between the first network node to the second network node.
8. The method of claim 5 , wherein the loop-free alternative paths include all of the loop-free alternative paths between the first network node and the second network node.
9. An information handling system that routes traffic for multicast routing, the system comprising:
a first network node having a memory and a processor coupled to the memory;
the first network node being configured to:
receive, from a second network node, a multicast join message for a multicast group on a shortest path between the first network node and the second network node;
in response to the multicast join message, process the multicast join message, wherein the processing of the multicast join message comprises:
determining loop-free alternative paths to the second network node;
adding an entry to a multicast routing table stored in the memory, the entry identifying as multicast paths to the second network node for the multicast group a single logical ECMP (Equal Cost Multiple Paths) interface that groups together the shortest path between the first network node and the second network node and each of the loop-free alternative paths as equal cost paths, each of the loop-free alternative paths being a tunneled path set up to enable the second network node to receive multicast traffic with valid reverse-path forwarding (RPF) checks passed when the multicast traffic is transmitted on the single logical ECMP interface via any one of the shortest path and each of the loop-free alternative paths;
after processing the multicast join message, load-share multicast traffic to the multicast group across the shortest path and each of the loop-free alternative paths by transmitting the multicast traffic on the single logical ECMP interface, wherein the load-sharing comprises:
receiving multicast packets for replication to the multicast group; and
replicating the multicast packets to the second network node on the single logical ECMP interface, the replicating comprising:
for each multicast packet, choosing a particular path to replicate the multicast packet, the particular path being one of the shortest path between the first network node and the second network node and each of the loop-free alternative paths included in the single logical ECMP interface, the particular path being chosen to load-share the multicast packets across the shortest path and the loop-free alternative paths; and
replicating the multicast packets on the single logical ECMP interface, each multicast packet being replicated via the particular path chosen for the multicast packet, to perform said load-sharing and cause the second network node to receive the multicast packet with a valid RPF check passed regardless of the path chosen as the particular path.
10. The system of claim 9 , wherein to determine the loop-free alternative paths the first network node is further configured to look up the loop-free alternative paths in a unicast routing table.
11. The system of claim 9 , wherein to determine the loop-free alternative paths the first network node is further configured to determine trees from a topology between the first network node to the second network node.
12. The network node of claim 1 wherein at least one loop-free alternative path utilizes multiple links.
13. The method of claim 5 wherein at least one loop-free alternative path utilizes multiple links.
14. The information handling system of claim 9 wherein at least one loop-free alternative path utilizes multiple links.