# US 2025/0159676 A1 · Packet scheduler

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0159676 A1
- Document ID: US20250159676A1
- Status: Published application
- Kind: A1
- Application number: 18/934,754
- Filed: 2024-11-01
- Published: 2025-05-15
- Earliest claimed: 2023-11-10
- Assignees: Nokia Solutions and Networks Oy
- Applicants: Nokia Solutions and Networks Oy
- Inventors: Robert COLLETTI; Prasanna MUDLAPPA; Anand BEDEKAR
- Web page: https://patentgrep.com/patent/US20250159676A1

## CPC

- H04B 7/0452: Multi-user MIMO systems
- H04W 72/1263: Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
- H04W 72/121: for groups of terminals or users
- H04W 72/541: using the level of interference
- H04W 72/543: based on requested quality, e.g. QoS
- H04B: TRANSMISSION
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

An apparatus comprising at least one processor, and at least one memory for storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform: obtaining information about a plurality of user equipments (UE) to be scheduled for a communication in a communication network, generating two or more UE sublists by splitting the plurality of UEs and placing each of the plurality of UEs into at least one UE sublist, the splitting being based on a processing considering an interference parameter, dividing available communication resources of the communication network in accordance with the generated two or more UE sublists and allocating a part of the resources to each of the UE sublist, executing a parallelization of scheduling processing by generating one processing thread per each UE sublist, and conducting a scheduling processing for each UE sublist in the corresponding processing thread.

## Claims

### Claim 1

An apparatus comprising:
at least one processor; and
at least one memory for storing instructions that, when executed by the at least one processor, cause the apparatus at least to perform:
obtaining information about a plurality of user equipments (UEs) to be scheduled for a communication in a communication network,
generating two or more UE sublists by splitting the plurality of UEs and placing each of the plurality of UEs into at least one UE sublist, the splitting being based on a processing considering an interference parameter,
dividing available communication resources of the communication network in accordance with the generated two or more UE sublists and allocating a part of the resources to each of the UE sublist,
executing a parallelization of scheduling processing by generating one processing thread per each UE sublist, and
conducting a scheduling processing for each UE sublist in the corresponding processing thread.

### Claim 2 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
conducting a pre-scheduling processing in which a specified number of UEs being eligible for scheduling in each communication slot is selected, wherein the information about the plurality of UEs is obtained as a result of the pre-scheduling processing.

### Claim 3 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
using, for the processing considering the interference parameter used for generating the two or more UE sublists, a processing based on a correlation matrix or a processing based on a beam-to-beam interference parameter.

### Claim 4 (depends on 3)

The apparatus according to claim 3, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
when using, for the processing considering the interference parameter used for generating the two or more UE sublists, a processing based on a correlation matrix,
building a matrix comprising all UEs in the obtained information,
sorting the UEs in a descending order based on a predetermined sorting parameter,
calculating a correlation value across the first two UEs of the sorted UEs,
deciding whether the two UEs can be paired on the basis of a comparison between the determined correlation value and a preset threshold value,
if it is decided that the two UEs can be paired, placing the two UEs into the same UE sublist, and if it is decided that the two UEs cannot be paired, placing the two UEs into different UE sublists,
calculating a correlation value across the third and each following UE of the sorted UEs and each UE contained in each UE sublist, and
placing the following UE in the UE sublists where an average correlation value is smaller.

### Claim 5 (depends on 4)

The apparatus according to claim 4, wherein the predetermined sorting parameter is a quality of service class identifier allocated to each UE.

### Claim 6 (depends on 3)

The apparatus according to claim 3, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
when using, for the processing considering the interference parameter used for generating the two or more UE sublists, a processing based on a beam-to-beam interference parameter,
obtaining a predetermined interference parameter defining statically a beam-to-beam interference related to an antenna array network used for communication of the UEs, and
placing a UE in a corresponding one of the two or more UE sublists on the basis of a comparison of the obtained predetermined interference parameter for each UE.

### Claim 7 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
when each UE is placed into a UE sublist, checking if any of the two or more UE sublists comprises a higher number of UEs than the others of the two or more UE sublists,
if at least one of the two or more UE sublists comprises a higher number of UEs, conducting a balancing processing for balancing a workload of each processing thread generated per each of the two or more UE sublists to each other.

### Claim 8 (depends on 7)

The apparatus according to claim 7, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
for conducting the balancing processing, checking whether the at least one UE sublist comprising the higher number of UEs includes a UE being identified, as a result of the processing considering the interference parameter for splitting the plurality of UEs, to be placeable also into another UE sublist,
if the check results that there is identified at least one UE being placeable into another UE sublist, changing the identified UE to the other UE sublist for balancing the number of UEs in each UE sublist, and
if the check results that there is identified no UE being placeable into another UE sublist, changing one or more of the last UEs being placed into the UE sublist comprising the higher number of UEs into another UE sublist for balancing the number of UEs in each UE sublist.

### Claim 9 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
when each UE is placed into a UE sublist, determining, in each UE sublist, whether there is any UE having a buffer size being greater than a buffer threshold,
if there is determined a UE having a buffer size being greater than the buffer threshold, checking whether the determined UE is pairable with another UE of at least one other UE sublist, based on the processing considering the interference parameter for splitting the plurality of UEs, and,
if the determined UE is pairable with another UE of at least one other UE sublist, placing the determined UE in each of the originally selected UE sublist and the at least one other UE sublist.

### Claim 10 (depends on 9)

The apparatus according to claim 9, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
checking whether a number of UEs being placed in more than one UE sublists is equal to or lower than a predefined threshold,
in case the number of UEs being placed in more than one UE sublists is equal to or lower than the predefined threshold, allow placing the determined UE in each of the originally selected UE sublist and the at least one other UE sublist, or
in case the number of UEs being placed in more than one UE sublists is not equal to or lower than the predefined threshold, stop a processing for placing UEs in each of the originally selected UE sublist and another UE sublist.

### Claim 11 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
when dividing the available communication resources of the communication network in accordance with the generated two or more UE sublists, determining the part of the resources to be allocated to each of the UE sublist by considering at least one of the following:
an accumulated amount of data to be transmitted to the UEs in each UE sublist,
presence of traffic having a guaranteed bitrate and traffic having not a guaranteed bitrate, wherein traffic having a guaranteed bitrate is prioritized in resource allocation, or
a determination result of a current buffer size of active UEs, wherein required resources for newly arrived data are estimated.

### Claim 12 (depends on 11)

The apparatus according to claim 11, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
determining whether any UE is present in more than one UE sublist,
and in case there is at least one UE being present in more than one UE sublist, dividing the buffer size of the UE comprised in more than one UE sublist by the number of sublists comprising the UE, and considering the result of the division as the buffer size of the UE for resource allocation processing.

### Claim 13 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
conducting, in each generated processing thread per each UE sublist, the following:
a time division scheduling processing,
a multi-user pairing processing in which the UEs contained in one UE sublist are paired on the basis of the interference parameter,
a signal processing related to antenna relay network properties,
a zero-forcing processing,
a beam forming processing,
a frequency division multiplexing processing, or
a resource block group allocation.

### Claim 14 (depends on 13)

The apparatus according to claim 13, wherein the multi-user pairing processing is conducted before conducting the a frequency division multiplexing processing.

### Claim 15 (depends on 1)

The apparatus according to claim 1, wherein the instructions, when executed by the at least one processor, cause the apparatus at least to perform:
after executing the parallelization of the scheduling processing by generating one processing thread per each UE sublist and conducting at least a part of the scheduling processing for each UE sublist in the corresponding processing thread, joining outputs of each of the processing threads for forming a single processing thread considering all UEs combined in one single UE sublist, and
allocating remaining communication resources being left unused in any of the parallel processing threads to UEs in the single UE sublist.

### Claim 16

A method comprising:
obtaining information about a plurality of user equipments (UEs) to be scheduled for a communication in a communication network,
generating two or more UE sublists by splitting the plurality of UEs and placing each of the plurality of UEs into at least one UE sublist, the splitting being based on a processing considering an interference parameter,
dividing available communication resources of the communication network in accordance with the generated two or more UE sublists and allocating a part of the resources to each of the UE sublist,
executing a parallelization of scheduling processing by generating one processing thread per each UE sublist, and
conducting a scheduling processing for each UE sublist in the corresponding processing thread.

### Claim 17 (depends on 16)

The method according to claim 16, further comprising conducting a pre-scheduling processing in which a specified number of UEs being eligible for scheduling in each communication slot is selected, wherein the information about the plurality of UEs is obtained as a result of the pre-scheduling processing.

### Claim 18 (depends on 16)

The method according to claim 16, further comprising using, for the processing considering the interference parameter used for generating the two or more UE sublists, a processing based on a correlation matrix or a processing based on a beam-to-beam interference parameter.

### Claim 19 (depends on 18)

The method according to claim 18, wherein, when using, for the processing considering the interference parameter used for generating the two or more UE sublists, a processing based on a correlation matrix,
building a matrix comprising all UEs in the obtained information,
sorting the UEs in a descending order based on a predetermined sorting parameter,
calculating a correlation value across the first two UEs of the sorted UEs,
deciding whether the two UEs can be paired on the basis of a comparison between the determined correlation value and a preset threshold value,
if it is decided that the two UEs can be paired, placing the two UEs into the same UE sublist, and if it is decided that the two UEs cannot be paired, placing the two UEs into different UE sublists,
calculating a correlation value across the third and each following UE of the sorted UEs and each UE contained in each UE sublist, and
placing the following UE in the UE sublists where an average correlation value is smaller.

### Claim 20 (depends on 19)

The method according to claim 19, wherein the predetermined sorting parameter is a quality of service class identifier allocated to each UE.
