Multicast Sub-tree Global Identifier Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multicast routing technologies face challenges in handling loosely specified multicast distribution trees, particularly in ensuring acyclic paths and optimal traffic distribution across topology changes, leading to potential looping and congestion issues due to the mix of pinned and computed trees.
Innovation Solution
The implementation of global identifiers for sub-trees in multicast distribution trees allows for the differentiation of traffic destined for different sub-trees at shared replication nodes, ensuring acyclic paths by computing and stitching sub-trees as unique (S, G) trees, thereby preventing looping and duplication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If loosely specified multicast distribution trees are used with pinned and computed tree components, then flexibility in tree specification is improved, but looping and congestion issues occur due to topology changes conflicting with the loose specification
Solution Approach 1:
The patent segments the multicast distribution tree into multiple sub-trees, each with its own global identifier. This segmentation allows independent computation and management of each sub-tree while maintaining overall tree flexibility, preventing looping issues that arise from mixed pinned and computed components.
Solution Approach 2:
The patent introduces global identifiers as intermediaries to differentiate traffic destined for different sub-trees at shared replication nodes. These identifiers act as mediators that enable proper traffic routing without causing loops or congestion, even when topology changes occur.
2Reliability
If sub-trees are computed and stitched as unique (S, G) trees with global identifiers, then acyclic paths are ensured preventing looping, but complexity in computing and managing sub-tree identifiers increases
Solution Approach 1:
The patent performs preliminary computation of sub-tree identifiers and global labels during the tree setup phase. By pre-computing these identifiers and stitching sub-trees as unique (S, G) trees before traffic flow begins, the system ensures acyclic paths without requiring complex real-time computations during operation.
Solution Approach 2:
The patent uses global identifiers as copies or representations of sub-tree identities. Instead of managing complex sub-tree structures directly, the system uses simplified global label copies that uniquely identify each sub-tree, reducing management complexity while maintaining reliability.
3Productivity
If traffic engineering is applied to multicast trees with pinned waypoints, then optimal traffic distribution is achieved, but control plane traffic and state increase significantly
Solution Approach 1:
The patent applies local quality by allowing different parts of the multicast tree to have different specification styles. Some sub-trees can be pinned for traffic engineering while others are computed, enabling optimal traffic distribution only where needed without generating excessive control plane traffic throughout the entire tree.
Solution Approach 2:
The patent implements partial traffic engineering by applying pinned waypoints only to specific sub-trees rather than the entire multicast tree. This partial action achieves optimal traffic distribution for critical paths while avoiding the excessive control plane overhead that would result from engineering the complete tree.
Data Source
AI summary
A method is implemented by a networking device functioning as a computing node. The method resolves sub-trees of a loosely specified multicast distribution tree (MDT). The method utilizes global identifiers for sub-trees of the MDT to enable differentiation of traffic destined for different sub-trees of the MDT at shared replication nodes. The method can be implemented at or for each of the nodes of the network that are part of the MDT.