EFFICIENT HANDLING OF MULTI-DESTINATION TRAFFIC IN AN INTERNET PROTOCOL FABRIC DATA CENTER

• US 20140258485A1
• Filed: 03/07/2013
• Published: 09/11/2014
• Est. Priority Date: 03/07/2013
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Yang, Yibin, Dong, Liqin, Tsai, Chiajen
• Granted Patent: US 9,137,119 B2
• Time in Patent Office: Days
• US Class Current: 709/223
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/122 of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees

Abstract

A method is provided in one example embodiment and includes establishing at least one fixed topology distribution tree in a network, where the fixed topology distribution tree comprises one root node and a plurality of leaf nodes connected to the root node; maintaining at the root node an indication of multicast group interests advertised by the leaf nodes; and pruning traffic at the root node based on the advertised multicast group interests of the leaf nodes. In one embodiment, the root node is a spine switch and each of the leaf nodes is a leaf switch and each of the leaf nodes is connected to the root node by a single hop.

Claims

1. A method, comprising:

establishing at least one fixed topology distribution tree in a network, wherein the fixed topology distribution tree comprises one root node and a plurality of leaf nodes connected to the root node;

maintaining an indication of multicast group interests advertised by the leaf nodes; and

pruning traffic at the root node based on the advertised multicast group interests of the leaf nodes.

2. The method of claim 1, wherein a Fixed Topology Distribution Tree Root Type-Length-Value (“

TLV”

) is used to announce an availability of a fixed topology distribution tree at the root node.

3. The method of claim 1, wherein the network is a Vinci topology network.

4. The method of claim 1, wherein the root node is a spine switch and each of the leaf nodes is a leaf switch.

5. The method of claim 1, wherein at least some of the leaf nodes function as a Tunnel End Point to perform encapsulation and decapsulation on frames associated with virtual machines (VMs).

6. The method of claim 1 further comprising:

designating the fixed topology distribution tree as unusable if a link between the root node and one of the leaf nodes fails.

7. The method of claim 6, wherein the establishing further comprises a plurality of fixed topology distribution trees, the method further comprising rerouting traffic from one of the fixed topology distribution trees designated as unusable to another one of the fixed topology distribution trees.

8. The method of claim 1, wherein leaf nodes load balance multicast traffic by selecting a distribution tree based on hashing the payload, when there are multiple fixed topology trees available.

9. The method of claim 1, wherein each of the leaf nodes comprise a Virtual Tunnel End Point (“

VTEP”

).

10. The method of claim 1, wherein the fixed topology distribution tree reaches a majority of the leafs directly in a single hop in the network.

11. One or more non-transitory tangible media that includes code for execution and when executed by a processor is operable to perform operations comprising:

establishing at least one fixed topology distribution tree in a network, wherein the fixed topology distribution tree comprises one root node and a plurality of leaf nodes connected to the root node;

maintaining an indication of multicast group interests advertised by the leaf nodes; and

pruning traffic at the root node based on the advertised multicast group interests of the leaf nodes.

12. The media of claim 11, wherein the network is an IP fabric Vinci network.

13. The media of claim 11, wherein the root node is a spine switch and each of the leaf nodes is a leaf switch and wherein each of the leaf nodes is connected to the root node by a single hop.

14. The media of claim 11 further comprising designating the fixed topology distribution tree as unusable if a link between the root node and one of the leaf nodes fails.

15. The media of claim 14, wherein the establishing further comprises a plurality of fixed topology distribution trees, the method further comprising rerouting traffic from one of the fixed topology distribution trees designated as unusable to another one of the fixed topology distribution trees.

16. The media of claim 11, wherein the establishing further comprises the root node declaring itself the root of the fixed topology distribution tree via a Tree Root Type-Length-Value (“

TLV”

).

17. An apparatus, comprising:

a memory element configured to store data;

a processor operable to execute instructions associated with the data; and

a fixed topology distribution tree (“

FTDT”

) module configured to;

establish at least one fixed topology distribution tree in a network, wherein the fixed topology distribution tree comprises one root node and a plurality of leaf nodes connected to the root node;

maintain an indication of multicast group interests advertised by the leaf nodes; and

prune traffic based on the advertised multicast group interests of the leaf nodes.

18. The apparatus of claim 17, wherein the network is an Internet Protocol (“

IP”

) fabric having a Vinci topology, and wherein each of the leaf nodes is a Virtual Tunnel End Point (“

VTEP”

).

19. The apparatus of claim 17, wherein the apparatus is the root node, which is a spine switch, and wherein each of the leaf nodes is a leaf switch.

20. The apparatus of claim 17 wherein the fixed topology distribution tree is designated as unusable if a link between the root node and one of the leaf nodes fails.