IP Library › Granted Patent US 12,369,068
Granted Patent B2
US 12,369,068 · App. 17/797,354 · Granted Jul 22, 2025

Dimensioning granular multi-timescale fairness

Inventors: Szilveszter Nádas (Budapest, HU); Balázs Varga (Budapest, HU); Miklos Telek (Budapest, HU); András Mészáros (Budapest, HU); Illés Antal Horváth (Budapest, HU)
Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
H04W28/0247H04L47/225H04L47/28H04W28/20
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,369,068
App. No.
17/797,354
Granted
Jul 22, 2025
Kind
B2
Abstract

A boost is provided in an overloaded system by distinguishing nodes with a “bad” traffic history from nodes with a “good” traffic history. In so doing, a core network node is able to apply additional resources to the node(s) having a “good” history in the form of a boost factor. Based on a system capacity and a working point, e.g., a critical number of active nodes with a “bad” traffic history, the core network node may determine a throughput history limit belonging to the “bad” traffic history. Responsive to expected requirements for a newly active node (i.e., a node having a “good” traffic history), the core network node determines a boost factor for the newly active node, applies the boost factor to the average resources allocated to the nodes with the “bad” traffic history to determine boosted resources, and allocates the boosted resources to the newly active node.

Claims (37)

1. A method of adjusting resource allocation to provide multi-timescale fairness for a communication network at a bottleneck defining shared resource availability for a plurality of first nodes and a second node, the method implemented by a core network node and comprising:

determining a boost factor responsive to an average communication resource and a planned data size for download by the second node during an initial boost time of a second time period within a first time period, wherein the average communication resource is required by each of the first nodes over the first time period and the second node intermittently requires communication resources during the first time period;

applying the boost factor to the average communication resource to determine a boosted communication resource; and

allocating the boosted communication resource to the second node to configure the second node to download data using the boosted communication resource during the initial boost time of the second time period.

2. The method of claim 1 , wherein the average communication resource comprises a bandwidth.

3. The method of claim 1 , further comprising allocating the average communication resource to the second node to configure the second node to download data using the average communication resource during a remainder of the second time period after expiration of the initial boost time.

4. The method of claim 1 , further comprising:

determining a second boost factor for a second boost time of the second time period after expiration of the initial boost time responsive to the average communication resource and a second planned data size for download by the second node during the second boost time;

applying the second boost factor to the average communication resource to determine a second boosted communication resource; and

allocating the second boosted communication resource to the second node to configure the second node to download data using the second boosted communication resource during the second boost time of the second time period.

5. The method of claim 1 , wherein a total load of the second node relative to a common link communication resource summed with a product of the average communication resource and the number of the plurality of first nodes is less than the common link communication resource.

6. The method of claim 1 , further comprising allocating a communication resource to each of the plurality of first nodes and allocating the boosted communication resource to the second node according to a Multi-TimeScale Throughput Value Function (MTS-TVF) comprising a TVF for each of two or more different timescales.

7. The method of claim 6 , wherein each of the TVFs of the MTS-TVF further comprise a different TVF for each of one or more service classes.

8. The method of claim 6 , wherein the allocating the communication resource to each of the plurality of first nodes comprises allocating the communication resource to each of the plurality of first nodes responsive to one or more quality of experience requirements.

9. The method of claim 1 , wherein the core network node comprises a gateway node.

10. A core network node configured to adjust resource allocation for a plurality of first nodes and provide multi-timescale fairness for a communication network at a bottleneck defining shared resource availability for the plurality of first nodes and a second node, the core network node comprising:

processing circuitry; and

memory storing instructions executable by the processing circuitry whereby the core network node is configured to:

determine a boost factor responsive to an average communication resource and a planned data size for download by the second node during an initial boost time of a second time period within a first time period, wherein the average communication resource is required by each of the first nodes over the first time period and the second node intermittently requires communication resources during the first time period; and

apply the boost factor to the average communication resource to determine a boosted communication resource; and

allocate the boosted communication resource to the second node to configure the second node to download data using the boosted communication resource during the initial boost time of the second time period.

11. The core network node of claim 10 , wherein the average communication resource comprises a bandwidth.

12. The core network node of claim 10 , wherein the core network node is further configured to allocate the average communication resource to the second node to configure the second node to download data using the average communication resource during a remainder of the second time period after expiration of the initial boost time.

13. The core network node of claim 10 , wherein the core network node is further configured to:

determine a second boost factor for a second boost time of the second time period after expiration of the initial boost time responsive to the average communication resource and a second planned data size for download by the second node during the second boost time; and

apply the second boost factor to the average communication resource to determine a second boosted communication resource; and

allocate the second boosted communication resource to the second node to configure the second node to download data using the second boosted communication resource during the second boost time of the second time period.

14. The core network node of claim 10 , wherein a total load of the second node relative to a common link communication resource summed with a product of the average communication resource and the number of the plurality of first nodes is less than the common link communication resource.

15. The core network node of claim 10 , wherein the core network node is further configured to allocate a communication resource to each of the plurality of first nodes and allocating the boosted communication resource to the second node according to a Multi-TimeScale Throughput Value Function (MTS-TVF) comprising a TVF for each of two or more different timescales.

16. The core network node of claim 15 , wherein each of the TVFs of the MTS-TVF further comprise a different TVF for each of one or more service classes.

17. The core network node of claim 15 , wherein the core network node allocates the communication resource to each of the plurality of first nodes by allocating the communication resource to each of the plurality of first nodes responsive to one or more quality of experience requirements.

18. The core network node of claim 10 , wherein the core network node comprises a gateway node.

19. The core network node of claim 10 , wherein the plurality of first nodes and the second node each comprise different communication devices in the communication network.

20. A non-transitory computer readable medium storing a computer program product for controlling a core network node to provide multi-timescale fairness for a communication network at a bottleneck defining shared resource availability for a plurality of first nodes and a second node, the computer program product comprising software instructions that, when run on the core network node, cause the core network node to:

determine a boost factor responsive to an average communication resource and a planned data size for download by the second node during an initial boost time of a second time period within a first time period, wherein the average communication resource is required by each of the first nodes over the first time period and the second node intermittently requires communication resources during the first time period;

apply the boost factor to the average communication resource to determine a boosted communication resource; and

allocate the boosted communication resource to the second node to configure the second node to download data using the boosted communication resource during the initial boost time of the second time period.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 3, 2022
From: NÁDAS, SZILVESZTER; VARGA, BALÁZS; TELEK, MIKLOS; MÉSZÁROS, ANDRÁS; HORVÁTH, ILLÉS ANTAL
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 060711/0333 →
Continuity (2)
Provisional Application 62991836 · Mar 19, 2020
Related Publication 20230056482A1 · Feb 23, 2023
References Cited (27)
US 11019126B2 · Sridhar et al. · 2021 [cited by applicant]
US 20070153682A1 · Swenson et al. · 2007 [cited by applicant]
US 20150074285A1 · Gahm · 2015 [cited by examiner]
US 20150088965A1 · Pakulski et al. · 2015 [cited by applicant]
US 20160072691A1 · Xu · 2016 [cited by examiner]
US 20160205164A1 · Schmidt et al. · 2016 [cited by applicant]
US 20200067852A1 · Sen et al. · 2020 [cited by applicant]
US 20210288942A1 · Preda et al. · 2021 [cited by applicant]
WO 2014189422A1 · 2014 [cited by applicant]
WO 2018086713A1 · 2018 [cited by applicant]
WO 2018112657A1 · 2018 [cited by applicant]
WO 2019096370A1 · 2019 [cited by applicant]
WO 2019141380A1 · 2019 [cited by applicant]
WO 2019217530A1 · 2019 [cited by applicant]
WO 2020074125A1 · 2020 [cited by applicant]
WO 2020229905A1 · 2020 [cited by applicant]
Szilveszter Nadas, Multi timescale bandwidth profile and its application for burst-aware fairness, Mar. 19, 2019, arXiv: 1903.08075v1, [retrieved on Feb. 20, 2025], retrieved from the Internet: <URL: https://arxiv.org/p… [cited by examiner]
Szilveszter Nadas, Towards Core-Stateless Fairness on Multiple Timescales, Jul. 22, 2019, [retrieved on Feb. 20, 2025], retrieved from the Internet: <URL: https://dl.acm.org/doi/pdf/10.1145/3340301.3341124> (Year: 2019). [cited by examiner]
Allalouf, M. et al., “A Simulation Study of Multi-Color Marking of TCP Aggregates”, 32nd IEEE Conference on Local Computer Networks, Oct. 15, 2007, pp. 376-383, IEEE. [cited by applicant]
Heinanen, J. et al., “A Two Rate Three Color Marker”, Network Working Group, Sep. 1, 1999, pp. 1-6, RFC 2698, The Internet Society. [cited by applicant]
Nádas, S. et al., “Multi timescale bandwidth profile and its application for burst-aware fairness”, Mar. 28, 2019, pp. 1-23, Ericsson. [cited by applicant]
Nádas, S. et al., “Towards Core-Stateless Fairness on Multiple Timescales”, Applied Networking Research Workshop 2019 (ANRW '19), Jul. 22, 2019, pp. 30-36, ACM. [cited by applicant]
Nádas, S. et al., “Multi time-scale fairness for heterogeneous broadband traffic in access-aggregation network”, European Workshop on Performance Engineering—International Conference on Analytical and Stochastic Modelin… [cited by applicant]
Metro Ethernet Forum, “Ethernet Services Attributes Phase 2”, MEF Technical Specification, Version MEF 10.2, Oct. 27, 2009, pp. 1-65, MEF. [cited by applicant]
Nádas, S. et al., “Bandwidth profile for multi-timescale fairness”, 2020 IEEE Wireless Communications and Networking Conference (WCNC), May 25, 2020, pp. 1-8, IEEE. [cited by applicant]
Nádas, S. et al., “Per Packet Value: A Practical Concept for Network Resource Sharing”, 2016 IEEE Global Communications Conference (GLOBECOM), Dec. 4, 2016, pp. 1-7, IEEE. [cited by applicant]
Nádas, S et al., “Towards a Congestion Control-Independent Core-Stateless AQM”, ANRW '18: Proceedings of the Applied Networking Research Workshop, Jul. 16, 2018, pp. 84-90, Association for Computing Machinery. [cited by applicant]