# US 2023/0056482 A1 · Dimensioning Granular Multi-Timescale Fairness

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

- Number: US 2023/0056482 A1
- Document ID: US20230056482A1
- Status: Published application
- Kind: A1
- Application number: 17/797,354
- Filed: 2020-10-28
- Published: 2023-02-23
- Earliest claimed: 2020-03-19
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Szilveszter Nádas; Balázs Varga; Miklos Telek; András Mészáros; Illés Antal Horváth
- Web page: https://patentgrep.com/patent/US20230056482A1

## CPC

- H04L 47/522: {Dynamic queue service slot or variable bandwidth allocation}
- H04W 28/0247: {based on conditions of the access network or the infrastructure network (central resource management H04W28/16)}
- H04L 47/225: {Determination of shaping rate, e.g. using a moving window}
- H04L 47/28: in relation to timing considerations
- H04W 28/20: Negotiating bandwidth
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## 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

### Claim at position 1

1-24. (canceled)

### Claim 25

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.

### Claim 26 (depends on 25)

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

### Claim 27 (depends on 25)

The method of claim 25, 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.

### Claim 28 (depends on 25)

The method of claim 25, 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.

### Claim 29 (depends on 25)

The method of claim 25, 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.

### Claim 30 (depends on 25)

The method of claim 25, 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.

### Claim 31 (depends on 30)

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

### Claim 32 (depends on 30)

The method of claim 30, 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.

### Claim 33 (depends on 25)

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

### Claim 34

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.

### Claim 35 (depends on 34)

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

### Claim 36 (depends on 34)

The core network node of claim 34, 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.

### Claim 37 (depends on 34)

The core network node of claim 34, 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.

### Claim 38 (depends on 34)

The core network node of claim 34, 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.

### Claim 39 (depends on 34)

The core network node of claim 34, 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.

### Claim 40 (depends on 39)

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

### Claim 41 (depends on 39)

The core network node of claim 39, 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.

### Claim 42 (depends on 34)

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

### Claim 43 (depends on 34)

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

### Claim 44

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.