Path Computation Element Virtual Shortest Path Tree Resource Release
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large-scale multi-domain networks, the existing methods for establishing and processing virtual shortest path trees (VSPTs) lead to low resource utilization efficiency due to long-term reservation of resources, causing network congestion, especially when multiple paths are computed frequently.
Innovation Solution
A Path Computation Element (PCE) is configured to determine if the cost of a path from a root node to a leaf node in a VSPT is less than a threshold, and if so, adds a path branch to the VSPT, and immediately releases resources not part of the optimal path after the optimal path is selected, reducing resource occupation time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If resources are reserved for each path branch in VSPT to ensure path computation capability, then path computation reliability is improved, but resource utilization efficiency deteriorates due to long-term reservation
Solution Approach 1:
The patent reserves resources for path branches in advance before actual path computation is needed. By pre-establishing the VSPT structure and reserving resources on all potential path branches, the system ensures that when a path computation request arrives, the necessary resources are already available, thus improving reliability while avoiding the need for long-term resource reservation during normal operation
Solution Approach 2:
The patent implements dynamic resource reservation where resources are reserved temporarily only during the path computation process and released immediately after. The resource reservation duration is dynamically adjusted based on whether the path computation succeeds or fails, with automatic release mechanisms that prevent long-term occupation of resources, thereby improving resource utilization efficiency
2Adaptability or versatility
If VSPT includes many path branches to cover all possible routes, then path selection flexibility is improved, but network congestion increases due to excessive resource reservation
Solution Approach 1:
The patent applies different resource reservation strategies to different path branches based on their characteristics. Instead of uniformly reserving resources for all branches, the system evaluates each branch's likelihood of being selected and applies appropriate reservation levels, reducing overall resource occupation while maintaining flexibility for actual path selection needs
Solution Approach 2:
The patent implements an automatic resource release mechanism that discards (releases) reserved resources on path branches that are not selected for actual path establishment. After path computation completes, resources on unselected branches are recovered and returned to the resource pool, preventing network congestion caused by excessive long-term resource reservation while maintaining path selection flexibility during the computation process
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
The present invention provides virtual shortest path tree establishment and processing methods and a path computation element, so as to improve a resource utilization rate in a process of establishing and processing a virtual shortest path tree. In a process of establishing the virtual shortest path tree, a cost of an established path from a root node (a destination node) to a leaf node is compared with a cost threshold, and a new path branch is added to the VSPT when it is determined that the cost is less than the cost threshold. In a process of processing the virtual shortest path tree, a path branch in the VSPT that does not belong to an optimal path is released after the optimal path is obtained.