Parent Controller Shortest Path Tree for Multi-Domain Tunnel Setup
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Path computation in large, multi-domain, multi-region, and multi-layer telecommunications networks is complex and computationally intensive, especially with increasing data usage across various networks, leading to inefficiencies in establishing end-to-end tunnels for optimal data communication.
Innovation Solution
A parent controller receives requests to compute the shortest end-to-end path by receiving path segments and costs from child controllers, generates a candidate list, constructs a shortest path tree by repeatedly removing the lowest-cost out-edge nodes, and transmits tunnel creation messages to establish the tunnel along this path, allocating global and path IDs without relying on RSVP-TE.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional path computation methods are used in large multi-domain networks, then the network can establish E2E tunnels, but the computation becomes complex and computationally intensive
Solution Approach 1:
The patent segments the path computation process into two distinct phases: (1) child controllers compute local path segments within their respective domains, and (2) the parent controller assembles these segments into a complete E2E path. This segmentation distributes computational load, reducing the complexity at any single controller while maintaining overall computation efficiency.
Solution Approach 2:
The patent introduces a hierarchical structure where child controllers act as intermediaries that pre-compute and store path segments locally. When an E2E path is needed, these pre-computed segments serve as building blocks that the parent controller can quickly assemble, avoiding the need for complex end-to-end computation across the entire network.
2Reliability
If RSVP-TE protocol is used for resource reservation, then resource allocation can be ensured, but the communication complexity among components increases
Solution Approach 1:
The patent extracts the resource reservation function from the complex RSVP-TE signaling protocol and integrates it directly into the path computation process. The parent controller computes the complete E2E path and embedded resource reservations in a single operation, eliminating the need for separate RSVP-TE message exchanges between multiple network components.
Solution Approach 2:
The patent merges the path computation function and resource reservation function into a unified process. Instead of separately computing paths and then reserving resources through RSVP-TE, the system simultaneously determines both the optimal path and resource allocations in one computational step, reducing communication overhead and component complexity.
Data Source
AI summary
A method implemented in a parent controller including receiving a request to compute a shortest end-to-end (E2E) path from source to destination through network domains managed by child controllers, receiving path segments and costs computed by the child controllers, wherein the path segments identify in-edge nodes, out-edge nodes, and inter-domain links, generating a candidate list using the path segments and costs received from the child controllers, constructing a shortest path tree (SPT) from the source to the destination through the network domains by repeatedly removing one of the out-edge nodes corresponding to the path segment in the candidate list having a lowest cost and adding the one of the out-edge nodes to the SPT until the destination is reached, determining the shortest E2E path based on the SPT, and transmitting tunnel creation messages to the child controllers to create a tunnel along the shortest E2E path.