Network Slice PRB Scheduling Across Time Windows

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing PRB scheduling for network slices is complex and struggles to meet Quality of Service (QoS) and proportional fairness (PFM) standards while minimizing bandwidth waste.

Innovation Solution

A method and system for PRB scheduling that allocates PRBs over a predetermined window length, determining PRB allocation conditions, and enabling or disabling slices based on these conditions to achieve efficient utilization and compliance with slicing thresholds.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If per-slice scheduler is used to allocate PRBs according to slice targets, then QoS and proportional fairness standards can be met, but scheduling complexity increases and bandwidth/PRB resource wastage occurs

Engineering Contradiction:

ImproveQoS and proportional fairness complianceVSAvoidscheduling complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the scheduling process into two distinct phases: a resource allocation phase that determines total PRBs per slice over a window length, and a resource distribution phase that allocates those PRBs to specific time slots. This segmentation simplifies the per-slice scheduler by separating allocation decisions from timing decisions, reducing overall scheduling complexity while maintaining QoS compliance.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by first determining the total number of PRBs to be allocated to each slice over a predetermined window length before actually distributing them to specific time slots. This preliminary allocation calculation simplifies the subsequent per-slice scheduling process and reduces computational complexity during real-time execution.

Inventive Principle:

Principle #10Preliminary action

2Reliability

If per-slice scheduler allocates PRBs to meet slice targets, then QoS standards are satisfied, but PRB resource wastage increases

Engineering Contradiction:

ImproveQoS complianceVSAvoidPRB resource wastage

Core Design Contradiction:

ReliabilityVSLoss of substance

Solution Approach 1:

The patent introduces dynamic slice disabling based on accumulated PRB allocation over a window length. When a slice reaches its target PRB allocation, it is dynamically disabled for further allocations in subsequent slots. This dynamic adjustment prevents PRB resource wastage by ensuring slices that have met their QoS targets do not receive additional resources, while still allowing flexible reallocation to other slices.

Inventive Principle:

Principle #15Dynamics

Data Source

PatentUS12634769B2Systems and methods for time distributed PRB scheduling per network slice

Publication Date: 2026.05.19 RAKUTEN SYMPHONY INC

AI summary

A method of physical resource block (PRB) scheduling includes determining a number of PRBs to be allocated in a predetermined window length to a plurality of slices for each slot of a plurality of slots within the predetermined window length, allocating the number of PRBs to at least one of the plurality of slices in one slot of the plurality of slots, determining whether at least one slice of the plurality of slices satisfies at least one predetermined PRB allocation condition, and disabling the at least one slice based on determining that the at least one slice satisfies the at least one predetermined PRB allocation condition.