IP Library Granted Patent US 12,439,290
Granted Patent B2
US 12,439,290 · App. 18/262,816 · Granted Oct 7, 2025

Apparatus and method for scheduling traffic

Inventors: Silvio Mandelli (Stuttgart, DE); Thorsten Wild (Stuttgart, DE)
Assignee: Nokia Solutions and Networks Oy
H04W28/0252H04L47/39H04W28/10
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,439,290
App. No.
18/262,816
Granted
Oct 7, 2025
Kind
B2
Abstract

Disclosed is an apparatus comprising means for: detecting an occurrence of a traffic burst event on a flow within a wireless network; responsive to the detection of the occurrence of a traffic burst event, determining whether a traffic burst allowance is available; responsive to determining that the traffic burst allowance is available, scheduling the flow and/or another flow within the wireless network with a traffic burst bit rate at which to transmit data, the traffic burst bit rate being greater than a first, guaranteed bit rate indicated by an assigned quality of service for the flow; and responsive to determining that the traffic burst allowance has been exhausted and/or determining that occurrence of the traffic burst event has stopped, scheduling the flow with the first bit rate.

Claims (51)

1. Apparatus comprising means for:

detecting an occurrence of a traffic burst event on a flow within a wireless network;

responsive to the detection of the occurrence of a traffic burst event, determining whether a traffic burst allowance is available;

responsive to determining that the traffic burst allowance is available, scheduling the flow and/or another flow within the wireless network with a traffic burst bit rate at which to transmit data, the traffic burst bit rate being greater than a first, guaranteed bit rate indicated by an assigned quality of service for the flow; and

responsive to determining that the traffic burst allowance has been exhausted and/or determining that occurrence of the traffic burst event has stopped, scheduling the flow with the first bit rate.

2. The apparatus of claim 1 comprising means for:

receiving traffic burst allowance information indicative of a maximum size of an amount of data which can be transmitted at the traffic burst bit rate before the traffic burst allowance is exhausted.

3. The apparatus of claim 1 comprising means for:

receiving traffic burst allowance information indicative of the traffic burst bit rate, and/or

calculating the traffic burst bit rate.

4. The apparatus of claim 1 comprising means for:

receiving traffic burst allowance information indicative of at least one of:

a recovery time, wherein an amount of data which can be transmitted at the traffic burst bit rate before the traffic burst allowance is exhausted is reset to a maximum value after an amount of time indicated by the recovery time has passed since the traffic burst bit rate was last scheduled,

a recovery speed, wherein an amount of data which can be transmitted at the traffic burst bit rate before the traffic burst allowance is exhausted recovers at a rate indicated by the recovery speed, and

a priority index of data transmitted at the traffic burst bit rate, the priority index of data transmitted at the traffic burst bit rate being higher than a priority index for data transmitted at the first bit rate.

5. The apparatus of claim 1 , comprising means for:

monitoring available credit associated with transmission at the first bit rate, wherein detecting the occurrence of the traffic burst event on the flow is based at least in part on determining that there is no credit associated with transmission at the first bit rate, wherein available credit is indicative of an amount of data which can be transmitted at a particular bit rate.

6. The apparatus of claim 1 comprising means for:

detecting the occurrence of the traffic burst event on the flow based on receipt of a traffic burst signal flag associated with data to be transmitted at the traffic burst bit rate.

7. The apparatus of claim 1 comprising means for:

tracking an input buffer rate of received data; and

detecting the occurrence of the traffic burst event on the flow based on determining that the tracked input buffer rate is above a predefined threshold.

8. The apparatus of claim 1 , wherein determining that the traffic burst allowance is available is based on determining that there is credit associated with the traffic burst allowance,

wherein determining that the traffic burst allowance has been exhausted and/or is not available is based on determining that there is no credit associated with the traffic burst allowance, and

wherein available credit associated with the traffic burst allowance is indicative of an amount of data which can be transmitted at the traffic burst bit rate before the traffic burst allowance is exhausted.

9. The apparatus of claim 8 , comprising means for, iteratively for plural time transmission intervals:

adding credit associated with transmission at the traffic burst bit rate and/or the traffic burst allowance based on a duration of a time transmission interval and the traffic burst bit rate; and

removing credit associated with transmission at the traffic burst bit rate and/or the traffic burst allowance based on an amount of data transmitted during the time transmission interval.

10. The apparatus of claim 1 , comprising means for, responsive to at least one of determining that the burst allowance has been exhausted, determining that the burst allowance is not available, and determining that the rate of transmitting data violates the traffic burst bit rate:

determining not to schedule the flow and/or another flow within the wireless network with the traffic burst bit rate.

11. The apparatus of claim 1 , comprising means for scheduling the another flow with the traffic burst bit rate, wherein scheduling the another flow with the traffic burst bit rate comprises redirecting the data for transmission to the another flow, the another flow having the traffic burst bit rate.

12. The apparatus of claim 11 , wherein the scheduling is performed by a MAC scheduler.

13. The apparatus of claim 1 , comprising means for scheduling the another flow with the traffic burst bit rate, wherein the data for transmission is associated with a unique flow, and

wherein scheduling the flow with the first bit rate comprises allocating the data to a first flow, and scheduling the another flow with the traffic burst bit rate comprises allocating the data to a second flow, wherein the first flow has the first bit rate and the second flow has the traffic burst bit rate.

14. The apparatus of claim 13 , wherein the scheduling is performed by a protocol stack layer higher than a MAC scheduler.

15. The apparatus of claim 1 comprising means for:

receiving context information; and

modifying the traffic burst allowance based on the context information.

16. The apparatus of claim 15 , wherein modifying the traffic burst allowance based on the context information comprises at least one of resetting the traffic burst allowance to a maximum traffic burst allowance, and increasing the maximum traffic burst allowance.

17. The apparatus of claim 1 , wherein the network is a fixed wireless access network.

18. The apparatus of claim 1 for scheduling transmission of data with an adaptive video streaming flow, wherein the flow, and/or the another flow is an adaptive video streaming flow.

19. Method comprising:

detecting an occurrence of a traffic burst event on a flow within a wireless network;

responsive to the detection of the occurrence of a traffic burst event, determining whether a traffic burst allowance is available;

responsive to determining that the traffic burst allowance is available, scheduling the flow and/or another flow within the wireless network with a traffic burst bit rate at which to transmit data, the traffic burst bit rate being greater than a first, guaranteed bit rate indicated by an assigned quality of service for the flow; and

responsive to determining that the traffic burst allowance has been exhausted and/or determining that occurrence of the traffic burst event has stopped, scheduling the flow with the first bit rate.

20. A computer program product comprising a set of instructions which, when executed on an apparatus, cause the apparatus to:

detect an occurrence of a traffic burst event on a flow within a wireless network,

responsive to the detection of the occurrence of a traffic burst event, determine whether a traffic burst allowance is available,

responsive to determining that the traffic burst allowance is available, schedule the flow and/or another flow within the wireless network with a traffic burst bit rate at which to transmit data, the traffic burst bit rate being greater than a first, guaranteed bit rate indicated by an assigned quality of service for the flow, and

responsive to determining that the traffic burst allowance has been exhausted and/or determining that occurrence of the traffic burst event has stopped, schedule the flow with the first bit rate.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 4, 2023
From: MANDELLI, SILVIO; WILD, THORSTEN
To: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG
Reel/Frame 064785/0525 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 4, 2023
From: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 064785/0528 →
Priority Claims (1)
FI 20215093 · Jan 28, 2021 · national
Continuity (1)
Related Publication 20240098553A1 · Mar 21, 2024
References Cited (51)
US 6446042B1 · Detlef · 2002 [cited by examiner]
US 6785232B1 · Kotser et al. · 2004 [cited by applicant]
US 7130937B2 · Hwang · 2006 [cited by examiner]
US 8139513B2 · Nakayasu · 2012 [cited by examiner]
US 8483702B2 · Noriega et al. · 2013 [cited by applicant]
US 8755405B2 · Kovvali et al. · 2014 [cited by applicant]
US 9191859B2 · Zakrzewski · 2015 [cited by examiner]
US 11202222B2 · Joseph · 2021 [cited by examiner]
US 11463918B2 · Xin · 2022 [cited by examiner]
US 11627493B2 · Rost · 2023 [cited by examiner]
US 11689940B2 · Wang · 2023 [cited by examiner]
US 11886991B2 · Wang · 2024 [cited by examiner]
US 11950124B2 · Chen · 2024 [cited by examiner]
US 12236347B2 · Wang · 2025 [cited by examiner]
US 20050033879A1 · Hwang · 2005 [cited by examiner]
US 20070121504A1 · Hellenthal et al. · 2007 [cited by applicant]
US 20080186942A1 · Nakayasu · 2008 [cited by examiner]
US 20080225711A1 · Raszuk et al. · 2008 [cited by applicant]
US 20130294241A1 · Zakrzewski · 2013 [cited by examiner]
US 20140050147A1 · Beale · 2014 [cited by examiner]
US 20190253917A1 · Dao · 2019 [cited by applicant]
US 20200137615A1 · Joseph · 2020 [cited by examiner]
US 20200236578A1 · Cakulev et al. · 2020 [cited by applicant]
US 20210014739A1 · Xin · 2021 [cited by examiner]
US 20210158151A1 · Wang · 2021 [cited by examiner]
US 20210168646A1 · Chen · 2021 [cited by examiner]
US 20210182658A1 · Wang · 2021 [cited by examiner]
US 20210204172A1 · Rost · 2021 [cited by examiner]
US 20210219168A1 · Liu · 2021 [cited by examiner]
US 20240135175A1 · Wang · 2024 [cited by examiner]
US 20250190791A1 · Wang · 2025 [cited by examiner]
WO 2011053784A1 · 2011 [cited by applicant]
WO 2014210221A1 · 2014 [cited by applicant]
WO 2019217530A1 · 2019 [cited by applicant]
WO 2019218916A1 · 2019 [cited by applicant]
WO 2020029196A1 · 2020 [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 16)”, 3GPP TS 23.501, V16.5.1, Aug. 2020, pp. 1-440. [cited by applicant]
“Fixed Wireless Access With 5G at Mid-Bands”, Nokia White Paper, 2020, pp. 1-20. [cited by applicant]
Tsilimantos et al., “Traffic profiling for mobile video streaming”, IEEE International Conference on Communications (ICC), May 21-25, 2017, 7 pages. [cited by applicant]
Lam et al., “Burst scheduling: architecture and algorithm for switching packet video”, Proceedings of Infocom'95, Apr. 2-6, 1995, pp. 940-950. [cited by applicant]
Farzanegan et al., “A Scheduling Algorithm for Bursty Traffic: Controlling of Service Rate and Burst”, Arabian Journal for Science and Engineering, vol. 39, 2014, pp. 4753-4764. [cited by applicant]
Andrews et al., “Optimal utility based multi-user throughput allocation subject to throughput constraints”, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 13-17, 20… [cited by applicant]
Mandelli et al., “Satisfying network slicing constraints via 5G MAC scheduling”, IEEE Conference on Computer Communications, Apr. 29-May 2, 2019, pp. 2332-2340. [cited by applicant]
Proebster et al., “Context-aware resource allocation for cellular wireless networks”, Eurasip Journal on Wireless Communications and Networking, Article No. 216, 2012, pp. 1-19. [cited by applicant]
“5G; Policy and charging control framework for the 5G System (5GS); Stage 2 (3GPP TS 23.503 version 16.5.0 Release 16)”, ETSI TS 123 503, V16.5.0, Jul. 2020, 120 pages. [cited by applicant]
“5G NR QoS Parameters”, Techplayon, Retrieved on Sep. 2, 2023, Webpage available at : https://www.techplayon.com/5g-nr-qos-parameters/. [cited by applicant]
Proebster et al., “Context-aware resource allocation to improve the quality of service of heterogeneous traffic”, IEEE International Conference on Communications (ICC), Jun. 5-9, 2011, 6 pages. [cited by applicant]
Office action received for corresponding Finnish Patent Application No. 20215093, dated Jun. 10, 2021, 8 pages. [cited by applicant]
“5G; System architecture for the 5G System (5GS) (3GPP TS 23.501 version 16.7.0 Release 16)”, ETSI TS 123 501, V16.7.0, Jan. 2021, 452 pages. [cited by applicant]
International Search Report and Written Opinion received for corresponding Patent Cooperation Treaty Application No. PCT/EP2022/051866, dated May 18, 2022, 11 pages. [cited by applicant]
Office action received for corresponding Finnish Patent Application No. 20215093, dated Jun. 21, 2022, 7 pages. [cited by applicant]