Multicast routing via non-minimal paths
AssigneeDell Products L.P.
InventorsRamasubramani MAHADEVAN, Shivakumar SUNDARAM
Life of this patent
Estimating the term…
Abstract
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.
Claims20
A method of routing traffic for routing through a node of a network, comprising:
- 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 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.
An information handling system that routs traffic for multi-cast routing, comprising:
- a memory;
- a processor coupled to receive message traffic from a network, the processor executing instructions for
- receiving a join from a node in the network on a shortest path between the node and the information handling system;
- retrieving loop-free alternative paths to the node from the information handling system;
- and
- adding an entry to a multi-cast routing table stored in the memory that is based on a group that includes the shortest path to the node and the loop-free alternative paths to the node as cost equivalent paths.
A method of routing in a node of a network, comprising:
- receiving a packet from a transmitting node of the network;
- determining a destination node for the packet;
- looking up the destination node in a routing table, the routing table including shortest path and loop-free alternative paths to the destination node;
- and
- transmitting the packet along one of the shortest path and loop-free alternative paths.
Dependencies are inferred from the claim text.