Inter-Domain P2MP Tree Computation via Segmented PCE Architecture
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for computing inter-domain Point-to-Multipoint (P2MP) trees across multiple Autonomous System (AS) domains are inefficient, particularly in scalability and resource utilization, as they often require replicating packets and do not effectively utilize bandwidth sharing, leading to computational intensity and system destabilization.
Innovation Solution
A system comprising multiple Path Computation Elements (PCEs) that jointly compute a core tree across domains and independently compute sub-trees within each domain, using Backward Recursive Path Calculation (BRPC) and Constrained Shortest Path First (CSPF) procedures to establish an inter-domain P2MP tree, thereby improving scalability and resource sharing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If current methods for computing inter-domain P2MP trees are used, then packet delivery can be achieved, but processing burden on ingress nodes increases and scalability deteriorates
Solution Approach 1:
The patent divides the inter-domain P2MP tree computation into two separate phases: (1) computing a core tree from the ingress node to boundary nodes in each domain, and (2) computing sub-trees from boundary nodes to destination nodes within each domain. This segmentation shifts the computational burden from the ingress node to distributed PCEs in each domain, improving scalability and reducing processing burden on the ingress node.
2Adaptability or versatility
If packet replication is used for inter-domain P2MP delivery, then all destination nodes can be reached, but bandwidth utilization deteriorates due to lack of sharing
Solution Approach 1:
The patent merges multiple unicast paths into a shared P2MP tree structure. By computing a core tree that is shared across domains and then adding domain-specific sub-trees, the solution enables bandwidth sharing among multiple destination nodes while maintaining reachability to all leaves in the P2MP tree.
3Adaptability or versatility
If inter-domain P2MP tree computation is performed across multiple domains, then comprehensive path options are available, but computational intensity increases and system stability worsens
Solution Approach 1:
The computation is segmented into domain-independent core tree computation and domain-specific sub-tree computation. This allows the system to handle inter-domain paths while maintaining stability by localizing complex computations to individual domains through PCEs, preventing system-wide computational overload.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A system comprising a plurality of path computation elements (PCEs) configured to communicate with an ingress node, jointly compute a core tree for an inter-domain point-to-multipoint (P2MP) tree across a plurality of network domains, and independently compute a plurality of sub-trees in at least some of the network domains, wherein the core tree connects the ingress node to a boundary node (BN) in each one of the network domains that have a destination node and each sub-tree connects the BN to a plurality of destination nodes in one of the network domains that have a destination node.