Paging Message Random Access Priority for Network Slices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network slicing in wireless communications creates challenges for user equipment (UE) during random access procedures, as initial access attempts do not distinguish between different slices, leading to resource congestion and inefficiencies in accessing specific slice resources.
Innovation Solution
Incorporating random-access priority (RA priority) and RA priority classes in paging messages to guide UE in prioritizing random-access channel configurations, allowing the network to steer UEs towards less congested resources and ensuring efficient access to specific slice resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If network slicing is implemented to provide dedicated resources for different services and customers, then service quality and resource allocation efficiency are improved, but random access procedures become more complex and resource coordination becomes more difficult
Solution Approach 1:
The patent segments the random access procedure into multiple priority levels (first priority and second priority) corresponding to different network slices. UEs are assigned to specific priority groups based on their service requirements, allowing the system to handle different slice types separately rather than as a unified pool, thus improving resource allocation efficiency while managing complexity through structured segmentation
Solution Approach 2:
The patent applies local quality by providing differentiated random access configurations for different network slices. Each slice receives tailored access parameters (such as preamble sequences, time/frequency resources, and priority indicators) according to its specific service requirements, enabling optimized resource allocation for each slice while maintaining overall system coordination
2Productivity
If all UEs use the same random access resources without slice-specific prioritization, then the random access procedure remains simple, but resource congestion increases and access efficiency for specific slices deteriorates
Solution Approach 1:
The patent divides the random access resource pool into separate segments for different priority levels. First priority UEs (associated with specific network slices) are allocated dedicated resources separate from second priority UEs, preventing resource contention and congestion while maintaining high access efficiency for slice-specific traffic
Solution Approach 2:
The patent changes key random access parameters (priority indicator, preamble selection, resource allocation) based on UE association with network slices. By dynamically adjusting these parameters according to slice requirements, the system optimizes access efficiency for prioritized slices while managing overall resource utilization to prevent congestion
Data Source
AI summary
A UE receives, in a paging message, information corresponding to random-access priority. The UE applies, in response to a random access being triggered, the random-access priority according to the information received in the paging message. A network node in a wireless system generates information corresponding to random-access priority for a UE to use for a random-access procedure. The network node sends, in a paging message, information corresponding to the random-access priority toward the user equipment.