Multicast Root Selection via Expected Distance in Fabricpath
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multicast tree root selection mechanisms in Layer-2 protocols like Fabricpath and TRILL are inefficient due to the lack of careful root node choice, leading to suboptimal forwarding of multicast, unknown unicast, and broadcast traffic, which increases delivery costs.
Innovation Solution
A method to identify optimal multicast tree roots without prior knowledge of traffic sources and receivers by computing a priority value for each node based on the maximum and average shortest path distances, selecting nodes with minimum expected distance for root candidacy, and using existing SPF runs to determine SPF costs and normalize expected distances for root priority calculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If priority-based root selection is used, then implementation simplicity is maintained, but forwarding efficiency deteriorates
Solution Approach 1:
The patent changes the selection parameter from simple node priority to a computed metric based on shortest path distances. Each node calculates its expected distance to all other nodes using existing SPF runs, then selects the node with minimum expected distance as root. This parameter transformation resolves the contradiction by maintaining algorithmic simplicity while dramatically improving forwarding efficiency through data-driven root selection.
2Productivity
If optimal root selection is implemented, then forwarding efficiency is improved, but computational complexity increases
Solution Approach 1:
The patent performs shortest path calculations in advance using existing SPF (Shortest Path First) runs that are already executed for unicast routing. By reusing these pre-computed distance values, the patent avoids performing additional complex calculations specifically for multicast root selection. This preliminary action approach maintains forwarding efficiency while minimizing additional computational overhead.
Solution Approach 2:
The patent makes the existing SPF computation serve multiple functions: both unicast routing and multicast root selection. The same shortest path distance calculations used for unicast forwarding are reused to determine optimal multicast roots, eliminating the need for separate complex computation and reducing overall device complexity.
3Ease of manufacture
If random or priority-based root selection is used, then implementation remains simple, but network resource usage deteriorates
Solution Approach 1:
The patent transforms the root selection criterion from arbitrary priority values to a parameter based on actual network topology (expected shortest path distance). This parameter change enables more efficient traffic forwarding paths, reducing the total number of hops and network resource consumption while keeping the implementation approach consistent with existing protocols.
Data Source
AI summary
The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.