WO2019195958A1

WO2019195958A1 - Dynamic maximum data burst volume enforcement in user equipment

Info

Publication number: WO2019195958A1
Application number: PCT/CN2018/082152
Authority: WO
Inventors: Benoist Sebire; Matti Laitila; Chunli Wu
Original assignee: Nokia Shanghai Bell Co., Ltd.; Nokia Solutions And Networks Oy; Nokia Technologies Oy
Priority date: 2018-04-08
Filing date: 2018-04-08
Publication date: 2019-10-17
Also published as: CN111955043B; CN111955043A

Abstract

A method is provided including receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping.

Description

DYNAMIC MAXIMUM DATA BURST VOLUME ENFORCEMENT IN USER EQUIPMENT

TECHNICAL FIELD

Various example embodiments relate generally to communications and, more specifically, relate to prioritization of logical channels in wireless networks.

BACKGROUND

Future wireless networks (such as 5 ^th Generation (5G) wireless networks for example) are currently being designed to handle a wide range of services. The different services have different requirements, such as high data rate, low-power consumption, extended coverage, ultra-reliable low-latency communications (URLLC) , and massive connectivity.

BRIEF SUMMARY

This section is intended to include examples and is not intended to be limiting.

In an example embodiment, a method is provided including: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping.

According to an example embodiment an apparatus includes means for performing: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping.

According to an example embodiment, a method is provided including mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and transmitting the data according to the mapping.

According to an example embodiment, an apparatus is provided including means for performing: mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and transmitting the data according to the mapping.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and transmitting the data according to the mapping.

According to an example embodiment, a method is provided including transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information.

According to an example embodiment, an apparatus is provided including means for performing: transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information.

According to an example embodiment, a method is provided including determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel; transmitting, to a user equipment, information comprising a configuration of the at least one timer; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer.

According to an example embodiment, an apparatus is provided including means for performing: determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel; transmitting, to a user equipment, information comprising a configuration of the at least one timer; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer.

According to an example embodiment, a computer readable medium is provided including program instructions thereon for performing at least the following: determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel; transmitting, to a user equipment, information comprising a configuration of the at least one timer; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer.

BRIEF DESCRIPTION OF THE DRAWINGS

Some example embodiments will now be described with reference to the accompanying drawings.

FIG. 1 is a block diagram of one possible and non-limiting exemplary system in which the exemplary embodiments may be practiced;

FIGS. 2A-2D show examples of embodiments of the subject matter described herein;

FIG. 3 shows another example embodiment of the subject matter described herein; and

FIGS. 4-7 are logic flow diagrams for dynamic maximum data burst volume enforcement, and illustrate the operation of exemplary methods, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments.

DETAILED DESCRIPTION

Features as described herein occasionally refer to LTE terms, however, it is noted that these features may be used in the future with other types of systems (such as New Radio (NR) /5G wireless systems for example) . These other wireless systems may be defined by a relevant wireless standard, such as is the case of NR/5G systems for example. In this way, references to, for example, an eNB (i.e. an LTE base station) are equally applicable to future base stations of these other wireless networks (such as, for example, base stations in 5G wireless networks referred to as gNB) unless indicated otherwise.

Various exemplary embodiments herein describe techniques for dynamic maximum data burst volume enforcement. Additional description of these techniques is presented after a system into which the various exemplary embodiments may be used is described.

Turning to FIG. 1, this figure shows a block diagram of one possible and non-limiting exemplary system in which the exemplary embodiments may be practiced. In FIG. 1, a user equipment (UE) 110 is in wireless communication with a wireless network 100. A UE is a wireless, typically mobile device that can access a wireless network. The UE 110 includes one or more processors 120, one or more memories 125, and one or more transceivers 130 interconnected through one or more buses 127. Each of the one or more transceivers 130 includes a receiver, Rx, 132 and a transmitter, Tx, 133. The one or more buses 127 may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, and the like. The one or more transceivers 130 are connected to one or more antennas 128. The one or more memories 125 include computer program code 123. The UE 110 includes a restriction module 140, comprising one of or both parts 140-1 and/or 140-2, which may be implemented in a number of ways. The restriction module 140 may be implemented in hardware as restriction module 140-1, such as being implemented as part of the one or more processors 120. The restriction module 140-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array. In another example, the restriction module 140 may be implemented as restriction module 140-2, which is implemented as computer program code 123 and is executed by the one or more processors 120. For instance, the one or more memories 125 and the computer program code 123 may be configured to, with the one or more processors 120, cause the user equipment 110 to perform one or more of the operations as described herein. The UE 110 communicates with gNB/eNB 170 (generally referred to as gNB 170 below) via a wireless link 111.

The gNB 170 is a base station (for example, for 5G/LTE) that provides access by wireless devices such as the UE 110 to the wireless network 100. The gNB 170 includes one or more processors 152, one or more memories 155, one or more network interfaces (N/W I/F (s) ) 161, and one or more transceivers 160 interconnected through one or more buses 157. Each of the one or more transceivers 160 includes a receiver, Rx, 162 and a transmitter, Tx, 163. The one or more transceivers 160 are connected to one or more antennas 158. The one or more memories 155 include computer program code 153. The gNB 170 includes a configuration module, comprising one of or both parts 150-1 and/or 150-2, which may be implemented in a number of ways. The configuration module may be implemented in hardware as configuration module 150-1, such as being implemented as part of the one or more processors 152. The configuration module 150-1 may be implemented also as an integrated circuit or through other hardware such as a programmable gate array. In another example, the configuration module may be implemented as configuration module 150-2, which is implemented as computer program code 153 and is executed by the one or more processors 152. For instance, the one or more memories 155 and the computer program code 153 are configured to, with the one or more processors 152, cause the gNB 170 to perform one or more of the operations as described herein. The one or more network interfaces 161 communicate over a network such as via the

links

176 and 131. Two or more gNBs 170 communicate using, for example, link 176. The link 176 may be wired or wireless or both and may implement, for example, an X2 interface.

The one or more buses 157 may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, wireless channels, and the like. For example, the one or more transceivers 160 may be implemented as a remote radio head (RRH) 195, with the other elements of the gNB 170 being physically in a different location from the RRH, and the one or more buses 157 could be implemented in part as fiber optic cable to connect the other elements of the gNB 170 to the RRH 195.

It is noted that description herein indicates that “cells” perform functions, but it should be clear that the gNB that forms the cell will perform the functions. The cell makes up part of an gNB. That is, there can be multiple cells per gNB. For instance, there could be three cells for a single gNB carrier frequency and associated bandwidth, each cell covering one-third of a 360 degree area so that the single gNB’s coverage area covers an approximate oval or circle. Furthermore, each cell can correspond to a single carrier and an gNB may use multiple carriers. So if there are three 120 degree cells per carrier and two carriers, then the gNB has a total of 6 cells.

The wireless network 100 may include one or more network control elements (NCE) 190 that may include MME (Mobility Management Entity) and/or SGW (Serving Gateway) functionality, and which provides connectivity with a further network, such as a telephone network and/or a data communications network (for example, the Internet) . The gNB 170 is coupled via a link 131 to the NCE 190. The link 131 may be implemented as, for example, an S 1 interface. For 5G wireless systems, the link 131 may represent a 5G interface, such as NG2 or NG3 for example. The NCE 190 includes one or more processors 175, one or more memories 171, and one or more network interfaces (N/W I/F (s) ) 180, interconnected through one or more buses 185. The one or more memories 171 include computer program code 173. The one or more memories 171 and the computer program code 173 are configured to, with the one or more processors 175, cause the NCE 190 to perform one or more operations.

Those skilled in the art will appreciate that the various network elements shown in FIG. 1 may be implemented differently in future wireless network, such as 5G wireless networks. For example, the terms NCE, MME, and SGW are terms generally used for the core elements in a LTE network. In contrast to LTE, future wireless networks may carry out network functions (NFs) by a plurality of cooperating devices. The different NFs, may include for example, Access and Mobility Function (AMF) , Session Management Function (SMF) , Policy Control Function (PCF) , Application Function (AF) , Authentication Server Function (AUSF) , User Plane Function (UPF) , and User Data Management (UDM) . These NFs may be a virtualized function instantiated on an appropriate platform, such as a cloud infrastructure. For example, certain protocols (such as non real-time protocols for example) may be performed by one or more centralized units (CUs) in a cloud infrastructure, while one or more distributed units (DUs) operate the remaining protocols (e.g. real-time protocols) of the 5G radio interface. In this way, the various NFs may be split between CUs and DUs. Together a CU, underlying DUs, and RRHs may be considered as forming a logical base station (which may be represented by gNB 170 in FIG. 1 for example) .

The wireless network 100 may implement network virtualization, which is the process of combining hardware and software network resources and network functionality into a single, software-based administrative entity, a virtual network. Network virtualization involves platform virtualization, often combined with resource virtualization. Network virtualization is categorized as either external, combining many networks, or parts of networks, into a virtual unit, or internal, providing network-like functionality to software containers on a single system. Note that the virtualized entities that result from the network virtualization are still implemented, at some level, using hardware such as

processors

152 or 175 and memories 155 and 171, and also such virtualized entities create technical effects.

The computer

readable memories

125, 155, and 171 may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The computer

readable memories

125, 155, and 171 may be means for performing storage functions. The

processors

120, 152, and 175 may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multi-core processor architecture, as non-limiting examples. The

processors

120, 152, and 175 may be means for performing functions, such as controlling the UE 110, gNB 170, and other functions as described herein.

In general, the various example embodiments of the user equipment 110 can include, but are not limited to, cellular telephones such as smart phones, tablets, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, tablets with wireless communication capabilities, as well as portable units or terminals that incorporate combinations of such functions.

Having thus introduced one suitable but non-limiting technical context for the practice of the various exemplary embodiments, the exemplary embodiments will now be described with greater specificity.

Generally, a logical channel may define a type of information that is transmitted over an air interface. For example, in LTE, a logical channel is generally either a control logical channel (such as a BCCH, PCCH, CCCH, MCCH, and DCCH for example) or a traffic logical channel (such as DTCH and MTCH for example) , and may correspond to a radio bearer. In 5G, a logical channel may correspond to a service (such as a signaling services or data traffic services for example) .

Different services may have different quality of service (QoS) characteristics. For example the characteristics include a resource type (such as GBR, delay critical GBR or Non-GBR for example) , priority level, packet delay budget (PDB) , packet error rate (PER) , averaging window, and/or a maximum data burst volume (MDBV) . It is noted that MDBV corresponds to the largest amount of data that the access network is required to serve within a PDB period such as described in 3GPP TS 23.501 and 3GPP TS 38.300.

A logical channel priority (LCP) procedure is also utilized as part of the MAC layer in order to control how a user equipment uses an uplink grant to send data (such as how the UE multiplexes data onto transport block in uplink for example. LCP in 5G is generally based on LCP in LTE, and includes configuring a PBR is per bearer (i.e. per logical channel) to ensure higher priority LCHs are scheduled first while avoiding the starvation of lower priority ones. The PBR is used by the Token Bucket mechanisms such as described in 3GPP TS 38.321.

In 5G, LCP is enhanced further with the introduction of logical channel restrictions, where the RRC may restrict the mapping of a logical channel to a subset of the configured cells, numerologies, PUSCH transmission durations and control whether a logical channel can utilize the resources allocated by an uplink grant for example. It is noted that a numerology generally corresponds to one subcarrier spacing in the frequency domain. By scaling a reference subcarrier spacing by an integer N, different numerologies can be defined. With such restrictions, it then becomes possible to reserve, for instance, the numerology with the largest subcarrier spacing and/or shortest PUSCH transmission duration for URLLC services.

The combination of LCP and LCP restrictions results in a rate control which can generally be described as follows: a user equipment has an uplink rate control function which manages the sharing of uplink resources between logical channels, such as described in such as described in 3GPP TS 38.300. RRC controls the uplink rate control function by giving each logical channel a priority, a prioritized bit rate (PBR) , and a buffer size duration (BSD) . The uplink rate control function ensures that the UE serves the logical channel (s) in the following sequence:

1. All relevant logical channels in decreasing priority order up to their PBR; and

2. All relevant logical channels in decreasing priority order for the remaining resources assigned by the grant.

In case the PBRs are all set to zero, the first step is skipped and the logical channels are served in strict priority order: the UE maximizes the transmission of higher priority data. Mapping restrictions may also tell the UE which logical channels are relevant for the grant received. If no mapping restrictions are configured, all logical channels are considered. Through radio protocol configuration and scheduling, the base station (for example a gNB) can guarantee the Guaranteed Flow Bit Rate (s) (GFBR (s) ) and ensure that neither the Maximum Flow Bit Rate (s) (MFBR (s) ) nor the UE-AMBR (Aggregated Maximum Bit Rate) are exceeded in uplink. If more than one logical channel has the same priority, the UE shall serve them equally.

By configuring LCP restrictions in such a way that only one logical channel is allowed on a specific resource (such as a numerology or cell for example) , scheduling that resource individually allows to control how many resources are given to one logical channel. However, such restrictions may be too restrictive in practice as urgent data, such as SRB or URLLC for example, would typically have to be transmitted in all possible resources to benefit for instance from duplication.

Various example embodiments enable restrictions where the resource on which the bearer is mapped is not restricted and thus avoid, for example, restricting an URLLC to one resource.

On/Off Indication

According to some example embodiments, a MAC control element (CE) comprises an indication of one or more logical channels that should not be transmitted in the uplink. The MAC CE can be implemented in different ways. For example, the indication may explicitly signal an identifier (such as an LCID for example) of each logical channel, or the implicitly such as by using a bitmap. The logical channels that are ‘flagged’ by this MAC CE would then be skipped in LCP and be considered as not having any data to send. It is noted that in some example the BSR reporting is unaffected so that it is ensured that buffered data is still being reported accurately. In this way the scheduler in the base station has to means to identify data being queued up and the need for the restriction to be lifted. In some example embodiments, another MAC CE may be sent in order to lift the restriction. In other example embodiments, a timer may be used. For example, the timer may be started upon receiving the MAC CE signaling the restriction and the restriction would be kept in place for as long as that timer is running.

Referring now to FIGS. 2A-2D show non-limiting examples of control elements in accordance with some example embodiments. In each of these figures the bits labeled as ‘R’ are reserved bits.

FIG. 2A shows a control element 200 having a dynamic size that indicates which logical channels should become restricted. In the example shown in FIG. 2A, the control element 200 has five fields each having a length of six bits. Each field indicates a logical control channel identifier, namely LCID1 to LCID 5.

FIG. 2B shows a control element 202 having a fixed size. In this example, the control element indicates a logical channel becoming restricted.

In example embodiments such as those represented by FIGS. 2A-2B, the logical channel (s) may rely on the expiry of a timer started upon reception of the control element or by sending another MAC CE of the same format but identified with a different LCID to indicate that the restriction is lifted.

FIG. 2C shows a control element 204 having a dynamic size. In this example, each logical channel that is identified in the control element 204 (namely, LCID ₁ ... LCID _N) has a corresponding indication indicating whether that logical channel should be restricted or not. In this example, the indications are represented by the 1-bit fields labeled as ‘S’ . For example, the field may be set to ‘1’ to indicate that a restriction is in place for that LCID while the field set to ‘0’ indicated that the restriction no longer applies.

FIG. 2D shows a control element 206 having a fixed size. In this example the control element 206 identifies one logical channel. Similar to the example shown in FIG. 2C, a corresponding field indicates whether a restriction is in place for the one logical field.

Soft Prioritization

In some example embodiments, a control element (such as a MAC CE for example) may remove tokens from a bucket of one or more logical channels. The exact number of tokens to remove may be explicitly signaled per logical channel. In such examples, control element would signal both the LCID and the number of tokens to remove. In some example embodiments, the number of tokens to remove may be pre-confignred through RRC. In such embodiments, the tokens are removed only for the logical channels for which the token restrictions apply, which may be either explicitly by the signaling of an LCID or through a bitmap.

Referring now to FIG. 3, this figure shows an example control element 300 where the number of tokens to remove is explicitly signaled. In this example, the control element 300 includes and LCID field that is 6 bits long and an 18-bit field that is used to indicate the number of tokens to be removed for the identified logical channel. Thus, it is possible to remove a maximum of 262144 tokens from the bucket of the identified logical channel using the control element 300. Control element 300 is only an example and is not intended to be limiting. For example, larger or smaller sizes could also be used. Also, for example, a control element having a dynamic size may be used to indicate multiple LCIDs. In such an example, a single value could be included in the control element that corresponds to a number of tokens to be removed from each indicated LCID. Alternatively, a plurality of values may be included in the control element where each of the values corresponds to a different LCID and indicates the number of tokens to be removed for that LCID.

As can be seen from the above, some example embodiments allow the control element to consist simply of a MAC subheader indicating that a timer controlling the restrictions should start for a predefined subset of logical channels.

Configurable Timer (s)

In some example embodiments, one or more configurable timers may be provided that control how tokens are added to the bucket in LCP. For example, once the equivalent amount of a full bucket is transmitted (corresponding to PBR x BSD tokens) , a prohibit timer may be started which would forbid adding new tokens to the bucket until the prohibit timer expires. In some embodiments, the prohibit timer may be configured per logical channel, and signaled by the base station. In other examples, the prohibit timer may be predefined (such as by an applicable wireless standard for example) . In some example embodiments, one or more timers may define a time pattern where tokens could be increased only during fixed periods, repeating with a fixed periodicity. The period may correspond to the BSD, configured by the gNB based on the PSD. The periodicity may be configured by the gNB based on the GBR, MDBV and PSD. For example, a base station may determine the values of the one or more timers based on QoS parameters, and then signal the values of the one or more timers to the user equipment.

FIG. 4 is a logic flow diagram for dynamic maximum data burst volume enforcement. This figure further illustrates the operation of an exemplary method or methods, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments. For instance, the restriction module 140-1 and/or 140-2 may include multiples ones of the blocks in FIG. 4, where each included block is an interconnected means for performing the function in the block. The blocks in FIG. 4 are assumed to be performed by the UE 110, for example, under control of the restriction module 140-1 and/or 140-2 at least in part.

According to an example embodiment, a method is provided including: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources as indicated by block 400; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information as indicated by block 402; and transmitting the data based on the mapping as indicated by block 404. The information may include a logical channel identifier for each of the restricted logical channels. The information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is restricted. The information may include: a number of tokens to be removed for each of the restricted logical channels. Mapping the data may include at least one of: omitting each of the restricted logical channels from the logical channel priority procedure; and removing the number of tokens from a bucket corresponding to each of the restricted logical channels, wherein the logical channel priority procedure comprises a token bucket algorithm. The restricted logical channels may be restricted until expiry of a timer, wherein the timer is started upon reception of the information. The method may further include receiving further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted. The information may be received in a control element from a network, and the control element may be either a fixed size or a dynamic size.

According to an example embodiment, an apparatus is provided including means for performing: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping. The information may include a logical channel identifier for each of the restricted logical channels. The information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is restricted. The information may include: a number of tokens to be removed for each of the restricted logical channels. Mapping the data may include at least one of: omitting each of the restricted logical channels from the logical channel priority procedure; and removing the number of tokens from a bucket corresponding to each of the restricted logical channels, wherein the logical channel priority procedure comprises a token bucket algorithm. The restricted logical channels may be restricted until expiry of a timer, wherein the timer is started upon reception of the information. The apparatus may further comprise means for receiving further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted. The information may be received in a control element from a network, and the control element may be either a fixed size or a dynamic size. The means may include at least one processor; and at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and transmitting the data based on the mapping. The information may include a logical channel identifier for each of the restricted logical channels. The information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is restricted. The information may include: a number of tokens to be removed for each of the restricted logical channels. Mapping the data may include at least one of: omitting each of the restricted logical channels from the logical channel priority procedure; and removing the number of tokens from a bucket corresponding to each of the restricted logical channels, wherein the logical channel priority procedure comprises a token bucket algorithm. The restricted logical channels may be restricted until expiry of a timer, wherein the timer is started upon reception of the information. The program instructions may further cause the apparatus to receive further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted. The information may be received in a control element from a network, and the control element may be either a fixed size or a dynamic size.

FIG. 5 is a logic flow diagram for dynamic maximum data burst volume enforcement. This figure further illustrates the operation of an exemplary method or methods, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments. For instance, the restriction module 140-1 and/or 140-2 may include multiples ones of the blocks in FIG. 5, where each included block is an interconnected means for performing the function in the block. The blocks in FIG. 5 are assumed to be performed by the UE 110, for examples, under control of the restriction module 140-1 and/or 140-2 at least in part.

According to an example embodiment, a method is provided including mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer as indicated by block 500; and transmitting the data according to the mapping as indicated by block 502. The at least one configurable timer may be started after a threshold amount of data is mapped to a given logical channel. The threshold amount of data may be based on a prioritized bit rate and a buffer size duration. The timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one configurable timer defines a time pattern may include one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods.

According to an example embodiment, an apparatus is provided including means for performing: mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and transmitting the data according to the mapping. The at least one configurable timer may be started after a threshold amount of data is mapped to a given logical channel. The threshold amount of data may be based on a prioritized bit rate and a buffer size duration. The timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one configurable timer defines a time pattern may include one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods. The means may include at least one processor; and at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and transmitting the data according to the mapping. The at least one configurable timer may be started after a threshold amount of data is mapped to a given logical channel. The threshold amount of data may be based on a prioritized bit rate and a buffer size duration. The timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one configurable timer defines a time pattern may include one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods.

FIG. 6 is a logic flow diagram for dynamic maximum data burst volume enforcement. This figure further illustrates the operation of an exemplary method or methods, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments. For instance, the configuration module 150-1 and/or 150-2 may include multiples ones of the blocks in FIG. 6, where each included block is an interconnected means for performing the function in the block. The blocks in FIG. 6 are assumed to be performed by a base station such as gNB 170, for example, under control of the configuration module 150-1 and/or 150-2 at least in part.

According to an example embodiment, a method is provided including transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources as indicated by block 600; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information as indicated by block 602. The information may include a logical channel identifier for each of the restricted logical channels. The transmitted information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is to be restricted. The transmitted information may indicate a number of tokens to be removed for each of the restricted logical channels. The method may further include transmitting further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted.

According to an example embodiment, an apparatus is provided including means for performing: transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information. The information may include a logical channel identifier for each of the restricted logical channels. The transmitted information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is to be restricted. The transmitted information may indicate a number of tokens to be removed for each of the restricted logical channels. The means may include means for transmitting further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted. The means may include at least one processor; and at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.

According to an example embodiment, a computer readable medium is provided including program instructions for causing an apparatus to perform at least the following: transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information. The information may include a logical channel identifier for each of the restricted logical channels. The transmitted information may include: a logical channel identifier for each logical channel in a subset of the set of logical channels; and a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is to be restricted. The transmitted information may indicate a number of tokens to be removed for each of the restricted logical channels. The program instructions may further cause the apparatus to perform transmitting further information indicating at least one of: one or more further restricted logical channels; and one or more of the restricted channels are no longer restricted.

FIG. 7 is a logic flow diagram for dynamic maximum data burst volume enforcement. This figure further illustrates the operation of an exemplary method or methods, a result of execution of computer program instructions embodied on a computer readable memory, functions performed by logic implemented in hardware, and/or interconnected means for performing functions in accordance with exemplary embodiments. For instance, the configuration module 150-1 and/or 150-2 may include multiples ones of the blocks in FIG. 7, where each included block is an interconnected means for performing the function in the block. The blocks in FIG. 7 are assumed to be performed by a base station such as gNB 170, for example, under control of the configuration module 150-1 and/or 150-2 at least in part.

According to an example embodiment, a method is provided including determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel as indicated by block 700; transmitting, to a user equipment, information comprising a configuration of the at least one timer as indicated by block 702; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer as indicated by block 704. The configuration may cause the at least one timer to be started after a threshold amount of data is mapped by the user equipment to a given logical channel. The at least one timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one timer may define a time pattern including one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods.

According to an example embodiment, an apparatus is provided including means for performing: determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel; transmitting, to a user equipment, information comprising a configuration of the at least one timer; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer. The configuration may cause the at least one timer to be started after a threshold amount of data is mapped by the user equipment to a given logical channel. The at least one timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one timer may define a time pattern including one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods. The means may include at least one processor; and at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.

According to an example embodiment, a computer readable medium is provided including program instructions thereon for performing at least the following: determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel; transmitting, to a user equipment, information comprising a configuration of the at least one timer; and receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer. The configuration may cause the at least one timer to be started after a threshold amount of data is mapped by the user equipment to a given logical channel. The at least one timer may prohibit additional tokens from being added to a bucket of the given logical channel while the at least one timer is running. The at least one timer may define a time pattern including one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods. A first timer may define a length the fixed time periods, and a second timer may define a periodicity of the fixed time periods.

Without in any way limiting the scope, interpretation, or application of the claims appearing below, a technical effect of one or more of the example embodiments disclosed herein is allowing finer control of logical channels and allow the gNB to be able to cope with overload situations more efficiently. Another technical effect of one or more of the example embodiments disclosed herein is allowing all background data to be dynamically blocked and only allow high priority traffic. Another technical effect of one or more of the example embodiments disclosed herein is allowing the possibility of dynamically enforcing MDBV.

Embodiments herein may be implemented in software (executed by one or more processors) , hardware (for example, an application specific integrated circuit) , or a combination of software and hardware. In an example embodiment, the software (for example, application logic, an instruction set) is maintained on any one of various conventional computer-readable media. In the context of this document, a “computer-readable medium” may be any media or means that can contain, store, communicate, propagate or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer, with one example of a computer described and depicted, for example, in FIG. 1. A computer-readable medium may comprise a computer-readable storage medium (for example,

memories

125, 155, 171 or other device) that may be any media or means that can contain, store, and/or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer. A computer-readable storage medium does not comprise propagating signals.

If desired, the different functions discussed herein may be performed in a different order and/or concurrently with each other. Furthermore, if desired, one or more of the above-described functions may be optional or may be combined.

Although various aspects of the invention are set out in the independent claims, other aspects of the invention comprise other combinations of features from the described embodiments and/or the dependent claims with the features of the independent claims, and not solely the combinations explicitly set out in the claims.

It is also noted herein that while the above describes example embodiments of the invention, these descriptions should not be viewed in a limiting sense. Rather, there are several variations and modifications which may be made without departing from the scope of the present invention as defined in the appended claims.

The following abbreviations that may be found in the specification and/or the drawing figures are defined as follows:

5QI 5 ^th generation QoS Identifier

eNB (or eNodeB) evolved Node B (e.g., an LTE base station)

gNB 5 ^th generation Node B

I/F interface

LTE long term evolution

MDBV maximum data burst volume

MME mobility management entity

NCE network control element

N/W network

PDB packet delay budget

QoS quality of service

RRH remote radio head

Rx receiver

SGW serving gateway

Tx transmitter

UE user equipment (e.g., a wireless, typically mobile device)

URLLC ultra-reliable and low latency communications

Claims

An apparatus comprising

at least one processor; and

at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to:

receive information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources;

map data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and

transmit the data based on the mapping.
The apparatus as in claim 1, wherein the information comprises a logical channel identifier for each of the restricted logical channels.
The apparatus as in claims 1 or 2, wherein the information comprises:

a logical channel identifier for each logical channel in a subset of the set of logical channels; and

a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is restricted.
The apparatus as in claims 1 or 2, wherein the information comprises: a number of tokens to be removed for each of the restricted logical channels.
The apparatus as in any one of claims 1-4, wherein mapping the data comprises at least one of:

omitting each of the restricted logical channels from the logical channel priority procedure; and

removing the number of tokens from a bucket corresponding to each of the restricted logical channels, wherein the logical channel priority procedure comprises a token bucket algorithm.
The apparatus as in any one of claims 1-5, wherein the restricted logical channels are restricted until expiry of a timer, and the wherein the at least one memory and computer program code are configured to, with the at least one processor, cause the apparatus further to start the timer upon reception of the information.
The apparatus as in any preceding claim wherein the at least one memory and computer program code are configured to, with the at least one processor, cause the apparatus to receive further information indicating at least one of:

one or more further restricted logical channels; and

one or more of the restricted channels are no longer restricted.
The apparatus as in any one of the preceding claims, wherein the information is received in a control element from a network, and wherein the control element is either a fixed size or a dynamic size.
An apparatus comprising:

at least one processor; and

at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to:

map data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and

transmit the data according to the mapping.
The apparatus as in claim 9, wherein the at least one configurable timer is started after a threshold amount of data is mapped to a given logical channel.
The apparatus as in claim 10, wherein the threshold amount of data is based on a prioritized bit rate and a buffer size duration.
The apparatus as in any of claims 9-11, wherein the timer prohibits additional tokens from being added to a bucket of the given logical channel while the timer is running.
The apparatus as in any of claims 9-12, wherein the at least one configurable timer defines a time pattern comprising one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods.
The apparatus as in claim 13, wherein a first timer defines a length of the fixed time periods, and a second timer defines a periodicity of the fixed time periods.
A method comprising:

receiving information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure such that data of the restricted one or more logical channels is restricted from being sent on uplink resources;

mapping data of the set of logical channels to uplink resources according to the logical channel priority procedure and the received information; and

transmitting the data based on the mapping.
The method as in claim 15, wherein the information comprises a logical channel identifier for each of the restricted logical channels.
The method as in claims 15 or 16, wherein the information comprises:

a logical channel identifier for each logical channel in a subset of the set of logical channels; and

a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is restricted.
The method as in claims 15 or 16, wherein the information comprises: a number of tokens to be removed for each of the restricted logical channels.
The method as in any one of claims 15-18, wherein mapping the data comprises at least one of:

omitting each of the restricted logical channels from the logical channel priority procedure; and

removing the number of tokens from a bucket corresponding to each of the restricted logical channels, wherein the logical channel priority procedure comprises a token bucket algorithm.
The method as in any one of claims 15-19, wherein the restricted logical channels are restricted until expiry of a timer, wherein the timer is started upon reception of the information.
The method as in any one of claims 15-20 further comprising receiving further information indicating at least one of:

one or more further restricted logical channels; and

one or more of the restricted channels are no longer restricted.
The method as in any one of claims 15-21, wherein the information is received in a control element from a network, and wherein the control element is either a fixed size or a dynamic size.
A method comprising:

mapping data of a set of logical channels according to a logical channel priority procedure, wherein the logical channel priority procedure comprises a token bucket algorithm that is restricted by at least one configurable timer; and

transmitting the data according to the mapping.
The method as in claim 23, wherein the at least one configurable timer is started after a threshold amount of data is mapped to a given logical channel.
The method as in claim 24, wherein the threshold amount of data is based on a prioritized bit rate and a buffer size duration.
The method as in any one of claims 23-25, wherein the timer prohibits additional tokens from being added to a bucket of the given logical channel while the at least one timer is running.
The method as in any one of claims 23-26, wherein the at least one configurable timer defines a time pattern comprising one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods.
The method as in claim 27, wherein a first timer defines a length the fixed time periods, and a second timer defines a periodicity of the fixed time periods.
A method comprising:

transmitting information indicating one or more restricted logical channels of a set of logical channels for controlling a logical channel priority procedure of at least one user equipment such that data of the restricted one or more logical channels is restricted from being sent on uplink resources; and

receiving data from the at least one user equipment, wherein the data of the set of logical channels is mapped to uplink resources according to the logical channel priority procedure and the transmitted information.
The method as in claim 29, wherein the information comprises a logical channel identifier for each of the restricted logical channels.
The method as in claims 29 or 30, wherein the transmitted information comprises:

a logical channel identifier for each logical channel in a subset of the set of logical channels; and

a value associated with each logical channel identifier in the subset indicating whether the corresponding logical channel is to be restricted.
The method as in claims 29 or 30, wherein the transmitted information indicates a number of tokens to be removed for each of the restricted logical channels.
The method as in any one of claims 29-32, further comprising transmitting further information indicating at least one of:

one or more further restricted logical channels; and

one or more of the restricted channels are no longer restricted.
A method comprising:

determining a value of at least one timer to be used in a logical channel priority procedure based on one or more quality of service characteristics associated with at least one logical channel;

transmitting, to a user equipment, information comprising a configuration of the at least one timer; and

receiving data from the user equipment, wherein the data is mapped to a set of logical channels based on the logical channel priority procedure and the at least one timer.
The method as in claim 34, wherein the configuration causes the at least one timer to be started after a threshold amount of data is mapped by the user equipment to a given logical channel.
The method as in claim 34 or 35, wherein the at least one timer prohibits additional tokens from being added to a bucket of the given logical channel while the at least one timer is running.
The method as in any one of claims 34-36, wherein the at least one timer defines a time pattern comprising one or more fixed time periods, wherein tokens are added to a bucket of at least one logical channel during the fixed time periods.
The method as in claim 37, wherein a first timer defines a length the fixed time periods, and a second timer defines a periodicity of the fixed time periods.
An apparatus comprising means for performing a method as in any one of claims 15-38.
An apparatus as in claim 39, wherein the means comprises:

at least one processor; and

at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.