Point-to-Multipoint Tree Linking Root to Leaf Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for determining point-to-multipoint paths in communication networks, especially in multi-protocol label switching (MPLS) networks, do not optimize the use of resources across different domains, leading to suboptimal bandwidth consumption and link utilization.
Innovation Solution
A method where path calculation entities associated with each domain receive and process messages containing branch identifiers and costs from downstream domains to determine a new set of branch bundles that minimize costs, optimizing the connection of leaf nodes across multiple domains by calculating a point-to-multipoint tree that adheres to a given cost criterion, such as the number of links or path length.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If the Backward Recursive PCE-based Computation method is used to determine point-to-multipoint paths, then the shortest path between root node and each leaf node is optimized, but the number of links borrowed and bandwidth consumption is not minimized
Solution Approach 1:
The patent segments the point-to-multipoint path determination into multiple phases: first determining individual shortest paths from the root node to each leaf node, then analyzing the union of these paths to identify shared links, and finally optimizing the overall tree structure by selecting which shared links to include. This segmentation allows separate optimization of path length and bandwidth consumption.
Solution Approach 2:
The patent merges multiple individual shortest paths into a unified point-to-multipoint tree structure by identifying and combining shared links. The method calculates the union of shortest paths to all leaf nodes and then selects an optimal subset of these shared links to form the final tree, thereby reducing total link count while maintaining connectivity.
2Length of moving object
If individual shortest paths are calculated to each leaf node, then the distance from root node to each leaf is minimized, but the total number of links in the network is increased
Solution Approach 1:
The patent performs preliminary calculation of individual shortest paths to all leaf nodes before constructing the final point-to-multipoint tree. By pre-calculating these paths and analyzing their union, the method identifies shared links that can be reused across multiple leaf node connections, thereby reducing the total number of links needed in the final tree structure.
Data Source
Figure 1~2B
Figure 3
Figure 4
AI summary
Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes. The invention relates to a method for determining a point-to-multipoint tree linking a root node (10) to a plurality of leaf nodes (21-28), at least some of the nodes belonging to distinct domains (1-4), implemented by a path calculation entity (11, 12) associated with a domain, termed the current domain. The method comprises: a step of receiving at least one message (40) comprising a first set of at least one identifier of a bundle of at least one branch and of a respective cost (43, 45) associated with said bundle originating from at least one other path calculation entity (12-14) associated with a domain situated downstream of the current domain, the bundle of at least one branch making it possible to join the leaf nodes situated in downstream domains, a step of determining at least one new bundle of at least one branch as a function of said at least one first set received, said new bundle of branches exhibiting a minimum cost and making it possible also to join as appropriate the leaf nodes of the current domain.