Hierarchical PCE Route Computation for ASON and MPLS-TE Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multi-domain route computation methods, such as DDRP and PCE, face inefficiencies and complexities in computing end-to-end paths that meet bandwidth, switching, and policy constraints due to serial processing and reliance on incomplete TE information, leading to frequent route rollbacks and difficulties in managing large networks.
Innovation Solution
Implementing a hierarchical system with Path Computation Elements (PCEs) in different layers, where computation domains are mapped between upper and lower layers, allowing parallel route computation and separating routes from signaling, enabling efficient end-to-end diverse route computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If serial route computation is used in multi-domain networks, then route computation can be completed with available TE information, but route establishment rollbacks occur frequently and computation efficiency is low
Solution Approach 1:
The patent applies preliminary action by performing route computation for all domains in parallel before actual route establishment. The network management system computes routes for multiple domains simultaneously using available TE information, obtaining preliminary route results that can be validated before commitment. This prevents rollbacks by ensuring route feasibility is established in advance across all domains, while the parallel computation approach maintains high efficiency.
2Measurement precision
If complete TE information of all domains is distributed to each node, then accurate end-to-end route computation can be performed, but network management complexity and information exchange overhead increase significantly
Solution Approach 1:
The patent applies segmentation by dividing the network into multiple domains, each with its own TE information managed locally. The network management system segments the route computation task by domain, collecting TE information from each domain separately and processing route computation for each domain independently in parallel. This maintains computation accuracy by using complete domain-specific TE information while reducing overall system complexity through modular domain-level management.
Solution Approach 2:
The network management system acts as an intermediary that collects TE information from multiple domains, performs coordinated route computation, and returns results to source and destination nodes. This intermediary approach enables accurate end-to-end route computation by aggregating complete TE information from all domains without requiring individual nodes to store or process all domain information, thus reducing node complexity while maintaining computation accuracy.
3Productivity
If hierarchical PCE structure is implemented, then parallel route computation across domains is enabled, but system architecture complexity increases
Solution Approach 1:
The patent merges the route computation functionality into a centralized network management system that handles multiple domains. Instead of implementing separate PCEs in each domain with complex hierarchical coordination, the network management system consolidates the computation capability and performs parallel route computation for all domains in a unified manner. This merging approach maintains high computation efficiency through parallel processing while simplifying the overall architecture by eliminating the need for complex hierarchical PCE interactions.
Data Source
AI summary
A method and system for multi-domain route computation. In the invention, Path Computation Elements (PCEs) are placed in different layers and computation domains between upper and lower layer PCEs are mapped so that a computation task is divided into multiple computation tasks layer by layer and that the multi-domain route computation is finally fulfilled. The invention separates route computation from signaling and runs route computation tasks in parallel. Route establishment is done by signaling after route computation. The present invention may realize route computation based on complex Traffic Engineering (TE) constraints and enable end-to-end diverse route computation. The invention places PCEs in layers, allowing good scalability and high computation efficiency. The present invention is applicable to the Automatically Switched Optical Network (ASON) and the Multi-Protocol Label Switched Network Traffic Engineering (MPLS-TE) network.