Method for transmitting data within a communication network

Abstract

A method for managing data transmission within a communication network, the communication network comprising a base station (BS) for scheduling network resources for transmission of data by a user equipment (UE) of the communication network, the UE manages a first logical channel and a second logical channel with which data can be associated. The UE transmits, upon receipt of a first schedule from the BS, data associated with the second logical channel using network resources which would otherwise have been allocated to the first logical channel if the first schedule were to be followed. The UE transmits, upon receipt of a second schedule from the BS, data associated with the first logical channel using network resources which at least partially compensate for the network resources that were previously allocated to the second logical channel in response to the first schedule. The compensation of previously allocated network resources to the first logical channel may be provided by the communication network, and the compensation may be performed in response to an identification that data associated with the first logical channel is time critical.

Description

FIELD OF THE DISCLOSURE The present disclosure relates to a method for transmitting data within a communication network. More particularly, the method relates to allocating resources to a logical channel of a user equipment (UE) of the communication network based on a previous network resource allocation. BACKGROUND Wireless communication systems are deployed to address a wide range of applications, including mobile broadband, massive machine type communications, and Ultra Reliable Low Latency Communications (URLLC). Such systems allow a plurality of user equipment (UE) or mobile terminals to share the wireless medium to exchange different types of data content (e.g., video, voice, messaging...) over a radio access network (RAN) through one or more base stations. Examples of such wireless multiple-access communication systems include systems based on 3rd generation partnership project (3GPP - RTM) standards, such as fourth generation (4G) Long Term Evolution (LTE) and (more recently) fifth-generation (5G) New Radio (NR) systems, or systems based on IEEE 802.11 standards, such as Wi-Fi. Among the requirements for 5G NR, there are service requirements related to extended reality (XR). XR (i.e., extended Reality) applications are defined in 3GPP document RP-2200285 as “various types of augmented, virtual, and mixed environments, where human-to-machine and human-to-human communications are performed with the assistance of handheld and wearable end user devices”. Various use cases can be found in 3GPP document TR-26.928. Many XR applications involve interactions between a wearable device (e.g., a 3D helmet or augmented reality glasses) and an application server. The wearable device and the application server can be connected through a local Network (e.g., a wireless LAN) or cellular network (e.g., 3GPP 5G cellular network, the application server being connected to a 5G core network component of the network). Some XR applications, such as cloud gaming, involve transferring compressed video data, audio data from the server to the UE and positioning information from the UE to the server. Some XR applications like virtual reality, involve transferring compressed video data, audio data and various information from the server to the wearable device. Some XR applications like augmented reality, involve transferring compressed video data, audio data and various information exchanged to and from the wearable device and the server. In the present disclosure, the information exchanged to and from the UE (e.g., wearable device) and the server is referred to as application data, which may comprise one or more images, video data, audio data, position information etc. The video and audio data are transferred between the UE (e.g., wearable device) and the server using media transport protocols such as RTP (Real Time Protocol, RFC 3550), SRTP (Secured RTP, RFC 3711), HTTP (HyperText Transfer Protocol, RFC 2616-7540) or QUIC (RFC 8999, 9000, 9001 and 9002). Video encoding and decoding can be performed according to various formats including MPEG2, H.264, H.265, HEVC, etc. In particular, applications generate data (e.g., application data) in the form of encoded video, audio, or position information etc. This application data is primarily arranged in data packets by the application. For example, an application data packet representing one unit of information may be generated at the application level. According to the 3GPP standard, a set of Protocol Data Units, or Packet Data Units, (PDUs) are necessary to transport an application data packet (i.e., “PDU Set”). Accordingly, the application data comprises one or more application data packets. During downlink, 3GPP PDUs are formatted by the PDU Layer of the core network. In the same way, during uplink, the 3GPP PDUs are formatted by the PDU layer of the UE (e.g., wearable device). According to the 3GPP standard, the delimitations of the PDU Sets (e.g., start, stop, and length etc.) are not provided by the application but generated by the core network (respectively the UE) through media transport protocol packet inspection. The detailed procedure can be found in 3GPP document S2-2302696. A PDU Set includes one or more PDUs that carry the payload of one unit of information generated at the application level (e.g., a frame or video slice forXRM Services, as used in TR 26.926). In some implementations, all PDUs in a PDU Set are needed by the application layer to use the corresponding unit of information. For example, one PDU Set may comprise the data of one image or frame from a video stream. In other implementations, the application layer can still recover parts, or all, of the information unit, when some PDUs are missing. The network used to transport the application data can experience perturbation and congestion. It is therefore possible that some PDUs of a PDU Set are missing, or are late, at the receiving side (e.g., UE PDU layer during downlink, and core network user plane function (UPF) during uplink). Some video decoder implementations require that a complete application data packet (e.g., complete PDU Set) is received on time in order to adequately decode a video. Some other implementations can tolerate late arrival of data packets, or partial delivery of a data packet. For example, these implementations rely on Forward Error Correction (FEC) technology or concealment techniques. According to the 3GPP standard, in document S2-2302696, a PDU Set QoS parameter called PDU Set Delay Budget (PSDB) is defined. The PSDB defines a time budget allocated to the transport of the PDU Set across the 5G network. This QoS parameter, defined by the application, is used by a 5G network to assess if a PDU Set (e.g., application data packet) is delivered on time. In the same 3GPP document, S2-2302696, another QoS parameter named PDU Set Integrated Handling Indication (PSIHI) is defined to characterize the decoder’s tolerance to the loss of data, or receiving outdated (e.g., delayed) data. If the PSIHI parameter is set to “true”, then the decoder can only handle (e.g., manage or process) a complete application data packet which is received on time. If the PSIHI parameter is set to “false”, then the decoder can tolerate both incomplete and delayed application data packets. Considering the situation at a particular component of the 5G network, when a PDU Set is sent over the air interface, some information is available regarding the reception status of the PDUs and the elapsed time of the PSDB. For example, when a PDU Set is transferred over the air a Radio Access Network (RAN) node (e.g., a UE or a next gen node (gNB)) can detect that a PDU transmission has failed despite all the retransmissions and error correction mechanisms. In that case, if the PSIHI parameter is set to “true”, then the entire PDU Set is useless to the application. In that case, if one or more PDUs of this “useless” PDU Set are pending transmission over the air interface then the RAN node can consider discarding the remaining transmission of the “useless” PDUs, thus achieving radio network resource saving. The gNB (i.e., base station) of a 5G network is responsible for scheduling the uplink traffic. In some cases, XR data may have a PSDB which must not be overrun because otherwise the data will become obsolete. Therefore, it is necessary for the scheduler to have knowledge of the amount of data that has a short period of time remaining (i.e., before the delay period elapses). For that purpose, the UE may send a report to the gNB when the remaining time is below a threshold value. Using the information provided by the UE the gNB can perform resource scheduling by sending uplink grant messages to the UE. The uplink grant can be addressed to each UE individually. After receiving an uplink grant the UE transmits an amount of data that is consistent with the resources that have been allocated to it by the uplink grant. This procedure is called the logical channel prioritization (LCP), as described in TS 38.321, clause 5.4.3.1. Typically, the UE allocates the network resources amongst the available logical channels to match the uplink grant resources. For example, the resource allocation may be based on a predetermined criteria (e.g.., including priority, bucket size, and available data) in a simplified implementation of the well-known Weighted Fair Queuing (WFQ) scheduling algorithm. However, problems can arise when analysing the complete resource allocation mechanism. For example, a UE may send information to the gNB when delay critical data is stored at the UE and needs urgent uplink grant transmission authorisation. After receiving the subsequent uplink grant information, the UE may not use the time criticality information to allocate the resources amongst the logical channels. As a result, data with low remaining time can be delayed due to other data (e.g., from an LCH with a higher priority status) being prioritised according to the LCP procedure. To address this issue, proposals have been made to modify the LCP procedure to account for the time criticality of the data associated with the UE. However, such modifications to the LCP procedure can disrupt the functionality of the algorithm, e.g., by reducing the algorithm’s ability to provide priority, fairness, and starvation avoidance for tragic across the network. Consequently, there is a need to provide a means of allocating resources more effectively within such wireless communication networks. I SUMMARY According to one or more aspects of the present disclosure, there is provided a technique for allocating network resources to a logical channel of a user equipment to compensate for network resources which had been allocated away from the logical channel in response to a previous scheduling decision of the network. Advantageously, this technique ensures that resources are more effectively targeted at the different logical channels (or logical channel groups) within the user equipment, whilst also maintaining the global balance of the network’s LCP algorithm. According to a first aspect of the present disclosure, there is provided a method for managing data transmission within a communication network, the communication network comprising a base station for scheduling network resources for transmission of data by a user equipment of the communication network, the user equipment manages a first logical channel and a second logical channel with which data can be associated, the method at the user equipment comprising: transmitting, upon receipt of a first schedule from the base station, data associated with the second logical channel using network resources which would otherwise have been allocated to the first logical channel if the first schedule were to be followed; and transmitting, upon receipt of a second schedule from the base station, data associated with the first logical channel using network resources which at least partially compensate for the network resources that were previously allocated to the second logical channel in response to the first schedule According to a second aspect of the present disclosure, there is provided a method for managing data transmission within a communication network, the communication network comprising a base station for scheduling network resources for transmission of data by a user equipment of the communication network, the user equipment manages a first logical channel and a second logical channel with which data can be associated, the method at the base station comprising: transmitting a first schedule to the user equipment and receiving data associated with the second logical channel using network resources which would otherwise have been allocated to the first logical channel if the first schedule were to be followed; and transmitting a second schedule to the user equipment and receiving data associated with the first logical channel using network resources which at least partially compensate for the network resources that were previously allocated to the second logical channel in response to the first schedule. Advantageously, the disclosures according to the above aspects enable network resources which are associated with the first channel to be diverted (e.g., allocated) toward the second channel having data to transmit, and in a subsequent schedule, return an amount of the diverted network resources back to the first channel. In this way, the global balance of the algorithm is preserved whilst allowing the second channel data to be sent on time. Optional features will now be set out. These are applicable singly or in any combination with any aspect of the disclosure. Optionally, the transmission in response to the second schedule comprising using network resources which would otherwise have been allocated to the second logical channel if the second schedule were to be followed. Optionally, the allocation of network resources from the second logical channel to the first logical channel is at least partly determined based on the network resources which were previously allocated to the second logical channel in response to the first schedule. Optionally, the amount of network resources allocated to the first logical channel in response to the second schedule is up to the amount of network resources which were previously allocated to the second logical channel in response to the first schedule. Optionally, the amount of network resources allocated to the first logical channel in response to the second schedule is equal to the amount of network resources which were previously allocated to the second logical channel in response to the first schedule. Optionally, the compensation of previously allocated network resources to the first logical channel is provided by the communication network. Optionally, the compensation of previously allocated network resources to the first logical channel is performed in response to an identification that data associated with the first logical channel is time-critical. Optionally, the amount of network resources allocated to the first logical channel in response to the second schedule is up to the amount of network resources used for transmitting time-critical data in response to the first schedule. Optionally, the first logical channel has a different priority status to that of the second logical channel. Optionally, the first logical channel has a higher priority status than the second logical channel. Optionally, wherein the priority status of at least one of the first and second logical channels is configurable by the base station. Optionally, the priority status of at least one of the first and second logical channels is configurable by the user equipment. Optionally, the priority status is determined based on at least one of the following criteria: a PDU Set importance value; an amount of critical data; and an amount of compensation data. Optionally, the compensation of previously allocated network resources to the first logical channel is stopped if the second logical channel includes time-critical data. Optionally, the compensation of previously allocated network resources to the first logical channel is stopped if no network resources were previously allocated from the first logical channel in response to the first schedule. Optionally, the method comprises recording the amount of data transmitted by the network resources which are allocated to the second logical channel in response to the first schedule. Optionally, the data transmitted in response to the second schedule is configured so that data associated with the first logical channel which was available at the time of the previous data transmission is prioritised over data which has become available since the previous data transmission. Optionally, the data transmitted by the user equipment can include bucket data and / or overflow data, wherein the data transmission in response to the second schedule is configured so that overflow data associated with the first logical channel is prioritised over both bucket data and overflow data associated with second logical channel. Optionally, overflow data associated with the first logical channel which was available at the time of the previous data transmission is prioritised over both bucket data and overflow data associated with second logical channel. Optionally, overflow data associated with the first logical channel which has become available since the time of the previous data transmission is prioritised over both bucket data and overflow data associated with second logical channel. The bucket size (for a given time period) may be determined based on information contained within the schedule. For example, the bucket size can be calculated for a time period S based on at least one of the following logical channel configuration parameters: a Prioritized Bit Rate (PBR); and a Bucket Size Duration (BSD)); and / or a Physical Uplink Channel duration parameter. The overflow (e.g., as defined by the overflow value O) represents the rest of the available data if the amount of available data is greater than the bucket size at time Optionally, the method comprises identifying, prior to allocating network resources from the first logical channel to the second logical channel, that data associated with second logical channel is time-critical. Optionally, the method comprises identifying, prior to the first schedule being received, that data associated with the second logical channel is time-critical. Optionally, wherein the method comprises transmitting to the base station, after receiving the first schedule, an indication that the first logical channel requires additional network resources. The indication may comprise information that at least part of the data associated with the second logical channel is time-critical. Optionally, wherein the method comprises transmitting to the base station, after receiving the first schedule, an indication that network resources which would otherwise have been allocated to the first logical channel are allocated to the second logical channel. Optionally, the compensation of previously allocated network resources to the first logical channel is provided at least in part by the communication network and at least in part using network resources which would otherwise have been allocated to the second logical channel if the second schedule were to be followed. Optionally, the compensation of previously allocated network resources to the first logical channel is provided by the communication network Optionally, the method comprises, upon receipt of an indication from the user equipment that the first logical channel requires additional network resources, configuring the second schedule to allocate additional resources to the user equipment. Optionally, the amount of additional resources allocated to the user equipment is based on the amount of network resources which were previously allocated to the second logical channel in response to the first schedule. Optionally, wherein the method comprises configuring a third schedule to allocate additional resources to the user equipment Optionally, the method comprises identifying, prior to allocating network resources from the second logical channel to the first logical channel, that data associated with second logical channel is time-critical. Optionally, the method comprises identifying, prior to allocating network resources from the second logical channel to the first logical channel, whether network resources were previously allocated from the first logical channel in response to the first schedule. Optionally, the time-critical criterion is prioritised over the compensation criterion. According to a third aspect there is provided a user equipment configured to perform the method according to the first aspect. According to a fourth aspect there is provided a base station configured to perform the method according to the second aspect. According to a fifth aspect there is provided a communication network comprising at least one of a user equipment according to the third aspect and a base station according to the fourth aspect. According to a sixth aspect there is provided a computer program comprising instructions which, when the program is executed by a user equipment, causes the user equipment (e.g., a transmitter thereof) to carry out the method according to the first aspect. According to a seventh aspect there is provided a computer program comprising instructions which, when the program is executed by a base station, causes the base station (e.g., a transmitter thereof) to carry out the method according to the second aspect. According to an eighth aspect there is provided a computer-readable medium carrying a computer program according at least one of the sixth and seventh aspects. According to aspects of the present disclosure, there is provided a technique for diverting resources which have been allocated to a higher priority channel towards a lower priority channel which has time critical data. Subsequently, (e.g., as defined in a subsequent uplink grant), at least some of the previously allocated resources are returned back to higher priority channel. This means that the global balance of the LCP algorithm is preserved whilst also allowing the lower priority time critical data to be sent on time. According to aspects of the disclosure, the scheduling provided by the base station (i.e., from the network) may be (or comprise) an uplink grant for allocating network resources to the user equipment. Any feature in one aspect of the disclosure may be applied to other aspects of the disclosure, in any appropriate combination. In particular, method aspects may be applied to apparatus / device / unit aspects, and vice versa. It will be understood that features implemented in hardware may be implemented in software, and vice versa. Any reference to software and hardware features herein should be construed accordingly. For example, in accordance with other aspects of the disclosure, there are provided a computer program comprising instructions which, when the program is executed by one or more processing units, cause the one or more processing units to carry out the method of any aspect or example described above and a computer readable storage medium carrying the computer program. The preceding summary is provided for purposes of summarising some examples to provide a basic understanding of aspects of the subject matter described herein. Accordingly, the above-described features should not be construed to narrow the scope or spirit of the subject matter described herein in any way. Moreover, the above and / or proceeding examples may be combined in any suitable combination to provide further exam pies, except where such a combination is clearly impermissible or expressly avoided. Other features, aspects, and advantages of the subject matter described herein will become apparent from the following text and the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Different aspects of the disclosure will now be described, by way of example only, and with reference to the following drawings in which: Figure 1 is a schematic diagram illustrating a first example wireless communication system in which the present disclosure may be implemented according to one or more embodiments of the disclosure; Figure 2 is a schematic diagram of an example configuration of a UE in which the present disclosure may be implemented according to one or more embodiments of the disclosure; Figure 3 is a schematic diagram of an example configuration of a base station in which the present disclosure may be implemented according to one or more embodiments of the disclosure; Figure 4 is a schematic diagram illustrating the data plane protocol stack of a 5G NR system as represented in Figure 1; Figure 5 is a schematic diagram illustrating the execution of an LCP algorithm when receiving a first schedule; Figure 6 is a schematic diagram illustrating the LCP algorithm when receiving a subsequent (e.g., second) schedule at timeT+1; and Figures 7 and 8 are flow charts of alternative methods which is executed at the UE when receiving a schedule. DETAILED DESCRIPTION Figure 1 illustrates an example wireless communication system 100, in particular a mobile radio communication system such as a fifth-generation (5G) New Radio (NR) system supporting extended reality service (XR). Although in the following description, embodiments and examples of embodiments of the present disclosure will be described with respect to a 5G NR system, it will be appreciated that it is not intended that the present disclosure is limited to 5G NR systems and may be used in any wireless communication systems supporting XR or similar service. The system 100 comprises a User Equipment (UE) 101, 151 which may be for instance virtual reality helmets or extended reality wearables like glasses, served by a base station 110 to communicate with a core network, such as the 5G core network 102. The UE may be any wireless device, such as a wireless communication device or apparatus or terminal, loT device, Machine Type Communication (MTC) device, Device to Device (D2D) terminal, user device (e.g., smart phone, laptop, mobile phone, tablet, camera, game console, wearable device), capable of wireless communication with one or more core networks via one or more Radio Access Networks. The base station 110 is a network node which provides an access point to the core network for a UE and is part of the Radio Access Network (RAN) composed of the base stations 110, and 111. In NR, base stations are referred to as next-generation Node Bs (gNBs), the RAN is a Next Generation (NG) RAN and the core network is referred to as the 5GC. In the following, the terms RAN node, base station and gNB will be used interchangeably. The base stations 110 and 111 are interconnected by means of the Xn interface (e.g., as specified in the 3GPP document TS 38.423) implemented on the wired or wireless link 130. Each base station is connected to the core network 102 by means of the NG interface (e.g., as specified in the 3GPP document TS 38.413) implemented on the wired or wireless links 140 and 141. Each of these base stations controls one or multiple cells. For instance, the base station 110 controls the cell 120, and the base station 111 controls the cell 121. A cell is a geographical area of a radio network defined by the frequency used in the cell to transmit data. The cell can be uniquely identified by a UE from an identification that is broadcasted over a geographical area. Each base station 110, 111 can serve several UEs 101, 151. Once a UE has established a RRC connection with a base station, the base station, to which the UE is connected, is referred to as the serving base station (or source base station) of the UE and the cell which is controlled by the serving base station, and on which the UE camps, is referred to as the serving cell. The interface between a gNB and a UE is the Uu interface using the protocol sublayers Service Data Adaptation Protocol (SDAP), Packet Data Convergence Protocol (PDCP), Radio Link Control (RLC), Medium Access Control (MAC), Physical (PHY) in the user plane, and the protocol sublayers Radio Resource Control (RRC), PDCP, RLC, MAC, PHY in the control plane. It is assumed that the UE 101 is receiving and / or sending XR data of one or more multicast XR sessions generated and / or destinated to the XR application server 103. XR data is provided to the base station 111 (which is the base station controlling the cell 121 on which the UE 101 is attached) through the core network 102 (e.g., through the Data Network 160 and the User Plane Function 161) and the transport bearer (also known as a GTP-U tunnel) 106 over the link 141. Then, XR data is transmitted by the base station 111 to the UE 101 through the Data Radio Bearer (DRB) 154. Figure 1 also shows the UE 151 receiving data through DRB 153. A radio bearer is a set of PHY (layer 1) and MAC (layer 2) parameters allowing higher layer data connection between a UE and a gNB. Multiple types of radio bearers are defined in 5G NR: the Signalling Radio Bearer (SRB) for the control plane, the Data Radio Bearer (DRB) allowing point-to-point communication with one UE in the user plane (e.g., unicast), and the Multicast radio bearer (MRB) allowing point-to-point communication and point-to-multipoint communication with multiple UEs (e.g., multicast / broadcast), also in the user plane. Figure 2 is a block diagram of a UE device 205, like the UE 101 or UE 151 in the Figure 1, in which the present disclosure may be implemented according to one or more embodiments of the disclosure. The UE includes components for transmitting and receiving communications, for example including at least one of a UE communication manager 220, an I / O controller 255, a transceiver 235, a set of antennas 245, a storage device (e.g., memory) 225, and a processor (CPU: Central Processing Unit) 215. All these elements may communicate with each other. The memory 225 includes Random Access Memory (RAM), Read Only Memory (ROM), or a combination of both. Alternatively, or additionally, the memory 225 may comprise a mass storage device, such as a disk, or a Solid-State Drive (SSD). Basic Input Output System (BIOS) Instructions may be stored within the memory 225. The processor 215 is configured to execute machine readable instructions. Execution of these machine-readable instructions causes the UE to perform various functions. These functions may relate to transmission and / or interaction with peripheral devices like for instance a keyboard, a screen, a mouse, etc. (not shown in Figure 2). The processor may run an operating system, such as iOS, Windows, Android, etc. The processor 215 may be a single processor or may comprise two or more processors carrying out the processing required for the operation of the UE 205. The I / O controller 255 allows these interactions with external peripherals by providing the hardware required and by managing input and output signals. The I / O controller 255 may for example interact with all or part of an image capture device, an image rendering device, an audio capture device, an audio rendering device, or a sensor device able to determine the use position. The transceiver 235 is configured to provide bi-directional wireless communication with other wireless devices. For example, it provides the necessary modems (e.g., routers) and frequency shifters necessary to connect to one or more wireless networks, such as Wi-Fi, Bluetooth, LTE, 5G NR, etc. The transceiver 235 may comprise a PDCP transmitter and a PDCP receiver. The PDCP transmitter and the PDCP receiver may be implemented by the processor 215. The PDCP transmitter and the PDCP receiver may be a software only function implemented by the processor 215. The radio communications use the antenna set 245 adapted to the spectrum of the frequency transposed signals, issued from the baseband modems. The antenna set 245 may be limited to one antenna, but preferably it contains several antennas, in order to provide beamforming capability. The UE communication manager 220 controls the communication establishment of the UE to a radio access network (RAN). It may also be configured to control the control and release of the UE from the RAN. The UE regularly receives from the base station (e.g., gNB) an indication of the slots which are available for communication between the UE and the base station. Accordingly, the UE is able to determine when and at what frequency it should expect to receive incoming data (e.g., from the gNB). Further, the UE can identify when to send outgoing data, and at what frequency. The UE can determine the transmission / reception of data whether the data belongs to the control plane or the data plane. In one example implementation, the UE communication manager 220 implements the Uu interface. Figure 3 is a block diagram of a base station device 305, such as the gNBs 110 and 111 in the Figure 1, in which embodiments of the present disclosure may be implemented. The base station device 305 includes components for transmitting and receiving communications (e.g., to / from the UE). For example, the base station includes at least one of a base station communication manager 320, a core network communication manager 355, a transceiver 335, a set of antennas 345, memory 325, a processor (e.g., CPU) 315, and an inter-station communication manager 365. All these elements may communicate with each other. The base station communication manager 320 is configured to control the communications with a plurality of UEs. It is responsible for the establishment, control, and release of these communications. In an example implementation, the base station communication manager 320 implements the Uu interface. The base station communication manager 320 includes a scheduler that allocates time frequency slots to the different UE communications. Information regarding the schedule of these slots is regularly sent to the involved UEs. The core network communication manager 355 manages communications of the base station with the core network. It may provide a standardized NG interface, as defined by the 3GPP standard, to support these communications. The transceiver 335 is configured to provide bi-directional wireless communication with other wireless devices. These devices may be UEs, or even other base stations. The transceiver 335 provides the necessary modems and frequency shifters in order to connect to a large number of UEs simultaneously, using different frequency carriers, in Time Division Duplex (TDD) or in Frequency Division Duplex (FDD). The transceiver 335 may include a PDCP transmitter and a PDCP receiver. The PDCP transmitter and the PDCP receiver may be implemented by the processor 315. The PDCP transmitter and the PDCP receiver may be a software only functions implemented by the processor 315. The transceiver 335 is connected to the antenna set 345, which may be limited to one antenna, but preferably it contains several antennas, in order to provide beamforming capability. The memory 325 includes RAM, ROM, or a combination of both. Alternatively, or additionally, the memory 225 may comprise a mass storage device, such as a disk, or an SSD. BIOS instructions may be stored within the memory 325 to support an operating system. The inter-station communication manager 365 manages the communications with other base stations. The inter-station communication manager 365 may provide a standardized Xn interface (e.g., as defined by the 3GPP standard), to support these communications. Figure 4 is a block schematic diagram illustrating the data plane protocol stack of a 5G NR systems as represented in Figure 1. The data plane protocol stack is described in detail in 3GPP document TS 23.501. In the downlink direction, an application server 103 connects to the user plane function (UPF) 161 through a data network 160 at the level of PDU layer 402. The PDU layer corresponds to the PDUs carried between the UE and the data network (DN) over the PDU session. When the PDU session type is IPv4 or IPv6 or IPv4v6, the PDUs correspond to IPv4 packets, IPv6 packets, or both. When the PDU session type is Ethernet, the PUDs correspond to Ethernet frames; etc. At the start of a PDU session (i.e., at a PDU establishment time), the core network provides session QoS parameters to the UPF, gNB and UE. The PDU session QoS parameters includes the XR PDU set QoS parameters (S2-2302696): A. PDU Set delay budget (PSDB); B. PDU Set error rascte (PSER); and C. PDU Set integrated handling indication (PSIHI), which is also previously known as a PDU Set integrated indication. In the description relating to Figure 4, unless stated otherwise, a PDU refers to a packet which is handled (e.g., managed or processed) by the PDU layer 402. The other types of PDU are handled by the other layers. Accordingly, the PDUs belonging to one of the other layers (i.e., other than the PDU layer 402) is referred to herein with the prefix corresponding to the respective layer name, e.g., a PDCP PDU, or MAC PDU. When the PDUs arrive at the UPF PDU layer 402, the UPF performs an application packet inspection to determine the PDU Set boundaries. For example, 3GPP document S2-2302696 provides examples on how to identify PDU Sets when inspecting RTP / SRTP header, RTP header extension, H.264 RTP payload, H.265 RTP payload and H.266 RTP payload. PDU Set identification information as described in 3GPP document S2-2303842 is determined by the UPF and sent to the NG-RAN in the GTP-U header. The PDU Set identification Information comprises: A. a PDU Set sequence number; B. an indication of the end PDU of the PDU Set; C. a PDU sequence number within a PDU Set; D. a PDU Set size; and E. a PDU Set importance, which identifies the relative importance of a PDU Set compared to other PDU Sets within a QoS flow. During uplink the application is located on the UE. The UE obtains the PDU session QoS parameter from the core network when the PDU session is established (e.g., PDU session establishment procedure is defined in TS 23.502 clause 4.3.2.). When the PDU(s) generated by the application 403 arrive at UE PDU layer 402, the UE performs an application packet inspection to determine the PDU Set boundaries (similar to the procedure described above regarding the UPF). During both downlink and uplink, the application 103 sends and receives data to / from the NG-RAN through a GPRs tunnel (e.g., a GTP-U layer 404, as defined in TS 29.281). During downlink, the UPF detects the PDU Set identification information and obtains from the core network a set of mapping rules (e.g., filtering rules). The filtering rules define how each PDU Set is mapped to a QoS flow. The, or each, QoS flow is identified by an identifier, and the GTP-U PDUs are marked according to the determined QoS flow identifier. At the gNB, the relay layer 406 extracts PDU Set identification information and the QoS flow identifier from the GTP-U PDUs and maps them into the SDAP QoS flow(s). During an XR session (e.g., a single XR session), multiple PDU Sets can be mapped to the same QoS flow. Alternatively (or additionally), one or more PDU Sets may be mapped to different QoS flows. Then according to 3GPP document TR-38.835, in a first alternative arrangement, each SDAP QoS flow can be mapped to a different PDCP Data Radio Bearer (DRB). According to a second alternative arrangement, all of the SDAP QoS flows from the same XR session can be mapped to a PDCP DRB (e.g., a single PDCP DRB). During uplink, the UE detects the PDU Set identification information at the PDU layer 402, and obtains from the core network a set of mapping rules (e.g., filtering rules). The filtering rules define how each PDU Set is mapped to the QoS flow(s). The UE maps the XR PDUs to associated SDAP QoS flows according to the filtering rules. Similar to during downlink, during uplink multiple PDU Sets can be mapped to the same, or different, QoS flow(s) in an XR session (e.g., a single XR session). During downlink, the application layer 103 generates at least one application flow toward at least one UE (e.g., a single UE), for example one or more video flows and one or more audio flows. Then at the PDU layer 402, the application flows are arranged in PDU Sets. Each application flow is divided into multiple PDU Sets of the same, or different, types. Then, within the GTP-U layer 404, each PDU Set type is mapped onto the QoS flows, so multiple application flows can be multiplexed in a QoS flow (e.g., a single QOS flow). Alternatively, each application flow can be mapped to a different QoS flow. Further alternatively, it is also possible that an application flow is divided into multiple QoS flows. Then the SDAP layer 407 maps the QoS flows into DRBs, each DRB being handled (e.g., managed or processed) by a dedicated PDCP entity. As with the QoS flows, multiple application flows can be multiplexed in a single DRB. Alternatively, each application flow can be mapped to a different DRB. Further alternatively, it is also possible that an application flow (e.g., a single application flow) can be divided into multiple DRBs. During uplink, the application layer 403, generates at least one application flow towards the application server 103, for example one or more video flows, one or more audio flows, one or more sensing flow. Then at the PDU layer 402, the application flows are arranged in PDU Sets. At least one, or each, application flow is divided in multiple PDU Sets of same or different types and each PDU Set type is mapped on QoS flows, so multiple application flows can be multiplexed in one QoS flow, or each application flows can be mapped to different QoS. It is also possible that an application flow is divided into multiple QoS flows. Then the SDAP layer 407 maps the QoS flows into DRBs. At least one, or each, radio bearer is handled (e.g., managed or processed) by a dedicated PDCP entity. As for the QoS flow, multiple application flows can be multiplexed in one DRB (e.g., a single DRB), or each application flow can be mapped to separate DRBs. Further alternatively, it is possible that an application flow (e.g., a single application flow) is divided into multiple DRBs. Subsequently, at least one, or each, DRB is mapped to at least one RLC channel which in turn is mapped to at least one MAC logical channel (LCH). According to a known network configuration, for scheduling uplink traffic, the gNB MAC layer 410 is arranged to allocate radio resources to a UE (e.g., at least one or each UE) based on at least one of the following mechanisms: A. dynamic request scheduling issued by each UE (i.e., wherein the UE dynamically issues a request for radio resources); B. semi static scheduling by the gNB (i.e., wherein the gNB is configured to issue periodic resource allocation to at least one UE); C. buffer status reporting by at least one UE (i.e., wherein the UE generates a buffer status report (BSR) which indicates the amount of data available for uplink transmission); and D. Delay status reporting (DSR) by each UE indicating the amount of time critical data available for transmission. BSR operates on a Logical Channel Group (LCG) of the network, which group together a plurality of MAC logical channels (LCH). The BSR triggering conditions and formats, as defined in 3GPP document TS 38.321, are directed towards reporting available data that is ready for uplink transmission for each LCG. Some of the XR data may have a PSDB which must not be overrun because otherwise the data will become obsolete . In this situation, it is necessary for the scheduler to have knowledge of the amount of data that has a short period of time remaining (i.e., before the delay period elapses). For that purpose, the UE may send a DSR to the gNB when the remaining time is below a threshold value. DSR also operates on the LCG. The DSR triggering conditions and formats, as defined in 3GPP document TS 38.321, are directed towards reporting the amount of available data which has time remaining below a threshold value. Using the information provided by the UE (e.g., at least one of the scheduling request, configured scheduling, BSR, and DSR) the gNB can perform resource scheduling by sending uplink grant messages (e.g., a shedule) to the UE. The uplink grant can be addressed to each UE individually. Further, the allocated resources represent a radio slot identification that the UE can use for uplink data transmission. After receiving an uplink grant the UE assembles a transport block by multiplexing a plurality of MAC PDUs from different logical channels. The size of the transport block is configured to be consistent with the resources that have been allocated by the uplink grant. This procedure is called the logical channel prioritization (LCP), as described in TS 38.321, clause 5.4.3.1. LCP is performed in two steps. First, the UE performs channel selection by comparing the logical channel configuration with the uplink grant information (TS 38.321 clause 5.4.3.2.1). After this first step, the UE allocates resources among selected channels of the transport block (TS 38.321, clause 5.4.3.1.3). The resources may be allocated to match the uplink grant resources. For example, the resource allocation may be based on a predetermined criteria (e.g.., including priority, bucket size, and available data) in a simplified implementation of the well-known Weighted Fair Queuing (WFQ) scheduling algorithm. However, problems can arise when analysing the complete resource allocation mechanism. For example, a UE may send DSR information to the gNB when delay critical data is stored at the UE and needs urgent uplink grant transmission authorisation. However, after receiving the subsequent uplink grant information, the UE may not use the time criticality information to allocate the resources among the logical channels. As a result, data with low remaining time can be delayed due to other data (e.g., from an LCH with a higher priority status) being prioritised according to the LCP procedure. To address this issue, proposals have been made to modify the LCP procedure to account for the time criticality of the data associated with each logical channel of the UE. Such proposals result in resources that would have been allocated to a higher priority channel (e.g., a first, or high, priority channel) being diverted toward a channel of lower priority (e.g., a second, or low priority channel) having time critical data to transmit. Furthermore the LCP algorithm is specified to provide priority, fairness, and starvation avoidance, but this is functionality may be disrupted by applying these proposals. In particular, since the LCP algorithm’s ability to ensure fairness and starvation avoidance can no longer be guaranteed its performance will deteriorate over time. According to the present disclosure, there is provided a method for diverting resources which have been allocated to a higher priority channel toward a channel of lower priority having time critical data. Then, in a subsequent uplink grant, at least some of the previously allocated resources are returned back to higher priority channel. In this way, the global balance of the LCP algorithm is preserved while the lower priority time critical data can be sent on time. The LCP procedure described herein refers to the standard LCP procedure as defined in TS 38.321 version 18.0.0 (i.e., but excluding any future versions, e.g., version 19.0.0 and above). Figure 5 is a schematic diagram illustrating a UE of the communication network. The figure depicts a situation wherein a first uplink grant is issued by the LCP algorithm and time critical data is ready to be sent by the UE. The figure represents the UE at a given time T when an uplink grant is received. In this example, the UE has two logical channels LCH-j 501 and LCH-k 502. LCH-j is configured with a higher priority than that of LCH-k 502, and it handles data with no timing constraints. LCH-k is configured with a lower priority than LCH-j, and it handles time constrained data. Prior to time T, the data 503 handled by LCH-k became time critical. For example, prior to time T a DSR has been sent to the gNB reporting that an amount of data from LCH-k has a remaining time below a threshold value and are thus time critical. The reported amount of data in the DSR can be equal, or less than, the amount of available critical data at time T. Remaining time calculation as defined in TS 38.321 clause 5.4.9, is the smallest remaining value of the PDCP “discardTimers” among SDUs buffered for the LCG including LCH-k. The available data for both LCH-j 504 and LCH-k 503 is represented by the addition of two values, namely a bucket size value B and an overflow value O. The bucket size (e.g., as represented by the bucket size value B) is determined based on information contained within the uplink grant. For example, the bucket size can be calculated for a time period S based on two LCH configuration parameters (namely a Prioritized Bit Rate (PBR) and a Bucket Size Duration (BSD)) and a Physical Uplink Channel duration parameter. During the time period S the LCH is allowed a bucket size S*PBR . Accordingly, the bucket size S*PBR relates to data that is cumulated over time (e.g., with a maximum value of BSD*PUSCH duration which is calculated from the allocated transmission time). The uplink grant allows the UE to use certain radio resources from the Physical Uplink Shared Channel (PUSCH) during a limited amount of time (i.e., a PUSCH duration). Further details relating bucket size determination fare described in TS 38.321 clause 5.4.3. The overflow (e.g., as defined by the overflow value O) represents the rest of the available data if the amount of available data is greater than the bucket size at time T. At time T, upon receiving the uplink grant, the UE applies the LCP procedure in two steps. A first step includes the logical channel selection and a second step includes resource allocation among selected logical channels. During the logical channel selection step, the UE performs logical channel selection by comparing the configuration of at least one, or each, of the logical channels with the uplink grant information. This step is also called “scheduling restriction”. Only channels with configuration matching exactly the uplink grant information shall be selected. The uplink grant information includes at least one of: • a subcarrier spacing index; • a PUSCH transmission duration (e.g., used to calculate the maximum bucket size); • cell information; and • a priority index. The corresponding logical channel configuration includes at least one of: • allowedSCS-List, which sets the allowed Subcarrier Spacing(s) for transmission; • maxPUSCH-Duration, which sets the maximum PUSCH duration allowed for transmission; • allowedServingCells, which sets the allowed cell(s) for transmission; and • allowedPHY-Prioritylndex, which sets the allowed PHY priority index(es) of a dynamic grant for transmission. Other types of grant information and channel configurations may be used e.g., for simplicity, for a complete list, please refer to TS 38.321. After the logical channel selection step, the UE performs a transport block resources allocation among at least one of the logical channels. The total allocated resources are configured to match the uplink grant resources. The resource allocation is based on a predefined criteria (using a simplified implementation of the well-known “Weighted Fair Queuing” (WFQ) scheduling algorithm. The resource allocation criteria include a priority criterion (e.g., indicative of the priority status of the logical channel), a bucket size criterion (e.g., indicative amount of data that can be held within a particular bucket), and an available data criterion (e.g., indicative of the data available for transmission to the gNB). The WFQ scheduling algorithm includes the following steps: In a first method step, the UE selects a logical channel (or a plurality of channels) with a positive bucket size for the uplink grant. In a second method step, network resources are allocated to the selected logical channel(s) in a decreasing priority order, according to the following criteria: Firstly, the bucket size is decreased (e.g., decremented) by the total size of the MAC SDUs (e.g., for serving to the logical channel); and secondly, if any network resources remain then all the logical channels selected in the first method step are served in a strict decreasing priority order (e.g., regardless of the value of each bucket) until either the data for that logical channel or the uplink grant is exhausted, whichever comes first. Logical channels configured with equal priority should be served equally. For the unchanged LCP (i.e., as described in TS38.321), the resulting transport block 505 includes a first bucket B-j(t), which is the bucket of the higher priority channel. Subsequently, if any resources remain then bucket B-k(t) is included, which is the bucket of the lower priority logical channel. If any resources remain then overflow O-j(t), which is the overflow data of the higher priority channel is included. Finally, if resources still remain then overflow O-k(t), which is the overflow data of the higher priority channel is included in the transport block. The above-described example represents the ideal case where the granted uplink resources can accommodate all available data from both logical channels. Depending on the amount of granted network resources, at least part, or all, of the time-critical data may not be transmitted to the network. However, the global balance of the scheduling algorithm is maintained. For example, if the total allocated resources correspond to limit 509, then overflow O-k(t) is not transmitted. According to a first network resource allocation method fortransport block building (i.e., ALT1), an additional criterion representing time criticality is added to the first method step (i.e., logical channel selection). Firstly, the gNB adds time criticality information to the uplink grant. Then, the UE is configured to only select logical channel K for network resource allocation. The resulting transport block 506 includes a first bucket B-k(t), which is the bucket of the lower priority logical channel. Then, if further network resources remain, overflow O-k(t) is included, which is the overflow data of the higher priority channel. The above-described example shows the ideal case where the granted uplink resources match all available time critical data from the lower priority logical channel. Any additional granted resources would have been lost since non time-critical data cannot be sent because of the logical channel selection rules. Consequently, the non-time-critical data, including higher priority data, cannot be sent, and the global balance of the scheduling algorithm is compromised. According to an aspect of the disclosure, if a high priority channel is excluded at channel selection step on the basis of a new time criticality parameter, then the amount of data that would have been allocated to this channel on the basis of the unchanged LCP algorithm is saved for further compensation. In this way, the time-critical data can be transmitted before any other data whilst also providing for a more efficient restoration of the scheduling algorithm balance. For example, if the allocated resources correspond to limit 509, the UE records bucket B-j(t) as the amount of data to be further compensated for logical channel j (e.g., in response to the issuance of a subsequent uplink grant). According to this example, the overflow O-k(t) can be allocated resources instead of bucket B-j(t), whilst there are no resources left for overflow O-j(t). According to a second network resource allocation method (ALT2a), the logical channel selection step and the resource allocation steps remain unchanged (i.e., the LCP is as described in TS 38.321). The difference is that the priority of the logical channel k is changed (e.g., because of the presence of time critical data, or because a DSR related to this logical channel was sent earlier). At time T, the logical channel k becomes the higher (e.g., highest) priority channel. Thus, according to LCP rules, the resulting transport block (507) includes first bucket B-k(t), which is the bucket of the time critical channel. Subsequently, if resources remain bucket B-j(t) is included, which is the bucket of the high priority logical channel. Then, if resources remain overflow O-k(t), which is the overflow data of the time critical channel is included. Finally, if resources remain overflow O-j(t), which is the overflow data of the high priority channel, is included. This example shows the ideal case where the granted uplink resources can accommodate all available data from both channels. Depending on the amount of granted resources overfow O-k(t), which is the overflow part of the time critical data, might not be sent because buckets are served first, including the buckets of non-time critical data. Also, if the logical channel j is already the highest priority channel, then logical channels j and k would be at best equal priority and time critical data will not be prioritized. Nevertheless, since some non-time-critical data, including high priority data may not be sent, the global balance of the scheduling algorithm is compromised. According to aspects of the present disclosure, if some high priority data is not included in the transport block as a result of considering the time critical channel to be higher priority, then the amount of data that would have been allocated to this channel on the basis of unchanged LCP algorithm with no priority change, is saved for further compensation. This way the time critical data have some chance of being sent before some other data, and the provision to restore the scheduling algorithm balance in the future is maintained. For example, if the allocated resources correspond to limit 509, there are no amount of data to be further compensated, both B-j(t) and B-k(t) would have been transmitted according to the unchanged LCP algorithm. According to a third network resource allocation method (ALT2b), similar to ALT2a, the logical channel selection step and the resources allocation steps remain unchanged (i.e., the LCP is as described in TS 38.321). Also similar to ALT2a, the priority status of the logical channel k is changed (e.g., because of the presence of time-critical data, or because a DSR related to this logical channel was sent previously). At time T, the logical channel k becomes the higher (e.g., highest) priority channel. Also, for this alternative, the bucket size duration (BSD) of logical channel k is set to infinity (fe.g, because of the presence of time critical data, or because a DSR related to this logical channel was sent earlier). According to TS 38.321: “If the PBR of a logical channel is set to infinity, the MAC entity shall allocate resources for all the data that is available for transmission on the logical channel before meeting the PBR of the lower priority logical channel(s)”. Thus, according to LCP rules, the resulting transport block 508 includes first B-k(t), the bucket of the time critical channel; then, if resources remain, O-k(t), the overflow data of the time critical channel, then, if resources remain, bucket B-j(t), which is the bucket of the higher priority logical channel is included. Finally, if any network resources remain then overflow O-j(t), which is the overflow data of the high priority channel, is included in the transport block. The above-described example represents the ideal case where the granted uplink resources can accommodate all available data from both channels. Depending on the amount of granted resources, Bj(t) and O-j(t), of the high priority, non-time-critical data might not be sent. Since some non-time-critical data, including high priority data may not be sent, the global balance of the scheduling algorithm is compromised. If channels) and k are of equal priority after the priority of the logical channel k is changed, then the rule for choosing B-k(t) over B-j(t) is not defined (according to known allocation methods). In one example, B-k(t) is selected over B-j(t) based on a time criticality criterion. According to aspects of the present disclosure, if some high priority data is not included in the transport block as a result of considering the time critical channel to be higher priority with infinite bucket duration parameter, then the amount of data that would have been allocated to this channel on the basis of unchanged LCP algorithm with no priority or bucket parameter change, is recorded for further compensation. In this way, the time critical data get some chance to be sent before some other data, and provision to restore the scheduling algorithm balance in the future is maintained. For example, if the allocated resources correspond to limit 509, the UE records bucket B-j(t) as the amount of data to be further compensated for logical channel j. In this example, overflow O-k(t) has been allocated resources instead of bucket B-j(t). Furthermore, there are no resources left for overflow O-j(t). Figure 6 is a schematic diagram illustrating the LCP algorithm when receiving a subsequent uplink grant at time T+1. At time T, it is assumed in this example that bucket B-k(t) and overflow O-k(t) from the lower priority channel have been sent while bucket B-j(t) and overflow O-j(t) from higher priority channel have not been sent, as a result of the LCP modifications which are prescribed by at least one of the resource allocation methods ALT1, ALT2a, and ALT2b (as shown in Figure 5). In the time since the first uplink grant was issued (e.g., since time T), new data has been generated for both logical channels. Data B-k(t+1) and 0-k(t+1) 603 has been generated for lower priority logical channel k, and dataO-j(t+1) 607 has been generated for the higher priority logical channel j. It is noted that for any given time, only one bucket can exist (e.g., for a given logical channel). For example, in Figure 6 the higher priority channel includes bucket B-j(t) from the previous time period. For each of the above-described network allocation methods (i.e., ALT1, ALT2a, and ALT2b), nothing is defined for the subsequent uplink grants. So, the unchanged LCP procedure is applied in all cases. Consequently, the logical channel selection procedure will select both logical channels for resource allocation. The resulting transport block 605 includes bucket B-j(t), which is the previous bucket of the higher priority channel. If there are any network resources remaining then bucket B-k(t+1) is also included, which is the current bucket of the lower priority logical channel. If further network resources are available, then overflow O-j(t) is included, which is the previous overflow data of the higher priority channel. Then, if any network resources are available, overflow O-j (t+1) is included, which is the current overflow data of the higher priority channel. Finally, if any network resources remain then overflow 0-k(t+1) is included, which relates to the current overflow data of the higher priority channel. The above-described example shows the ideal case where the granted uplink resources can accommodate all available data from both channels. Depending on the amount of granted resources, at least part, or all overflow data from the higher priority channel cannot be sent and, the global balance of the scheduling algorithm cannot be maintained. For example, if the allocated resources correspond to limit 609, then overflow 0-j(t+1), which includes all the new data generated for LCH-j, cannot be sent in the present transport block. This then adds a scheduling cycle delay for the transmission of the new high priority data. According to the disclosure, both the time T, and the amount of data that would have been allocated to higher priority channel (i.e., and that was instead allocated to the lower priority LCH-k) are recorded. So, the LCP procedure for this subsequent uplink grant is changed so that resources allocated at time T+1 to LCH-k are instead redirected to LCH-j. The resulting transport block includes a first bucket B-j(t), which is the previous bucket of the higher priority channel. Then, if resources remain overflow O-j(t) is included, which is the previous overflow data of the higher priority channel. Subsequently, if resources remain then overflow O-j (t+1) is included, which is the current overflow data of the higher priority channel. Further, if resources remain then bucket B-k(t+1) is included, which is the current bucket of the lower priority logical channel. Finally, if resources remain then overflow 0-k(t+1), which is the current overflow data of the higher priority channel, is included in the transport block. The above-described example shows the ideal case where the granted uplink resources can accommodate all available data from both channels. Depending on the amount of granted resources, at least part, or all, of the available data from the higher priority channel be transmitted to the network, thereby restoring the scheduling algorithm balance. It may take several subsequent uplink grants to restore the balance, depending on the amount of uplink resources granted each time. For example, if the allocated resources correspond to limit 509, all data of LCH-j has been transmitted (i.e., both old and new data) and the algorithm balance is then restored thanks to resources that would have been allocated to LCH-k. Figure 7 is a flow chart of an example method 700 which is executed at the UE when receiving an uplink grant from the gNB. In a first method step 701 (as depicted in Figure ), upon reception of a first uplink grant from the gNB, the UE uses network resources initially allocated to transmit data associated with a first (e.g., higher priority) logical channel, to transmit data (e.g., time-critical data) associated with a second (e.g., lower priority) logical channel. Then, during method step 702 (as shown in Figure 6), upon the reception of a subsequent (e.g., second) uplink grant from the gNB, the UE uses network resources which at least partially compensate for the network resources that were previously allocated to the second (e.g., lower priority) logical channel (i.e., in response to the first schedule) to transmit data associated with the first (e.g., higher priority) logical channel. Optionally, the UE uses network resources associated with the second (e.g., lower priority) logical channel to transmit data associated with the first (e.g., higher priority) logical channel. The amount of network resources which are allocated from the second logical channel to the first logical step during the second method step 702 may be up to (e.g., equal to) those resources which were allocated from the first logical channel to the second logical channel during the first method step 701 (e.g., up to the resources used to transmit time-critical data from the second logical channel in response to receiving the first grant uplink). Alternatively, or additionally, the compensated network resources in method step 702 may be provided, at least partially, by the network. Figure 8 is a flow chart of an example method 800 which is executed at the UE. At a first method step, 801, an uplink grant is received from the gNB. Then at a second method step 802, the UE performs logical channel selection according to the unchanged LCP procedure. Among the selected channels, the UEs determines if at least one logical channel contains time-critical data. If time critical data is available among selected logical channels, the UE executes method step 803. If no time critical data is available among selected logical channels, then the UE determines if some higher priority logical channels need compensation from a previous scheduling decision (e.g., the non-null C-j-k, regardless of the j or k status). If the higher priority channel needs scheduling compensation, then the UE executes method step 805. If neither time critical data is available, nor scheduling compensation is needed then the UE continues with the unchanged LCP procedure during step 807. During method step 803, if time critical data cannot be sent entirely by following the unchanged LCP procedure, the UE then applies an LCP procedure change to allocate some resources from the higher priority logical channels to the time critical lower priority logical channel. The modifications to the resource allocation process can be defined by ALT1, ALT2a or ALT2b, as depicted in Figure 5. In embodiments, the method step 803 may include identifying (e.g., prior to the first uplink grant being received), that data associated with the lower priority logical channel is time-critical. An indication of the identified time-critical data may then be sent to the base station. During method step 804, the UE records the amount of data that would have been allocated to higher priority channels if the LCP procedure was unchanged. For example, this amount of data is added to a “Compensation for channel j and k” variable C-j-k (). Optionally, the method step 804 may comprise transmitting to the base station (e.g., after receiving the first uplink grant) an indication that the higher priority logical channel requires additional network resources. The base station may subsequently respond by allocating additional network resources to a subsequent uplink grant. During method step 805, the allocation of resources to a logical channel with non-null C-j-k variables is considered by priority levels, according to the following situations: According to a first situation, if the unchanged LCP allocation is sufficient to cover all available data from the logical channel j, then during step 805 the resources allocation continues unchanged and during step 806, C-j-k is set to 0. In this way, the gNB takes responsibility to compensate the resources lost by LCH-j by increasing accordingly the resources granted in the subsequent uplink grant According to a second situation, if the unchanged LCP allocation is not sufficient to cover all available data from the logical channel j, and If the unchanged LCP allocation covers some available data from the logical channel k then during step 805 resources allocated to LCH-k are directed to LCH-j up to covering all available data from LCH-j and during step 806, C-j-k is updated by an amount function of previous value of C-j-k, the amount of resources redirected from LCH-k to LCH-j, the remaining available data not sent from LCH-j (forexample C-j-k = C-j-k-amountof reallocated resources from LCH-kto LCH-j). In this way, resources lost by LCH-j at the first uplink grant is at least partially compensated by resources picked from LCH-k’s, and both gNB and UE can join to compensate the resources lost by LCH-j at first grant. According to a third situation, if the unchanged LCP allocation is not sufficient to cover all available data from the logical channel j, and if the unchanged LCP allocation does not allocate resources to the logical channel k, then during step 805 the resources allocation continues unchanged and during step 806, C-j-k is updated by an amount function of previous value of C-j-k and the remaining available data not sent from LCH-j (For example C-j-k = amount of remaining data not sent for LCH-j). In this way, resources compensation can be differed to a subsequent uplink grant. Alternatively, resource compensation can be “smoothed” along several uplink grants. According to aspects of the present disclosure, the method step 802 is configured so that, by default priority is given (firstly) to the time critical criterion 803, then (secondly) to the compensation criterion 805, and then (thirdly) to default criterion 807. In an alternative embodiment the priority for method step 802 is configurable (e.g., by the gNB) between the three alternative methods. In an alternative embodiment the priority for method step 802 is decided dynamically by the UE based for example on PDU Set importance (PSI) or based on the amount of critical data or based on the amount of compensation data. In yet another alternative embodiment, if both time critical data are available and scheduling compensation is required then steps 803 and 805 are both executed and then both steps 804 and 806. Whilst the present disclosure has been described with reference to examples and embodiments, it is to be understood that the disclosure is not limited to the disclosed examples and embodiments. It will be appreciated by those skilled in the art that various changes and modification might be made without departing from the scope of the disclosure, as defined in the appended claims. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and / or all of the steps of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and / or steps are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic series of equivalent or similar features. Unless otherwise defined herein, scientific and technical terms used in connection with the presently disclosed inventive concept(s) shall have the meanings that are commonly understood by those of ordinary skill in the art, and known techniques and procedures may be performed according to conventional methods well known in the art and as described in various general and more specific references that may be cited and discussed in the present specification. As used in this specification and claim(s), the words “comprising, “having,” “including,” or “containing” (and any forms thereof, such as “comprise” and “comprises,” “have” and “has,” “includes” and “include,” or “contains” and “contain,” respectively) are inclusive or open-ended and do not exclude additional, unrecited elements or method steps. The use of the term “a” or “an” in the claims and / or the specification may mean “one,” as well as “one or more,” “at least one,” and “one or more than one.” As such, the terms “a,” “an,” and “the,” as well as all singular terms, include plural referents unless the context clearly indicates otherwise. Likewise, plural terms shall include the singular unless otherwise required by context. The use of the term “or” in the present disclosure (including the claims) is used to mean an inclusive “and / or” unless explicitly indicated to refer to alternatives only or unless the alternatives are mutually exclusive. Unless otherwise explicitly stated as incompatible, or the physics or otherwise of the embodiments, examples, or claims prevent such a combination, the features of examples disclosed herein, and of the claims, may be integrated together in any suitable arrangement, especially ones where there is a beneficial effect in doing so. This is not limited to only any specified benefit, and instead may arise from an “ex post facto” benefit. This is to say that the combination of features is not limited by the described forms, particularly the form (e.g., numbering) of example(s), embodiment(s), or dependency of claim(s). In the preceding embodiments (i.e., exemplary arrangements), the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and / or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium. By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fibre optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fibre optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave may be included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are instead directed to non-transient, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, whilst discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

Claims

1. A method for managing data transmission within a communication network, the communication network comprising a base station for scheduling network resources for transmission of data by a user equipment of the communication network, the user equipment manages a first logical channel and a second logical channel with which data can be associated, the method at the user equipment comprising:transmitting, upon receipt of a first schedule from the base station, data associated with the second logical channel using network resources which would otherwise have been allocated to the first logical channel if the first schedule were to be followed; andtransmitting, upon receipt of a second schedule from the base station, data associated with the first logical channel using network resources which at least partially compensate for the network resources that were previously allocated to the second logical channel in response to the first schedule.

2. The method according to claim 1, wherein the transmission in response to the second schedule comprising using network resources which would otherwise have been allocated to the second logical channel if the second schedule were to be followed.

3. The method according to claim 2, wherein the allocation of network resources from the second logical channel to the first logical channel is at least partly determined based on the network resources which were previously allocated to the second logical channel in response to the first schedule.

4. The method according to claim 2 or claim 3, wherein the amount of network resources allocated to the first logical channel in response to the second schedule is up to the amount of network resources which were previously allocated to the second logical channel in response to the first schedule.

5. The method according to claim 4, wherein the amount of network resources allocated to the first logical channel in response to the second schedule is equal to the amount of network resources which were previously allocated to the second logical channel in response to the first schedule.

6. The method according to any one of claims 1 to 5, wherein the compensation of previously allocated network resources to the first logical channel is provided by the communication network.

7. The method according to any one of claims 1 to 6, wherein the compensation of previously allocated network resources to the first logical channel is performed in response to an identification that data associated with the first logical channel is time-critical.

8. The method according to claim 7, wherein the amount of network resources allocated to the first logical channel in response to the second schedule is up to the amount of network resources used for transmitting time-critical data in response to the first schedule.

9. The method according to any one of the preceding claims, wherein the first logical channel has a different priority status to that of the second logical channel.

10. The method according to claim 9, wherein the first logical channel has a higher priority status than the second logical channel.

11. The method according to claim 9 or claim 10, wherein the priority status of at least one of the first and second logical channels is configurable by the base station.

12. The method according to claim 9 or claim 10, wherein the priority status of at least one of the first and second logical channels is configurable by the user equipment.

13. The method according to claim 11 or claim 12, wherein the priority status is determined based on at least one of the following criteria:a PDU Set importance value;an amount of critical data; andan amount of compensation data.

14. The method according to any one of the preceding claims, wherein the compensation of previously allocated network resources to the first logical channel is stopped if the second logical channel includes time-critical data.

15. The method according to any one of the preceding claims, wherein the compensation of previously allocated network resources to the first logical channel is stopped if no networkresources were previously allocated from the first logical channel in response to the first schedule.

16. The method according to any one of the preceding claims, wherein the method comprises recording the amount of data transmitted by the network resources which are allocated to the second logical channel in response to the first schedule.

17. The method according to any one of the preceding claims, wherein the data transmitted in response to the second schedule is configured so that data associated with the first logical channel which was available at the time of the previous data transmission is prioritised over data which has become available since the previous data transmission.

18. The method according to any one of the preceding claims, wherein the data transmitted by the user equipment can include bucket data and / or overflow data, wherein the data transmission in response to the second schedule is configured so that overflow data associated with the first logical channel is prioritised over both bucket data and overflow data associated with second logical channel.

19. The method according to claim 18, wherein overflow data associated with the first logical channel which was available at the time of the previous data transmission is prioritised over both bucket data and overflow data associated with second logical channel.

20. The method according to claim 18 or claim 19, wherein overflow data associated with the first logical channel which has become available since the time of the previous data transmission is prioritised over both bucket data and overflow data associated with second logical channel.

21. The method according to any one of the preceding claims, wherein the method comprises identifying, prior to allocating network resources from the first logical channel to the second logical channel, that data associated with second logical channel is time-critical.

22. The method according to any one of the preceding claims, wherein the method comprises identifying, prior to the first schedule being received, that data associated with the second logical channel is time-critical.

23. The method according to any one of the preceding claims, wherein the method comprises transmitting to the base station, after receiving the first schedule, an indication that the first logical channel requires additional network resources.

24. The method according to any one of the preceding claims, wherein the method comprises transmitting to the base station, after receiving the first schedule, an indication that network resources which would otherwise have been allocated to the first logical channel are allocated to the second logical channel.

25. A method according to any one of the preceding claims, wherein the compensation of previously allocated network resources to the first logical channel is provided at least in part by the communication network and at least in part using network resources which would otherwise have been allocated to the second logical channel if the second schedule were to be followed.

26. A method for managing data transmission within a communication network, the communication network comprising a base station for scheduling network resources for transmission of data by a user equipment of the communication network, the user equipment manages a first logical channel and a second logical channel with which data can be associated, the method at the base station comprising:transmitting a first schedule to the user equipment and receiving data associated with the second logical channel using network resources which would otherwise have been allocated to the first logical channel if the first schedule were to be followed; andtransmitting a second schedule to the user equipment and receiving data associated with the first logical channel using network resources which at least partially compensate for the network resources that were previously allocated to the second logical channel in response to the first schedule.

27. The method according to claim 26, wherein the compensation of previously allocated network resources to the first logical channel is provided by the communication network28. The method according to claim 26 or claim 27, wherein the method comprises, upon receipt of an indication from the user equipment that the first logical channel requires additional network resources, configuring the second schedule to allocate additional resources to the user equipment.

29. The method according to claim 28, wherein the amount of additional resources allocated to the user equipment is based on the amount of network resources which were previously allocated to the second logical channel in response to the first schedule.

30. The method according to claim 29, wherein the method comprises configuring a third schedule to allocate additional resources to the user equipment.

31. A communication network which comprises at least one of a user equipment configured to perform the method of any one of claims 1 to 25 and a base station configured to perform the method of any one of claims 26 to 30.

32. A computer program comprising instructions, wherein, when the program is executed by a user equipment, the program causes the user equipment to perform the method according to any one of claims 1 to 25, and / or when the program is executed by a base station, the program causes the base station to perform the method according to any one of claims 26 to 30.

33. A computer-readable medium carrying a computer program according to claim 32.33

Images