Spine-Rooted Distribution Trees for IP Fabric Multicast
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for handling multi-destination traffic in IP fabric Vinci networks, such as using IP multicast protocols like PIM or TRILL, are inefficient and difficult to scale, especially in multicast-heavy deployments, due to bandwidth wastage and complexity.
Innovation Solution
Implementing fixed topology distribution trees rooted at spine nodes in the Vinci-specific Clos network topology, which allows for efficient pruning and routing of multicast traffic based on advertised multicast group interests without the need for distribution tree identification in packets, using a new IS-IS Fixed Topology Distribution Tree Root Type-Length-Value (TLV) and split horizon mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If IP multicast protocols like PIM or TRILL are used for handling multi-destination traffic, then traffic can be delivered to multiple destinations, but bandwidth is wasted and system complexity increases
Solution Approach 1:
The patent segments the fat-tree network into multiple distribution trees, each rooted at a different spine node. Each tree is independently pruned based on multicast group interests, allowing efficient traffic delivery without requiring full mesh connectivity. This segmentation enables selective traffic forwarding only to interested leaf nodes, reducing bandwidth waste compared to traditional IP multicast protocols.
2Productivity
If IP multicast protocols like PIM or TRILL are used for handling multi-destination traffic, then traffic can be delivered to multiple destinations, but system complexity increases
Solution Approach 1:
The patent extracts the distribution tree identification field from the packet header, eliminating the need for complex protocol processing. Instead of using TRILL-style distribution tree IDs in packets, the system uses the inherent fabric topology and pruning mechanisms to implicitly identify the correct path. This extraction simplifies the forwarding decision process and reduces device complexity.
Solution Approach 2:
Instead of having packets carry distribution tree identification information (traditional approach), the patent inverts the approach by having the network infrastructure maintain and prune distribution trees based on advertised multicast group interests. The forwarding decisions are made by the network based on pre-established tree structures rather than by individual packet inspection, simplifying the overall system complexity.
3Adaptability or versatility
If traditional multicast protocols are used, then multi-destination traffic can be handled, but scaling becomes difficult in multicast-heavy deployments
Solution Approach 1:
The patent applies local quality by allowing each distribution tree to be independently pruned based on local multicast group interests advertised by leaf nodes. Each spine node maintains its own distribution tree with pruning decisions made locally based on received interest advertisements. This localized approach enables independent scaling of each tree without requiring global protocol state synchronization, improving scalability in multicast-heavy deployments.
Data Source
AI summary
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.