Per-group ECMP for Multidestination Traffic in DCE/TRILL Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multipathing solutions for multidestination traffic in FP/TRILL networks are resource-intensive, requiring multiple trees and separate control plane constructs for unicast and multidestination traffic, which is costly and complex to maintain.
Innovation Solution
Implementing per-group ECMP for multidestination traffic by using ECMP graphs constructed for unicast traffic, with a new IS-IS PDU to convey the affinity of the parent node for a given multicast group, allowing load balancing on a per-vlan basis for broadcast and unknown unicast flooded traffic, and modifying the forwarding plane to eliminate the need for tree identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple trees are used for multidestination traffic multipathing, then multipathing capability is provided, but resource usage and system complexity increase
Solution Approach 1:
The patent merges the control plane constructs for unicast and multidestination traffic into a unified ECMP-based system. Instead of maintaining separate tree structures for multidestination traffic and ECMP graphs for unicast traffic, the invention uses a single ECMP graph that serves both purposes, thereby reducing system complexity while preserving multipathing capability.
Solution Approach 2:
The ECMP graph is designed to serve multiple functions: it provides multipathing for unicast traffic and simultaneously enables multipathing for multidestination traffic (broadcast, unknown unicast, and multicast). This universal structure eliminates the need for separate tree constructions and reduces overall system complexity.
2Adaptability or versatility
If multiple trees are used for multidestination traffic, then multipathing is achieved, but hardware and software resources are consumed
Solution Approach 1:
The patent combines the resources required for tree maintenance with the ECMP graph resources. By using the same ECMP graph data structures and control plane mechanisms for both unicast and multidestination traffic, the invention eliminates duplicate resource consumption that would occur with separate tree structures.
Solution Approach 2:
The ECMP graph performs multiple functions including providing multipathing for different traffic types (unicast, broadcast, unknown unicast, multicast) without requiring separate resource allocations for each traffic type, thereby reducing overall hardware and software resource consumption.
3Adaptability or versatility
If separate control plane constructs are used for unicast and multidestination traffic, then traffic types are handled specifically, but control plane complexity increases
Solution Approach 1:
The patent merges the control plane constructs by using a single ECMP graph that handles both unicast and multidestination traffic. The same control plane mechanisms, including IS-IS protocol extensions and graph construction algorithms, are used for both traffic types, eliminating the need for separate control plane systems.
Solution Approach 2:
The ECMP control plane is designed to be universal, handling multiple traffic types (unicast, broadcast, unknown unicast, multicast) through a single unified mechanism. This approach maintains the ability to handle different traffic types specifically while avoiding the complexity of separate control plane constructs.
Data Source
AI summary
Consistent with embodiments of the present disclosure, systems and methods are disclosed for providing per-group ECMP for multidestination traffic in a DCE/TRILL network. Embodiments enable per-group load balancing of multidestination traffic in DCE/L2MP networks by creating a new IS-IS PDU to convey the affinity of the parent node for a given multicast group. For broadcast and unknown unicast flooded traffic, the load balancing may be done on a per-vlan basis.