Method and apparatus for multicast implementation in a network
Interest in multicast group membership may be advertised via a routing system on an Ethernet network along with an indication of an algorithm to be used by the nodes on the network to calculate the distribution tree or trees for the multicast. Each node, upon receipt of the advertisement, will determine the algorithm that is to be used to produce the multicast tree and will use the algorithm to calculate whether it is on a path between nodes advertising common interest in the multicast. Example algorithms may include shortest path algorithms and spanning tree algorithms. This allows multicast membership to be managed via the routing control plane, while enabling spanning tree processes to be used to forward multicast traffic. Since spanning tree is able to install multicast state per service rather than per source per service, this reduces the amount of forwarding state required to implement multicasts on the routed Ethernet mesh network.
1. A method implemented on a node in a network to install a forwarding state for a multicast tree, the method comprising:
responsive to the node's interest in becoming a member of the multicast tree, advertising the node's interest in joining the multicast tree via a first link state advertisement in a routing protocol;
receiving, in response to the advertising, a second link state advertisement from a designated multicast group master comprising an indication of a technique for the node to calculate the multicast tree on the network;
utilizing the technique to determine the multicast tree at the node;
installing a forwarding state for the multicast tree responsive to the node being on a path of the multicast tree between a source node and at least one node advertising interest in the multicast tree;
responsive to a downstream node being removed from the multicast tree, removing all multicast entries for a downstream direction; and
utilizing a handshake procedure to update the multicast tree with the downstream node removed.
2. The method of claim 1 , wherein the multicast tree comprises a plurality of nodes in the network and the technique is utilized by all of the plurality of nodes such that all of the plurality of nodes compute exactly a same tree for the multicast tree.
3. The method of claim 1 , wherein the technique comprises tie-breaking techniques such that all nodes in the network calculating the multicast tree utilize the same tie-breaking techniques to compute exactly a same tree for the multicast tree.
4. The method of claim 1 , wherein the technique comprises utilization of a shortest path tree.
5. The method of claim 1 , wherein the technique comprises calculation of a spanning tree.
6. The method of claim 1 , further comprising:
establishing a root node of the multicast tree via messages between the node and at least one other node of the multicast tree.
7. The method of claim 1 , wherein the technique performs one of specifying a root node for the multicast tree and providing a determination technique for the node to correctly determine the root node.
8. An apparatus at a node in a network to install a forwarding state for a multicast tree, the apparatus comprising:
circuitry advertising the node's interest in joining the multicast tree via a first link state advertisement in a routing protocol responsive to the node's interest;
circuitry receiving, in response to the advertising, a second link state advertisement from a designated multicast group master comprising an indication of a technique for the node to calculate the multicast tree on the network;
circuitry utilizing the technique to determine the multicast tree at the node;
circuitry installing a forwarding state for the multicast tree responsive to the node being on a path of the multicast tree between a source node and at least one node advertising interest in the multicast tree;
circuitry removing all multicast entries for a downstream direction responsive to a downstream node being removed from the multicast tree; and
circuitry utilizing a handshake procedure to update the multicast tree with the downstream node removed.
9. The apparatus of claim 8 , wherein the multicast tree comprises a plurality of nodes in the network and the technique is utilized by all of the plurality of nodes such that all of the plurality of nodes compute exactly a same tree for the multicast tree.
10. The apparatus of claim 8 , wherein the technique comprises tie-breaking techniques such that all nodes in the network calculating the multicast tree utilize the same tie-breaking techniques to compute exactly a same tree for the multicast tree.
11. The apparatus of claim 8 , wherein the technique comprises utilization of a shortest path tree.
12. The apparatus of claim 8 , wherein the technique comprises calculation of a spanning tree.
13. The apparatus of claim 8 , further comprising:
circuitry establishing a root node of the multicast tree via messages between the node and at least one other node of the multicast tree.
14. The apparatus of claim 8 , wherein the technique performs one of specifying a root node for the multicast tree and providing a determination technique for the node to correctly determine the root node.
15. A computer program product stored on a non-transitory computer readable medium, the computer program product containing data and instructions which, when loaded into one or more processors of a node on a network, cause the one or more processors to perform a method of implementing multicast on the network, the method comprising the steps of
responsive to the node's interest in becoming a member of the multicast tree, advertising the node's interest in joining the multicast tree via a first link state advertisement in a routing protocol;
receiving, in response to the advertising, a second link state advertisement from a designated multicast group master comprising an indication of a technique for the node to calculate the multicast tree on the network;
utilizing the technique to determine the multicast tree at the node;
installing a forwarding state for the multicast tree responsive to the node being on a path of the multicast tree between a source node and at least one node advertising interest in the multicast tree;
responsive to a downstream node being removed from the multicast tree, removing all multicast entries for a downstream direction; and
utilizing a handshake procedure to update the multicast tree with the downstream node removed.
16. The computer program product of claim 15 , wherein the multicast tree comprises a plurality of nodes in the network and the technique is utilized by all of the plurality of nodes such that all of the plurality of nodes compute exactly a same tree for the multicast tree.
17. The computer program product of claim 15 , wherein the technique comprises tie-breaking techniques such that all nodes in the network calculating the multicast tree utilize the same tie-breaking techniques to compute exactly a same tree for the multicast tree.
18. The computer program product of claim 15 , wherein the technique comprises one of utilization of a shortest path tree and calculation of a spanning tree.