PCE Protocol for Global Concurrent Path Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Path Computation Element (PCE) systems face challenges in efficiently performing large-scale concurrent path computations, which are essential for strategic network resource allocation, as they often result in sub-optimal solutions due to computational burdens and infeasibility in finding global optimal paths.
Innovation Solution
A PCE communication protocol is introduced, enabling global concurrent path computation through an indicator field, global objective function, global constraints, and a global concurrent vector, along with iterative path computation to partition infeasible requests into feasible sessions, ensuring efficient network resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a PCE performs large-scale concurrent path computation for multiple TE-LSPs, then network resource allocation efficiency is improved, but computational complexity and processing time increase significantly
Solution Approach 1:
The patent segments the large-scale concurrent path computation problem into multiple independent path computation requests, each handled as a separate session. The PCE divides the global computation task into smaller sub-tasks that can be processed individually, reducing the computational burden on a single PCE while maintaining overall system efficiency through parallel processing of multiple sessions.
2Productivity
If a PCE computes global optimal paths for large number of TE-LSPs concurrently, then network resource utilization is optimized, but computation infeasibility increases due to resource constraints
Solution Approach 1:
The patent applies partial action by allowing the PCE to compute paths for a subset of TE-LSPs that can be feasibly computed within resource constraints, rather than attempting to compute all paths simultaneously. The system processes computation requests in multiple sessions, completing as many paths as possible in each session while leaving remaining requests for future sessions, thus achieving partial optimization without complete computational infeasibility.
3Device complexity
If sequential path computation is used for TE-LSPs, then computational burden on PCE is reduced, but network resource allocation efficiency deteriorates due to sub-optimal solutions
Solution Approach 1:
The patent merges multiple individual path computation sessions into a coordinated concurrent computation framework. Instead of processing TE-LSPs completely sequentially, the system combines multiple computation sessions that can run in parallel or overlapping timeframes, sharing common computational resources and constraints information. This merging approach achieves better resource allocation efficiency than pure sequential computation while avoiding the excessive burden of fully concurrent computation.
Data Source
AI summary
A system for a global concurrent path computation in a communication network is disclosed. The system includes a path computation element communication protocol, wherein the protocol includes an indicator field indicating the global concurrent path computation, a global objective function field providing an overarching objective function, a global constraint field specifying at least one global constraint, a global concurrent vector field specifying at least one path computation request, and another indicator field indicating an outcome of a path computation request.