5G UPF Placement and DU Assignment Under Latency Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing 5G networks face challenges in efficiently placing User Plane Functions (UPFs) on eligible nodes and assigning Distributed Units (DUs) to minimize latency and optimize network connectivity, particularly due to varying latency requirements across different services and the complexity of large-scale network topologies.
Innovation Solution
A method involving creating a network topology map, determining eligible nodes with sufficient capacity, calculating link costs, pruning paths exceeding latency thresholds, and using probabilistic heuristics to strategically place UPFs and assign DUs, ensuring minimal latency and efficient resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional UPF placement methods are used in large-scale 5G networks, then network coverage is maintained, but latency increases and network efficiency deteriorates
Solution Approach 1:
The patent segments the 5G network into multiple network slices, each with its own UPF placement strategy optimized for specific service requirements. This allows different latency-sensitive services to be handled by dedicated network slices rather than a monolithic network structure, reducing overall latency while managing complexity through modular organization.
Solution Approach 2:
The patent implements service-specific UPF placement strategies where UPFs are positioned locally based on the latency requirements of specific services. High-latency-sensitive services receive priority placement closer to edge devices, while less sensitive services use standard placement, optimizing latency performance locally without requiring complete reconfiguration of the entire network.
2Adaptability or versatility
If UPFs are placed on more nodes to improve connectivity, then network coverage increases, but resource utilization efficiency decreases
Solution Approach 1:
The patent implements dynamic UPF placement and assignment mechanisms that adapt to changing network conditions, traffic patterns, and service requirements. UPFs can be dynamically instantiated, moved, or reassigned based on real-time demands, ensuring optimal resource utilization while maintaining connectivity adaptability without static over-provisioning.
Solution Approach 2:
The patent changes key parameters such as UPF placement locations, assignment relationships between UPFs and DUs, and network slice configurations based on service requirements and network conditions. This parametric optimization allows the system to achieve high connectivity adaptability while maintaining efficient resource utilization by adjusting parameters rather than increasing resource quantity.
3Productivity
If probabilistic heuristics are used for UPF placement, then placement speed increases, but placement precision may vary
Solution Approach 1:
The patent applies probabilistic heuristics to achieve satisfactory UPF placement solutions within acceptable timeframes rather than seeking mathematically optimal solutions. The system performs partial optimization focusing on critical latency-sensitive services first, then iteratively improves placement for other services, achieving good enough precision at high speed through staged rather than exhaustive optimization.
Solution Approach 2:
The patent incorporates feedback mechanisms where placement results are evaluated against service requirements and network conditions, and subsequent placements are adjusted based on observed performance. The probabilistic heuristic algorithms learn from placement outcomes and refine their strategies, improving precision over time while maintaining fast placement speeds through adaptive rather than static decision-making.
Data Source
AI summary
Systems and methods are provided for placement of User Plane Functions (UPFs) on one or more nodes and assigning Distributed Units (DUs) to the UPF-hosting nodes of a 5G network slice. A method, according to one implementation, includes the step of obtaining a network topology map portraying a network that includes at least a plurality of components of a Radio Access Network (RAN) and a plurality of eligible nodes capable of connecting the components to the Internet. The method also includes the step of creating a tree graph from the network topology map. The tree graph includes a plurality of branches, where each branch represents the lowest cost path between a respective eligible node and a selected one of the plurality of components. In addition, the method includes selecting a group of the eligible nodes that collectively are capable of connecting the plurality of components to the Internet.