PDCP Scheduling Queues for Service Data Flow Prioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current radio communications networks face performance limitations due to the inability to effectively differentiate and prioritize service data flows with varying quality requirements within a single radio bearer, leading to reduced efficiency and user experience, especially with the increasing demand for multi-tasking and Over The Top services.
Innovation Solution
Implementing a method in a transmitting radio node that identifies and maps Packet Data Convergence Protocol (PDCP) Service Data Units (SDUs) to scheduling queues based on service and quality requirements, allowing for service-specific packet forwarding and scheduling within the radio bearer, moving the scheduling process from a bearer level to a service data flow level.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If all traffic is mapped to the same radio bearer with uniform QoS treatment, then device complexity is reduced and ease of operation is improved, but service differentiation capability deteriorates and network performance is reduced
Solution Approach 1:
The patent segments the single radio bearer's traffic into multiple service data flow queues, each with distinct QoS parameters. The transmitting radio node identifies different service data flows within the radio bearer and maps them to separate queues based on their quality requirements, enabling differentiated scheduling while maintaining a single radio bearer structure.
Solution Approach 2:
The patent applies local quality by assigning different QoS characteristics to different portions of the traffic flow. Each service data flow queue is configured with specific QoS parameters tailored to its service requirements, allowing localized optimization of quality attributes without affecting the entire bearer uniformly.
2Adaptability or versatility
If multiple radio bearers are set up to differentiate service data flows, then service differentiation capability is improved, but setup time increases and device complexity increases
Solution Approach 1:
Instead of creating separate radio bearers for each service, the patent segments traffic within a single radio bearer into multiple service data flow queues. This maintains service differentiation while avoiding the time-consuming process of establishing multiple radio bearers sequentially.
Solution Approach 2:
The patent combines multiple service data flows into a single radio bearer structure while maintaining separate scheduling queues for each service. This merging approach eliminates the need for multiple radio bearers while preserving service differentiation capabilities through internal queue management.
3Productivity
If service-specific scheduling queues are implemented on PDCP layer, then service differentiation capability is improved and network performance is enhanced, but device complexity increases
Solution Approach 1:
The patent introduces an intermediary scheduling queue structure at the PDCP layer that mediates between the radio bearer and service data flows. This intermediary mechanism enables service-specific scheduling without requiring fundamental changes to the underlying radio bearer architecture, balancing performance enhancement with manageable complexity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments herein relate to a method in a transmitting radio node (12) for scheduling service data flows within a radio bearer towards a receiving radio node (10) in a radio communications network (1). The transmitting radio node (12) identifies at least two service data flows within the radio bearer towards the receiving radio node (10), where each service data flow is associated with a service and/or a service quality requirement. The service and/or the service quality requirement is different for respective service data flow. The transmitting radio node (12) maps a Packet Data Convergence Protocol, PDCP, Service Data Unit, SDU, of respective service data flow to a respective scheduling queue on a PDCP layer. Each scheduling queue is associated with the service and/or the service quality requirement of the respective service data flow. The transmitting radio node (12) schedules the PDCP SDUs within the scheduling queues of the at least two service data flows, to the receiving radio node (10), based on the service and/or the service quality requirement associated with the respective scheduling queue on the PDCP layer.