Deadline-based data grouping

Abstract

Aspects of the present disclosure generally relate to wireless communications. In some aspects, a user equipment sends, to a network node, an indication of a data delivery deadline of data traffic to be delivered by the network node, where the data delivery deadline indicates when the network node is to send one or more data packets received from a UE; and / or a nominal time of arrival of the data traffic to be received at the network node, wherein the nominal time of arrival indicates when the network node is to transmit the one or more data packets received from the UE in combination with a nominal delay budget. Further, the UE sends the one or more data packets to the network node, the one or more data packets being able to include protocol data units (PDUs), PDU groups, or PDU sets or bursts.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of U.S. Non-Provisional Application No. 18 / 366,642, filed on August 9, 2023, entitled “DEADLINE-BASED DATA PACKETS,” and U.S. Provisional Application No. 63 / 370,911, filed on August 9, 2022, entitled “DEADLINE-BASED DATA PACKETS,” the disclosures of which are expressly incorporated herein by reference in their entirety. Technical Field

[0003] Aspects of the present disclosure relate generally to wireless communications, and to techniques and apparatus for deadline-based data packetization. Background Art

[0004] Wireless communication systems are widely deployed to provide a variety of telecommunication services, such as telephony, video, data, messaging, and broadcasting. Typical wireless communication systems may employ multiple access technologies that can support communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access technologies include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single carrier frequency division multiple access (SC-FDMA) systems, time division synchronous code division multiple access (TD-SCDMA) systems, and long term evolution (LTE). LTE / LTE-Advanced is a set of enhancements to the Universal Mobile Telecommunications System (UMTS) mobile standard promulgated by the Third Generation Partnership Project (3GPP).

[0005] A wireless network may include one or more base stations that support communications for a user equipment (UE) or multiple UEs. A UE may communicate with a base station via downlink communications and uplink communications. A "downlink" (or "DL") refers to the communication link from a base station to a UE, and an "uplink" (or "UL") refers to the communication link from a UE to a base station.

[0006] The above-mentioned multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that enables different UEs to communicate at a city, country, region and / or global level. New Radio (NR) (which may be referred to as 5G) is a set of enhancements to the LTE mobile standard promulgated by 3GPP. NR is designed to better support mobile broadband Internet access by: improving spectrum efficiency; reducing costs; improving services; utilizing new spectrum; and using orthogonal frequency division multiplexing (OFDM) (CP-OFDM) with cyclic prefix (CP) on the downlink, CP-OFDM and / or single carrier frequency division multiplexing (SC-FDM) (also known as discrete Fourier transform spread OFDM (DFT-s-OFDM)) on the uplink to better integrate with other open standards; and supporting beamforming, multiple input multiple output (MIMO) antenna technology and carrier aggregation. As the demand for mobile broadband access continues to increase, further improvements in LTE, NR and other radio access technologies remain useful. Summary of the invention

[0007] Some aspects described herein relate to a method of controlling data traffic to a network by a user equipment (UE). The method includes: sending an indication of at least one of the following to a network node: a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE; or a nominal arrival time of the data traffic to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send the one or more data packets received from the UE; and sending the one or more data packets to the network node.

[0008] Some aspects described herein relate to a user equipment (UE) for wireless communication. The user equipment may include one or more memories and one or more processors, the one or more processors being coupled to the one or more memories. The one or more processors, alone or in combination, may be configured to send an indication of at least one of the following to a network node: a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE; or a nominal arrival time for the data service to be received at the network node, wherein the nominal arrival time is combined with a nominal delay budget to indicate when the network node is to send the one or more data packets received from the UE. The one or more processors, alone or in combination, may be further configured to send the one or more data packets to the network node.

[0009] Some aspects described herein relate to one or more non-transitory computer-readable media storing, alone or in combination, sets of instructions for wireless communication. The set of instructions includes one or more instructions that, when executed, alone or in combination, by one or more processors of a user equipment (UE), cause the UE to: send to a network node an indication of at least one of the following: a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE; or a nominal arrival time for the data service to be received at the network node, wherein the nominal arrival time is combined with a nominal delay budget to indicate when the network node is to send the one or more data packets received from the UE. The set of instructions, when executed, alone or in combination, by one or more processors of the UE, may send the one or more data packets to the network node.

[0010] Some aspects described herein relate to a method for wireless communication performed by a network node. The method includes: receiving, by the network node, an indication of a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receiving, by the network node, the one or more data packets from the UE; and sending, by the network node, the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline.

[0011] Some aspects described herein relate to a network node for wireless communication. The network node includes: one or more memories; and one or more processors, the one or more processors, individually or in combination, coupled to the one or more memories and configured to: receive an indication of a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receive the one or more data packets from the UE; and send the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline.

[0012] Some aspects described herein relate to one or more non-transitory computer-readable media storing, alone or in combination, a set of instructions for wireless communication. The set of instructions includes one or more instructions that, when executed, alone or in combination, by one or more processors of a network node, cause the network node to: receive an indication of a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receive the one or more data packets from the UE; and send the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline.

[0013] Some aspects described herein relate to a method for wireless communication performed by a network node. The method includes: receiving, by the network node, an indication of a nominal arrival time of data traffic to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send one or more data packets received from a user equipment (UE); receiving, by the network node, the one or more data packets from the UE; and sending, by the network node, the one or more data packets from the UE at a first time between an actual arrival time of the one or more data packets from the UE and a second time based at least in part on the nominal arrival time and the nominal delay budget. In addition, in one aspect, the second time is the nominal arrival time added to the nominal delay budget.

[0014] Some aspects described herein relate to a network node for wireless communication. The network node includes: one or more memories; and one or more processors, the one or more processors coupled to the one or more memories and configured to: receive an indication of a nominal arrival time of data traffic to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send one or more data packets received from a user equipment (UE); receive the one or more data packets from the UE; and send the one or more data packets from the UE at a first time between an actual arrival time of the one or more data packets from the UE and a second time based at least in part on the nominal arrival time and the nominal delay budget.

[0015] Some aspects described herein relate to one or more non-transitory computer-readable media storing, alone or in combination, a set of instructions for wireless communication. The set of instructions includes one or more instructions that, when executed, alone or in combination, by one or more processors of a network node, cause the network node to: receive an indication of a nominal arrival time for data traffic to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send one or more data packets received from a user equipment (UE); receive the one or more data packets from the UE; and send the one or more data packets from the UE at a first time between an actual arrival time of the one or more data packets from the UE and a second time based at least in part on the nominal arrival time and the nominal delay budget.

[0016] Aspects generally include methods, apparatus, systems, computer program products, non-transitory computer-readable media, user equipment, base stations, wireless communication devices, and / or processing systems as substantially described herein with reference to and as illustrated by the accompanying drawings, descriptions, and appendices.

[0017] The features and technical advantages of examples according to the present disclosure have been outlined quite extensively above so that the following specific embodiments may be better understood. Additional features and advantages will be described below. The disclosed concepts and specific examples may be easily used as a basis for modifying or designing other structures for achieving the same purpose of the present disclosure. Such equivalent constructions do not depart from the scope of the appended claims. The characteristics of the concepts disclosed herein, both in terms of their organization and method of operation, and the associated advantages will be better understood by considering the following description in conjunction with the accompanying drawings. Each of the figures in the accompanying drawings is provided for the purpose of illustration and description and not as a definition of limitations to the claims.

[0018] Although various aspects are described in the present disclosure by illustrating some examples, it will be understood by those skilled in the art that such aspects can be implemented in many different arrangements and scenarios. The technology described herein can be implemented using different platform types, devices, systems, shapes, sizes and / or packaging arrangements. For example, some aspects can be implemented via integrated chip implementations or other devices based on non-module components (e.g., end-user devices, vehicles, communication equipment, computing equipment, industrial equipment, retail / shopping equipment, medical equipment and / or artificial intelligence devices). Various aspects can be implemented in chip-level components, modular components, non-modular components, non-chip-level components, device-level components and / or system-level components. The equipment incorporating the various aspects and features described may include additional components and features for implementing and practicing the various aspects claimed and described. For example, the transmission and reception of wireless signals may include one or more components for analog and digital purposes (e.g., hardware components, including antennas, radio frequency (RF) chains, power amplifiers, modulators, buffers, processors, interleavers, adders and / or summers). The various aspects described herein are intended to be practiced in various devices, components, systems, distributed arrangements and / or end-user devices of various sizes, shapes and configurations. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to be able to understand the above-mentioned features of the present disclosure in detail, a more specific description briefly summarized above may be obtained by reference to various aspects (some of which are illustrated in the accompanying drawings). However, it should be noted that the accompanying drawings only illustrate certain typical aspects of the present disclosure and are therefore not to be considered as limiting the scope thereof, as the specification may admit of other equally effective aspects. The same reference numerals in different drawings may identify the same or similar elements.

[0020] Figure 1 is a diagram illustrating an example of a wireless network according to the present disclosure.

[0021] Figure 2 is a diagram illustrating an example of a base station communicating with a user equipment (UE) in a wireless network according to the present disclosure.

[0022] Figure 3 is a diagram illustrating an example decomposed base station architecture according to the present disclosure.

[0023] Figure 4 is a diagram illustrating an example of jitter distribution according to the present disclosure.

[0024] Figure 5 is a diagram illustrating an example of a packet delay budget constraint for jitter-based communications according to the present disclosure.

[0025] Figures 6 to 9 is a diagram illustrating an example associated with data grouping based on a deadline according to the present disclosure.

[0026] Figure 10 to Figure 1 2 is a diagram illustrating an example process associated with deadline-based data grouping according to the present disclosure.

[0027] Fig.13 and Fig.14 is a diagram of an example apparatus for wireless communications according to the present disclosure.

[0028] Fig.15 is a diagram illustrating an example of an operation when a UE transmits a protocol data unit (PDU) earlier than expected.

[0029] Fig.16 is a diagram illustrating an example of an operation when a UE transmits a PDU later than expected.

[0030] Fig.17 is a diagram illustrating an example of an operation when a UE transmits a PDU.

[0031] Fig.18 is a diagram illustrating an example of an operation when a UE transmits a PDU earlier than expected.

[0032] Fig.19 is a diagram illustrating an example of an operation when a UE transmits a PDU later than expected.

[0033] Fig. 20 is a diagram illustrating an example of an operation when a UE transmits a PDU earlier than expected.

[0034] Fig.21 is a diagram illustrating an example of an operation when a UE transmits a PDU later than expected.

[0035] Fig. 22 is a diagram illustrating an example of a UE-indicated cutoff time for uplink.

[0036] Fig.23 is a diagram illustrating an example of a cutoff time indicated by a 5GC for an uplink.

[0037] Fig.24 is a diagram illustrating an example of a client-indicated deadline for an uplink.

[0038] Fig.25 is a diagram illustrating an example of a client-indicated deadline for an uplink.

[0039] Fig.26 is a diagram illustrating an example of capacity improvement using a cut-off time.

[0040] Fig. 27is a diagram illustrating an example 2700 of periodic downlink traffic with jitter according to the present disclosure, which includes capacity improvements compared to legacy PDBs.

[0041] Fig.28 is a diagram illustrating an example 2800 of periodic downlink traffic with jitter according to the present disclosure, showing improved UE power consumption compared to legacy PDB. DETAILED DESCRIPTION

[0042] The various aspects of the present disclosure are described more fully below with reference to the accompanying drawings. However, the present disclosure can be embodied in many different forms, and should not be interpreted as being limited to any specific structure or function presented throughout the present disclosure. Instead, these aspects are provided so that the present disclosure will be thorough and complete, and the protection scope of the present disclosure will be fully conveyed to those skilled in the art. It should be understood by those skilled in the art that the scope of the present disclosure is intended to cover any aspect of the disclosure disclosed herein, whether it is independently or in combination with any other aspect of the disclosure. For example, any number of aspects set forth herein may be used to implement a device or practice method. In addition, the scope of the present disclosure is intended to cover such a device or method that is practiced using other structures, functionality, or structure and functionality in addition to or different from the various aspects of the disclosure set forth herein. It should be understood that any aspect of the disclosure disclosed herein may be embodied by one or more elements of the present invention.

[0043] Several aspects of telecommunication systems will now be presented with reference to various devices and techniques. These devices and techniques will be described in the following detailed description and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively referred to as "elements"). These elements can be implemented using hardware, software, or a combination thereof. Whether these elements are implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system.

[0044] Although various aspects may be described herein using terms generally associated with 5G or new radio (NR) radio access technology (RAT), various aspects of the present disclosure may be applicable to other RATs, such as 3G RAT, 4G RAT and / or RATs beyond 5G (e.g., 6G).

[0045] Figure 11 is a diagram illustrating an example of a wireless network 100 according to the present disclosure. The wireless network 100 may be a 5G (e.g., NR) network and / or a 4G (e.g., Long Term Evolution (LTE)) network, or may include elements of a 5G (e.g., NR) network and / or elements of a 4G (e.g., Long Term Evolution (LTE)) network, etc. The wireless network 100 may include one or more base stations 110 (shown as BS110a, BS110b, BS110c, and BS110d), a user equipment (UE) 120 or multiple UEs 120 (shown as UE 120a, UE 120b, UE 120c, UE 120d, and UE 120e), and / or other network entities. The base station 110 is an entity that communicates with the UE 120. Base station 110 (sometimes referred to as BS) may include, for example, an NR base station, an LTE base station, a Node B, an eNodeB (eNB) (e.g., in 4G), a gNB (e.g., in 5G), an access point, and / or a transmit receive point (TRP). Each base station 110 may provide communication coverage for a particular geographic area. In the Third Generation Partnership Project (3GPP), the term "cell" may refer to a coverage area of ​​a base station 110 and / or a base station subsystem serving the coverage area, depending on the context in which the term is used.

[0046] The base station 110 may provide communication coverage for a macro cell, a pico cell, a femto cell, and / or another type of cell. A macro cell may cover a relatively large geographic area (e.g., a radius of several kilometers) and may allow unrestricted access by a UE 120 with a service subscription. A pico cell may cover a relatively small geographic area and may allow unrestricted access by a UE 120 with a service subscription. A femto cell may cover a relatively small geographic area (e.g., a home) and may allow restricted access by a UE 120 associated with the femto cell (e.g., a UE 120 in a closed subscriber group (CSG)). A base station 110 for a macro cell may be referred to as a macro base station. A base station 110 for a pico cell may be referred to as a pico base station. A base station 110 for a femto cell may be referred to as a femto base station or a home base station. In Figure 1 In the example shown in , BS 110a may be a macro base station for macro cell 102a, BS 110b may be a pico base station for pico cell 102b, and BS 110c may be a femto base station for femto cell 102c. A base station may support one or more (eg, three) cells.

[0047] In some examples, the cell may not necessarily be fixed, and the geographic area of ​​the cell may move according to the location of the mobile base station 110 (e.g., a mobile base station). In some examples, the base stations 110 may be interconnected with each other and / or to one or more other base stations 110 or network nodes (not shown) in the wireless network 100 using any suitable transport network through various types of backhaul interfaces (such as direct physical connections or virtual networks).

[0048] The wireless network 100 may include one or more relay stations. A relay station is an entity that can receive transmissions of data from an upstream station (e.g., a base station 110 or a UE 120) and transmit transmissions of data to a downstream station (e.g., a UE 120 or a base station 110). A relay station may be a UE 120 that is capable of relaying transmissions for other UEs 120. Figure 1 In the example shown in FIG. 1 , BS 110 d (eg, a relay base station) can communicate with BS 110 a (eg, a macro base station) and UE 120 d to facilitate communication between BS 110 a and UE 120 d. Base station 110 that relays communication may be referred to as a relay station, relay base station, relay, or the like.

[0049] The wireless network 100 may be a heterogeneous network that includes different types of base stations 110, such as macro base stations, pico base stations, femto base stations, relay base stations, etc. These different types of base stations 110 may have different transmit power levels, different coverage areas, and / or different impacts on interference in the wireless network 100. For example, a macro base station may have a high transmit power level (e.g., 5 watts to 40 watts), while a pico base station, a femto base station, and a relay base station may have a lower transmit power level (e.g., 0.1 watt to 2 watts).

[0050] The network controller 130 may be coupled to or in communication with a set of base stations 110 and may provide coordination and control for the base stations 110. The network controller 130 may communicate with the base stations 110 via a backhaul communication link. The base stations 110 may communicate directly with each other or indirectly with each other via a wireless or wired or combined backhaul communication link.

[0051] UE 120 may be dispersed throughout the wireless network 100, and each UE 120 may be stationary or mobile. UE 120 may include, for example, an access terminal, a terminal, a mobile station, and / or a subscriber unit. UE 120 may be a cellular phone (e.g., a smart phone), a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet computer, a tablet phone, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device, a biometric device, a wearable device (e.g., a smart watch, smart clothing, smart glasses, a smart headset (e.g., a virtual reality and / or augmented reality headset), a smart wristband, smart jewelry (e.g., a smart ring, a smart necklace, or a smart bracelet)), an entertainment device (e.g., a music device, a video device, and / or a satellite radio), a vehicle component or sensor, a smart meter / sensor, an industrial manufacturing equipment, a global positioning system device, and / or any other suitable device configured to communicate via one or more wireless media, either individually or in combination.

[0052] Some UEs 120 may be considered as machine type communication (MTC) or evolved or enhanced machine type communication (eMTC) UEs. MTC UEs and / or eMTC UEs may include, for example, robots, drones, remote devices, sensors, meters, monitors, and / or location tags that may communicate with a base station, another device (e.g., a remote device), or some other entity. Some UEs 120 may be considered as Internet of Things (IoT) devices and / or may be implemented as NB-IoT (narrowband IoT) devices. Some UEs 120 may be considered as customer premises equipment. UE 120 may be included inside a housing that houses components of UE 120, such as one or more processor components and / or one or more memory components. In some examples, one or more processor components and memory components may be coupled together. For example, one or more processor components (e.g., one or more processors) and one or more memory components (e.g., one or more memories) may be operationally coupled, communicatively coupled, electronically coupled, and / or electrically coupled.

[0053] In general, any number of wireless networks 100 may be deployed in a given geographic area. Each wireless network 100 may support a specific RAT and may operate on one or more frequencies. RAT may be referred to as a radio technology, air interface, etc. Frequency may be referred to as a carrier, frequency channel, etc. Each frequency may support a single RAT in a given geographic area to avoid interference between wireless networks of different RATs. In some cases, NR or 5G RAT networks may be deployed.

[0054] In some examples, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) may communicate directly (e.g., without using base station 110 as an intermediary to communicate with each other) using one or more side link channels. For example, UE 120 may communicate using peer-to-peer (P2P) communication, device-to-device (D2D) communication, vehicle-to-everything (V2X) protocols (e.g., which may include vehicle-to-vehicle (V2V) protocols, vehicle-to-infrastructure (V2I) protocols, or vehicle-to-pedestrian (V2P) protocols), and / or mesh networks. In such examples, UE 120 may perform scheduling operations, resource selection operations, and / or other operations described elsewhere herein as being performed by base station 110.

[0055] The devices of the wireless network 100 may communicate using an electromagnetic spectrum that may be subdivided into various categories, bands, channels, etc., based on frequency or wavelength. For example, the devices of the wireless network 100 may communicate using one or more operating bands. In 5G NR, two initial operating bands have been identified as frequency ranges designated FR1 (410 MHz-7.125 GHz) and FR2 (24.25 GHz-52.6 GHz). It should be understood that, although portions of FR1 are greater than 6 GHz, FR1 is often (interchangeably) referred to as the "below 6 GHz" band in various documents and articles. A similar naming problem sometimes occurs with respect to FR2, which is often (interchangeably) referred to as the "millimeter wave" band in various documents and articles, although different from the extremely high frequency (EHF) band (30 GHz-300 GHz) identified as the "millimeter wave" band by the International Telecommunication Union (ITU).

[0056] The frequencies between FR1 and FR2 are generally referred to as mid-band frequencies. Recent 5G NR research has identified the operating bands for these mid-band frequencies as frequency range designation FR3 (7.125GHz-24.25GHz). The bands falling within FR3 can inherit FR1 characteristics and / or FR2 characteristics, and therefore the features of FR1 and / or FR2 can be effectively extended to mid-band frequencies. In addition, currently higher frequency bands are being explored to extend 5G NR operation to more than 52.6GHz. For example, three higher operating bands have been identified as frequency range designation FR4a or FR4-1 (52.6GHz-71GHz), FR4 (52.6GHz-114.25GHz) and FR5 (114.25GHz-300GHz). Each of these higher frequency bands falls within the EHF band.

[0057] Considering the above examples, unless otherwise specifically stated, it should be understood that if the term "below 6 GHz" or the like is used herein, the term can broadly refer to frequencies that can be lower than 6 GHz, can be within FR1, and / or can include mid-band frequencies. In addition, unless otherwise specifically stated, it should be understood that if the term "millimeter wave" or the like is used herein, the term can broadly refer to frequencies that can include mid-band frequencies, can be within FR2, FR4, FR4-a or FR4-1 and / or FR5, and / or can be within the EHF band. It is contemplated that the frequencies included in these operating bands (e.g., FR1, FR2, FR3, FR4, FR4-a, FR4-1, and / or FR5) can be modified, and the techniques described herein are applicable to those modified frequency ranges.

[0058] In some aspects, UE 120 may include a communication manager 140. As described in more detail elsewhere herein, the communication manager 140 may send an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, and / or a nominal arrival time for data packets of a communication session to a network node; and receive the one or more data packets based at least in part on the one or more data packets arriving at or before the deadline. Additionally or alternatively, the communication manager 140 may perform one or more other operations described herein.

[0059] In some aspects, the network node may include a communication manager 150. As described in greater detail elsewhere herein, the communication manager 150 may receive an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, and / or a nominal arrival time associated with data packets for a communication session; and send the one or more data packets based at least in part on the one or more data packets being sent at or before the deadline. Additionally or alternatively, the communication manager 150 may perform one or more other operations described herein.

[0060] In some aspects, the terms "base station" (e.g., base station 110), "network node" and / or "network entity" may refer to an aggregated base station (e.g., a network node in conjunction with a base station). Fig. 9110) decomposed base station, integrated access and backhaul (IAB) node, relay node and / or one or more components thereof. For example, in some aspects, "base station", "network node" and / or "network entity" may refer to a central unit (CU), a distributed unit (DU), a radio unit (RU), a near real-time (near RT) RAN intelligent controller (RIC) or a non-real-time (non-RT) RIC or a combination thereof. In some aspects, the terms "base station", "network node" and / or "network entity" may refer to a device configured to perform one or more functions (such as those described herein in conjunction with base station 110). In some aspects, the terms "base station", "network node" and / or "network entity" may refer to multiple devices configured to perform one or more functions. For example, in some distributed systems, each of a plurality of different devices (which may be located in / at the same geographic location or in different geographic locations) may be configured to perform at least a portion of a function and / or repeatedly perform at least a portion of the function, and the terms "base station", "network node" and / or "network entity" may refer to any one or more of these different devices. In some aspects, the terms "base station", "network node" and / or "network entity" may refer to one or more virtual base stations and / or one or more virtual base station functions. For example, in some aspects, two or more base station functions may be instantiated and / or co-located at / in / on a single device. In some aspects, the terms "base station", "network node" and / or "network entity" may refer to one of the base station functions, but not another base station function. In this way, a single device may include more than one base station.

[0061] As indicated above, Figure 1 are provided as examples. Other examples can be found in the Figure 1 The described examples vary and may include some features, devices, and / or components while excluding, omitting, and / or not requiring other features, devices, and / or components.

[0062] Figure 2 2 is a diagram illustrating an example 200 of base station 110 communicating with UE 120 in wireless network 100 according to the present disclosure. Base station 110 may be equipped with a set of antennas 234a to 234t, such as T antennas (T≥1). UE 120 may be equipped with a set of antennas 252a to 252r, such as R antennas (R≥1).

[0063] At the base station 110, one or more transmit processors 220 may receive data intended for a UE 120 (or a set of UEs 120) from a data source 212, alone or in combination. The one or more transmit processors 220 may select one or more modulation and coding schemes (MCS) for the UE 120 based at least in part on one or more channel quality indicators (CQIs) received from the UE 120, alone or in combination. The base station 110 may process (e.g., encode and modulate) the data for the UE 120 based at least in part on the MCS selected for the UE 120, and may provide data symbols for the UE 120. The one or more transmit processors 220 may process system information (e.g., for semi-static resource partitioning information (SRPI)) and control information (e.g., CQI requests, grants, and / or upper layer signaling), alone or in combination, and provide overhead symbols and control symbols. One or more transmit processors 220 may generate reference symbols for reference signals (e.g., cell-specific reference signals (CRS) or demodulation reference signals (DMRS)) and synchronization signals (e.g., primary synchronization signals (PSS) or secondary synchronization signals (SSS)), either individually or in combination. One or more transmit (TX) multiple-input multiple-output (MIMO) processors 230 may perform spatial processing (e.g., pre-coding) on ​​data symbols, control symbols, overhead symbols, and / or reference symbols, either individually or in combination, where applicable, and may provide a set of output symbol streams (e.g., T output symbol streams) to a corresponding set of modems 232 (e.g., T modems) (shown as modems 232a to 232t). For example, each output symbol stream may be provided to a modulator component (shown as MOD) of the modem 232. Each modem 232 may process a corresponding output symbol stream (e.g., for OFDM) using a corresponding modulator component to obtain an output sample stream. Each modem 232 may also process (e.g., convert to analog, amplify, filter, and / or upconvert) the output sample stream using a corresponding modulator component to obtain a downlink signal. Modems 232a through 232t may transmit a set of downlink signals (e.g., T downlink signals) via a corresponding set of antennas 234 (e.g., T antennas) (shown as antennas 234a through 234t).

[0064] At the UE 120, a set of antennas 252 (shown as antennas 252a to 252r) may receive downlink signals from the base station 110 and / or other base stations 110, and a set of received signals (e.g., R received signals) may be provided to a set of modems 254 (e.g., R modems) (shown as modems 254a to 254r). For example, each received signal may be provided to a demodulator component (shown as DEMOD) of the modem 254. Each modem 254 may use a corresponding demodulator component to condition (e.g., filter, amplify, downconvert, and / or digitize) the received signal to obtain input samples. Each modem 254 may use a demodulator component to further process the input samples (e.g., for OFDM) to obtain received symbols. A MIMO detector 256 may obtain received symbols from the modem 254, may perform MIMO detection on the received symbols where applicable, and may provide detected symbols. One or more receive processors 258 may process (e.g., demodulate and decode) detected symbols, alone or in combination, may provide decoded data for UE 120 to data sink 260, and may provide decoded control information and system information to one or more controllers / processors 280. The term "controller / processor" may refer to one or more controllers, one or more processors, or a combination thereof. One or more channel processors may determine, alone or in combination, a reference signal received power (RSRP) parameter, a received signal strength indicator (RSSI) parameter, a reference signal received quality (RSRQ) parameter, and / or a CQI parameter, among other things. In some examples, one or more components of UE 120 may be included in housing 284.

[0065] The network controller 130 may include a communication unit 294, one or more controllers / processors 290, and one or more memories 292. The network controller 130 may include, for example, one or more devices in a core network. The network controller 130 may communicate with the base station 110 via the communication unit 294.

[0066] One or more antennas (e.g., antennas 234a to 234t and / or antennas 252a to 252r) may include or be included within one or more antenna panels, one or more antenna groups, one or more sets of antenna elements, and / or one or more antenna arrays, etc. Antenna panels, antenna groups, sets of antenna elements, and / or antenna arrays may include one or more antenna elements (in a single housing or multiple housings), sets of coplanar antenna elements, sets of non-coplanar antenna elements, and / or coupled to one or more transmit and / or receive components (such as antennas). Figure 2One or more antenna elements of one or more components).

[0067] On the uplink, at the UE 120, one or more transmit processors 264 may receive and process data from a data source 262 and control information from one or more controllers / processors 280 (e.g., for reports including RSRP, RSSI, RSRQ, and / or CQI), either alone or in combination. The one or more transmit processors 264 may generate reference symbols for one or more reference signals, either alone or in combination. Symbols from the one or more transmit processors 264 may be pre-decoded by one or more TX MIMO processors 266, either alone or in combination, where applicable, further processed by the modem 254 (e.g., for discrete Fourier transform spread OFDM (DFT-s-OFDM) or cyclic prefix (CP-OFDM)), and transmitted to the base station 110. In some examples, the modem 254 of the UE 120 may include a modulator and / or a demodulator. In some examples, the UE 120 includes a transceiver. In various examples, the transceiver may include any combination of an antenna 252, a modem 254, a MIMO detector 256, one or more receive processors 258, one or more transmit processors 264, and / or one or more TX MIMO processors 266. The transceiver may be used by one or more processors (e.g., one or more controllers / processors 280), alone or in combination, and one or more memories 282 to perform the operations described herein (e.g., with reference to Figures 6 to 13 ) any of the methods described herein and aspects of their various functions and / or operations.

[0068] At the base station 110, uplink signals from the UE 120 and / or other UEs may be received by the antenna 234, alone or in combination, processed by the modem 232 (e.g., a demodulator component (shown as DEMOD) of the modem 232), detected by the MIMO detector 236 where applicable, and further processed by one or more receive processors 238 to obtain decoded data and control information transmitted by the UE 120. The one or more receive processors 238 may provide the decoded data to the data sink 239 and the decoded control information to one or more controllers / processors 240, alone or in combination. The base station 110 may include a communication unit 244 and may communicate with the network controller 130 via the communication unit 244. The base station 110 may include a scheduler 246 to schedule one or more UEs 120 for downlink and / or uplink communications. In some examples, the modem 232 of the base station 110 may include a modulator and a demodulator. In some examples, the base station 110 includes a transceiver. The transceiver may include any combination of antenna 234, modem 232, MIMO detector 236, one or more receive processors 238, one or more transmit processors 220, and / or one or more TX MIMO processors 230. The transceiver may be used by one or more processors (e.g., one or more controllers / processors 240) and one or more memories 242 to execute the instructions described herein (e.g., reference 2 Figures 6 to 13 ) any of the methods described herein and aspects of their various functions and / or operations.

[0069] One or more controllers / processors 240 of base station 110, one or more controllers / processors 280 of UE 120, and / or Figure 2 Any other components of the may perform one or more techniques associated with deadline-based data grouping, as described in more detail elsewhere herein. In some aspects, the network node described herein is a base station 110, is included in a base station 110, or includes Figure 2 One or more components of the base station 110 are shown. For example, one or more controllers / processors 240 of the base station 110, one or more controllers / processors 280 of the UE 120, and / or Figure 2 Any other components of may perform or direct, alone or in combination, e.g. Fig.10 The process of 1000 Fig.11 Process 1100, Fig. 12A Process 1200A, Fig. 12BThe one or more memories 242 and the one or more memories 282 may store data and program codes for the base station 110 and the UE 120, respectively, either alone or in combination. In some examples, the one or more memories 242 and / or the one or more memories 282 may include, either alone or in combination, one or more non-transitory computer-readable media storing, either alone or in combination, one or more instructions (e.g., codes and / or program codes) for wireless communications. For example, the one or more instructions, when executed (e.g., directly, or after compilation, conversion, and / or interpretation) by one or more processors of the base station 110 and / or the UE 120, may cause the one or more processors, the UE 120, and / or the base station 110 to perform or direct, for example Fig.10 The process of 1000 Fig.11 Process 1100, Fig. 12A Process 1200A, Fig. 12B The process 1200B and / or the operations of other processes as described herein. In some examples, executing instructions may include running instructions, converting instructions, compiling instructions, and / or interpreting instructions, etc.

[0070] In some aspects, the UE 120 includes means for sending an indication of one or more of a deadline, periodicity, frequency, nominal packet delay budget, jitter of a burst arrival time, or a nominal arrival time for data packets of a communication session to a network node; and / or means for receiving the one or more data packets based at least in part on arrival of the one or more data packets at or before the deadline. Means for the UE to perform operations described herein may include, for example, one or more of the communications manager 140, antenna 252, modem 254, MIMO detector 256, one or more receive processors 258, one or more transmit processors 264, one or more TX MIMO processors 266, one or more controllers / processors 280, or one or more memories 282.

[0071] In some aspects, the network node includes means for receiving an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time associated with data packets for a communication session; and / or means for sending one or more data packets based at least in part on one or more data packets being sent at or before the deadline. In some aspects, means for the network node to perform operations described herein may include, for example, one or more of the communications manager 150, one or more transmit processors 220, one or more TX MIMO processors 230, a modem 232, an antenna 234, a MIMO detector 236, one or more receive processors 238, one or more controllers / processors 240, one or more memories 242, or a scheduler 246.

[0072] Although in Figure 2 Although the blocks in the flowchart are illustrated as different components, the functions described above with respect to these blocks may be implemented with a single hardware, software, or combined component or various combinations of components. For example, the functions described with respect to one or more transmit processors 264, one or more receive processors 258, and / or one or more TX MIMO processors 266 may be performed by or under the control of one or more controllers / processors 280.

[0073] As indicated above, Figure 2 are provided as examples. Other examples can be found in the Figure 2 The described examples vary and may include some features, devices, and / or components while excluding, omitting, and / or not requiring other features, devices, and / or components.

[0074] Figure 3 is a diagram illustrating an example 300 decomposed base station architecture according to the present disclosure.

[0075] The deployment of a communication system (such as a 5G NR system) can be arranged with various components or constituent parts in a variety of ways. In a 5G NR system or network, a network node, a network entity, a mobility element of a network, a RAN node, a core network node, a network element or a network equipment (such as a base station (BS, e.g., base station 110), or one or more units (or one or more components) performing base station functionality can be implemented in an aggregated or decomposed architecture. For example, a BS (such as a Node B (NB), an eNB, an NR BS, a 5G NB, an access node (AP), a TRP, a cell, etc.) can be implemented as an aggregated base station (also called a stand-alone BS or a monolithic BS) or a decomposed base station.

[0076] A converged base station may be configured to utilize a radio protocol stack physically or logically integrated within a single RAN node. A decomposed base station may be configured to utilize a protocol stack physically or logically distributed between two or more units, such as one or more central or CUs, one or more DUs, or one or more RUs. In some aspects, a CU may be implemented within a RAN node, and one or more DUs may be co-located with the CU, or alternatively, may be geographically or virtually distributed in one or more other RAN nodes. A DU may be implemented to communicate with one or more RUs. Each of a CU, a DU, and a RU may also be implemented as a virtual unit, i.e., a virtual centralized unit (VCU), a virtual distributed unit (VDU), or a virtual radio unit (VRU).

[0077] Base station type operations or network designs may take into account the aggregated nature of base station functionality. For example, a disaggregated base station may be used in an IAB network, an O-RAN (such as a network configuration sponsored by the O-RAN Alliance), or a virtualized radio access network (vRAN, also known as a cloud radio access network (C-RAN)). Decomposition may include distributing functionality across two or more units at various physical locations, as well as virtually distributing functionality of at least one unit, which may enable flexibility in network design. Individual units of a disaggregated base station or disaggregated RAN architecture may be configured for wired or wireless communication with at least one other unit.

[0078] Figure 3 The decomposed base station architecture shown may include one or more CUs 310 that may communicate directly with a core network 320 via a backhaul link, or indirectly with a core network 320 through one or more decomposed base station units, such as a near-RT RIC 325 via an E2 link, or a non-RT RIC 315 associated with a service management and orchestration (SMO) framework 305, or both. The CU 310 may communicate with one or more DUs 330 via corresponding midhaul links, such as an F1 interface. The DU 330 may communicate with one or more RUs 340 via corresponding fronthaul links. The RU 340 may communicate with corresponding UEs 120 via one or more RF access links. In some implementations, a UE 120 may be served simultaneously by multiple RUs 340.

[0079] Each of the units (e.g., CU 310, DU 330, RU 340) and the near-RT RIC 325, non-RT RIC 315, and SMO framework 305 may include one or more interfaces, or be coupled to one or more interfaces configured to receive or send signals, data, or information (collectively referred to as signals) via one or more wired or wireless transmission media, either individually or in combination. Each of the units or one or more associated processors or controllers that provide instructions to the communication interface of the unit, either individually or in combination, may be configured to communicate with one or more of the other units, either individually or in combination, via one or more transmission media. For example, a unit may include a wired interface that is configured to receive signals or send signals to one or more of the other units, either individually or in combination, via one or more wired transmission media. Additionally, a unit may include a wireless interface that may include a receiver, a transmitter, or a transceiver (such as an RF transceiver) that is configured to receive signals or send signals to one or more of the other units, either individually or in combination, via one or more wireless transmission media, or both.

[0080] In some aspects, CU 310 may host one or more higher layer control functions. Such control functions may include radio resource control (RRC), packet data convergence protocol (PDCP), or service data adaptation protocol (SDAP), etc. Each control function may be implemented using an interface configured to communicate signals with other control functions hosted by CU 310. CU 310 may be configured to handle user plane functionality (e.g., central unit-user plane (CU-UP)), control plane functionality (e.g., central unit-control plane (CU-CP)), or a combination thereof. In some specific implementations, CU 310 may be logically split into one or more CU-UP units and one or more CU-CP units. When implemented in an O-RAN configuration, the CU-UP unit may communicate bidirectionally with the CU-CP unit via an interface (such as an E1 interface). As needed, CU 310 may be implemented to communicate with DU 330 for network control and signaling.

[0081] DU 330 may correspond to a logical unit that includes one or more base station functions for controlling the operation of one or more RU 340. In some aspects, DU 330 may host one or more of the following depending at least in part on a functional split such as that defined by 3GPP: a radio link control (RLC) layer, a medium access control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, etc.). In some aspects, DU 330 may further host one or more low PHY layers. Each layer (or module) may be implemented using an interface that is configured to communicate signals with other layers (and modules) hosted by DU 330 or with control functions hosted by CU 310.

[0082] The lower layer functionality may be implemented by one or more RUs 340. In some deployments, a RU 340 controlled by a DU 330 may correspond to a logical node that hosts RF processing functions or low PHY layer functions (such as performing Fast Fourier Transform (FFT), Inverse FFT (iFFT), digital beamforming, physical random access channel (PRACH) extraction and filtering, etc.), or both, based at least in part on a functional split (such as a lower layer functional split). In such an architecture, the RU 340 may be implemented to handle over-the-air (OTA) communications with one or more UEs 120. In some implementations, real-time and non-real-time aspects of control plane and user plane communications with the RU 340 may be controlled by the corresponding DU 330. In some scenarios, this configuration may enable the implementation of the DU 330 and the CU 310 in a cloud-based RAN architecture (such as a vRAN architecture).

[0083] The SMO framework 305 may be configured to support RAN deployment and provisioning of non-virtualized network elements and virtualized network elements. For non-virtualized network elements, the SMO framework 305 may be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which may be managed via an operation and maintenance interface (such as an O1 interface). For virtualized network elements, the SMO framework 305 may be configured to interact with a cloud computing platform (such as an open cloud (O-Cloud) 335) to perform network element lifecycle management (such as instantiating virtualized network elements) via a cloud computing platform interface (such as an O2 interface). Such virtualized network elements may include, but are not limited to, CU 310, DU 330, RU 340, and near-RT RIC 325. In some specific implementations, the SMO framework 305 may communicate with hardware aspects of the 4G RAN (such as an open eNB (O-eNB) 311) via the O1 interface. Additionally, in some specific implementations, the SMO framework 305 may communicate directly with one or more RUs 340 via the O1 interface. The SMO framework 305 may also include a non-RT RIC 315 configured to support the functionality of the SMO framework 305 .

[0084] The non-RT RIC 315 may be configured to include logic functions that enable non-real-time control and optimization of RAN elements and resources, artificial intelligence / machine learning (AI / ML) workflows including model training and updating, or policy-based guidance of applications / features in the near-RT RIC 325. The non-RT RIC 315 may be coupled to or in communication with the near-RT RIC 325 (such as via an A1 interface). The near-RT RIC 325 may be configured to include logic functions that enable near-real-time control and optimization of RAN elements and resources via data collection and actions through an interface (such as via an E2 interface) that connects one or more CUs 310, one or more DUs 330, or both, and the O-eNB with the near-RT RIC 325.

[0085] In some implementations, in order to generate an AI / ML model to be deployed in the near-RT RIC 325, the non-RT RIC 315 may receive parameters or external enrichment information from an external server. Such information may be utilized by the near-RT RIC 325 and may be received from a non-network data source or from a network function at the SMO framework 305 or the non-RT RIC 315. In some examples, the non-RT RIC 315 or the near-RT RIC 325 may be configured to tune RAN behavior or performance. For example, the non-RT RIC 315 may monitor long-term trends and patterns of performance and employ AI / ML models to perform corrective actions through the SMO framework 305 (such as via reconfiguration of O1) or via the creation of RAN management policies (such as A1 policies).

[0086] As indicated above, Figure 3 are provided as examples. Other examples can be found in the Figure 3 The described examples vary and may include some features, devices, and / or components while excluding, omitting, and / or not requiring other features, devices, and / or components.

[0087] Figure 4 400 is a diagram illustrating an example of a jitter distribution according to the present disclosure. In some communications, data may be received quasi-periodically (i.e., with jittery periodicity). For example, a network (e.g., a network node, such as a core network (CN) network node and / or a RAN network node) may receive data that is typically periodic with an offset from a periodic nominal arrival time 405. The nominal arrival time 405 may be associated with a center of a burst arrival time distribution at a user plane function. The nominal arrival time 405 may have a periodicity and / or frequency based at least in part on a multimedia periodicity and / or frequency associated with the communication (e.g., a refresh rate of a video stream and / or extended reality (XR) communication, etc.).

[0088] As shown in example 400, some data may be received before a nominal arrival time 405 (e.g., early arrival data), and some data may be received after the nominal arrival time (e.g., late arrival data). In one example, for split XR communication (e.g., where the rendering process is performed by the UE and a network node such as an edge node), the jitter distribution may have a traffic arrival time gap of approximately 10 milliseconds (ms) in the downlink traffic arrival time.

[0089] The data may have jitter (e.g., an offset from a nominal arrival time 405) based at least in part on rendering time, encoder time, and / or Real-time Transport Protocol (RTP) packetization time at a device (e.g., an application server) that generates or forwards the data.

[0090] In some networks, XR downlink traffic may have quasi-periodic bursts (e.g., a collection of data packets associated with one or more scenarios) arriving at the network time. The jitter of the burst arrival time may be equal to about 48% of the XR periodicity (e.g., 8ms vs. 16.666ms). In this way, when using the packet delay budget (PDB) requirement, the jitter highly affects the overall XR system performance in terms of capacity and power consumption.

[0091] The XR client at the UE may have a de-jitter buffer that holds burst packets until the periodic timing for display. In some examples, the PDB requirement may indicate to the UE the expiration of a data packet that may be on time (e.g., where reception is a certain amount of time before the periodic timing for display to allow processing before display). In this case, the network node may discard data packets that could have been used to provide XR data to the UE. This may cause communication errors associated with the XR data, which may consume computing, power, communication, and / or network resources to detect and correct. Additionally or alternatively, communication errors may result in a communication configuration that reduces spectral efficiency based at least in part on the network node's attempt to correct and / or reduce errors.

[0092] As indicated above, Figure 4 are provided as examples. Other examples can be found in the Figure 4 The examples described are different.

[0093] Figure 5 is a diagram illustrating an example 500 of a packet delay budget constraint for jitter-based communications in accordance with the present disclosure.

[0094] like Figure 5 As shown, a burst 505A of data packets may be directed to the UE. The burst 505A may be Figure 5 510A relative to the nominal arrival time 510A. The nominal arrival time 510A may be associated with a periodic arrival time, and the burst 505A may be offset from the periodic arrival time by a jitter. However, the burst 505A may arrive at the nominal arrival time 510A with zero jitter.

[0095] The network may send a burst 505A, where reception at the UE is Figure 5505A. The amount of time between arrival at the network and receipt at the UE is latency 515A. The network may determine whether to send burst 505A based at least in part on whether latency 515A exceeds PDB 520A. PDB 520 indicates the amount of time the network can delay burst 505A after arriving at the network and before delivery to the UE. If PDB 520 is exceeded, the network may discard burst 505A and treat the data packets of burst 505A as expired. A PDB may be established for a communication session associated with a UE and may be a fixed amount of time from arrival at the network.

[0096] Based at least in part on latency 515A satisfying PDB 520A, the network sends burst 505A to the UE. From the UE's perspective, the UE must receive burst 505A at or before de-jitter buffer deadline 525A. De-jitter buffer deadline 525A may be based at least in part on display time and the amount of time required by the UE to process burst 505A before displaying a scene associated with burst 505A via a display of the UE.

[0097] BURST 505B is available in Figure 5 The burst 505B may arrive at the network at a time indicated relative to the nominal arrival time 510B. The burst 505B may arrive before the nominal arrival time 510B, where the jitter 530B has a negative value to indicate an arrival time before the nominal arrival time 510B.

[0098] The network may determine the UE's Figure 5 520B is outside of PDB 520B without sending burst 505B. For example, latency 515B may be greater than PDB 520. Even if expected reception at the UE is before de-jitter buffer deadline 525B associated with burst 505B, the network may discard burst 505B and consider data packets of burst 505B as expired.

[0099] BURST 505C is available in Figure 5 Burst 505C may arrive at the network at a time indicated relative to nominal arrival time 510C. Burst 505C may arrive after nominal arrival time 510C, with jitter 530C having a negative value to indicate an arrival time after nominal arrival time 510C.

[0100] The network may determine the UE's Figure 5 The network may send burst 505B and treat the data packets of burst 505B as timely. However, if the expected reception at the time indicated in FIG. 5 is within PDB 520C, the network may send burst 505C. For example, delay 515C may be less than PDB 520. The network may send burst 505B and treat the data packets of burst 505B as timely. Figure 5As shown, PDB 520C may extend beyond de-jitter buffer deadline 525C. In this case, the network may send burst 505C after de-jitter buffer deadline 525C based at least in part on PDB 520C indicating that burst 505C is timely. Sending burst 505C when data packets of burst 505C are due and will not be rendered for display by the UE may consume computing, power, communication, and / or network resources.

[0101] In some networks, the network may attempt to prevent the transmission of expired data to save computing, power, communication and / or network resources. In order to prevent the transmission of expired data, the network may configure the PDB to have a reduced duration to take into account the jitter of the data. For example, the network may reduce the duration of the PDB to prevent the jittered time amount and the duration of the PDB from extending past the jitter buffer cutoff time 525C from the nominal arrival time 510C. However, reducing the duration of the PDB may result in an increase in the number of discarded packets such as those of the burst 505B, which may have been received at the UE before the nominal arrival time 510B. Additionally or alternatively, the network may reduce the communication capacity to ensure that the PDB is met and packets are not discarded. However, this may reduce the number of devices that can be supported on the cell of the network.

[0102] In some aspects, a playout buffer may be included in the multimedia system. A receiver device (e.g., UE) may use a playout buffer to store incoming packets and process these packets at regular intervals for periodic display. Video frame packets (e.g., in data bursts) may be stored in the buffer until processing begins according to a deadline. An XR application may only require packets to be delivered before a deadline. Figure 5 In FIG. 5 , bursts 505A, 505B, and 505C each arrive before the deadline. Although burst 505B arrives with a latency greater than the PDB, from the application client's perspective, the situation is no worse. Therefore, compared to the PDB aspect where a reduced PDB reduces capacity, deadline delivery can allow for a relaxed latency budget for all bursts except the most recently arrived burst.

[0103] As indicated above, Figure 5 are provided as examples. Other examples can be found in the Figure 5 The examples described are different.

[0104] In some aspects described herein, a communication session may be associated with a deadline (e.g., a de-jitter buffer deadline) for receiving a data packet at a UE. In some aspects, the deadline may replace a PDB that may be configured for a data packet. Based at least in part on the use of the deadline, parameters for determining the expiration of a data packet and / or the prioritization of the transmission of a data packet may reflect the actual timing requirements of the data packet with improved accuracy. In this way, a network node may schedule the transmission of a data packet with improved efficiency without having to prioritize the data packet over other data packets with greater urgency. This may allow a network node to support additional devices in a cell operated by the network node, which may save computational, power, communication, and / or network resources that could otherwise be used to form and / or operate an additional cell for supporting additional devices.

[0105] In some aspects, the UE may determine the timing of the deadline. For example, the UE may determine the deadline (e.g., a de-jitter buffer deadline) based at least in part on a periodic display time (e.g., associated with a refresh rate of multimedia of a communication session) and a device internal data processing time (e.g., 3GPP protocol layer processing time + Internet Protocol (IP) packet processing time + video decoding time, etc.). In some aspects, the UE may use the longest processing time of the estimated device internal data processing times as a conservative estimate of the deadline. Additionally or alternatively, the UE may determine the deadline based at least in part on the periodic display time and an internal periodic timer for initiating video decoding.

[0106] The deadline can be associated with the packet generation timing adjustment (+ / -) of the phase-locked loop (PLL) at the application layer of the communication session between the application server and the application client at the UE. In this way, at the application layer, the deadline can be set to the nominal PDB + nominal arrival time to minimize the motion to rendering photon (M2R2P) delay.

[0107] Figure 6 6 is a diagram of an example 600 associated with data grouping based on a deadline according to the present disclosure. Figure 6 As shown, multiple network nodes may communicate with a UE (e.g., UE 120). The multiple network nodes may include one or more base stations 110, one or more CUs, one or more DUs, one or more RUs, one or more core network nodes, one or more network servers, one or more application servers, and / or one or more access and mobility management functions (AMFs), etc. In some aspects, the UE and the network nodes in the multiple network nodes (e.g., RAN network nodes) may be part of a wireless network (e.g., wireless network 100). The UE and the network nodes may be in a Figure 6 The operations shown are performed after a wireless connection has been established.

[0108] In some aspects (e.g., as part of establishing a wireless connection), a network node may send and a UE may receive configuration information. In some aspects, the UE may receive the configuration information via one or more of RRC signaling, one or more MAC control elements (CEs), and / or downlink control information (DCI), etc. In some aspects, the configuration information may include: an indication of one or more configuration parameters for selection by the UE (e.g., known to the UE and / or previously indicated by the first network node or another network device), and / or explicit configuration information for the UE to use to configure the UE, etc.

[0109] In some aspects, the configuration information may indicate that the UE is to communicate in a communication session with a deadline instead of a PDB. The configuration information may indicate that the UE is to provide an indication of the deadline and / or traffic mode information to the network node. In some aspects, the configuration information may indicate that the UE is to provide traffic mode information associated with the deadline (e.g., in addition to or in lieu of the deadline for use by the network node in deriving the deadline, etc.). In some aspects, the configuration information may indicate that the UE is to send an indication that a QoS flow of the communication session is associated with the deadline. In some aspects, the configuration information may indicate that the UE is to receive an indication that a QoS flow of the communication session is associated with the deadline.

[0110] The UE may configure itself based at least in part on the configuration information.In some aspects, the UE may be configured to perform one or more operations described herein based at least in part on the configuration information.

[0111] As shown in reference numeral 605, the UE, the network node, the CN network node and / or the application server may establish a QoS flow based on a deadline. For example, the UE, the network node, the CN network node and / or the application server may establish a connection and / or parameters for communicating via a communication session. In some aspects (e.g., as part of establishing a QoS flow), the network node may indicate to the UE that the QoS flow is associated with a deadline and is not associated with a PDB. In some aspects (e.g., as part of establishing a QoS flow), the UE may indicate to the network node that the QoS flow is associated with a deadline and is not associated with a PDB. In some aspects, the CN network node and / or the application server may indicate to the network node that the QoS flow is associated with a deadline, is not associated with a PDB, and / or the expiration of the data packet of the communication session is associated with a deadline and is not associated with a PDB. In some aspects, the network node may (e.g., to the UE) send an indication that the expiration of the data packet of the communication session is associated with a deadline and is not associated with a PDB.

[0112] In some aspects, the cutoff time is based at least in part on the periodic display time and the UE internal data processing time. For example, the cutoff time may be offset from the periodic display time by an amount equal to or greater than the UE internal data processing time. In some aspects, the periodic display time may be associated with the display of a scene of a video feed such as an XR video feed, etc.

[0113] In some aspects, the UE may receive (eg, as part of establishing a QoS flow) an indication of a mapping of the QoS flow to the IP flow. The mapping may be used to convert the IP flow to the QoS flow to indicate that the deadline applies to the QoS flow.

[0114] As indicated by reference numeral 610, the UE may receive information indicating a deadline and / or traffic pattern information for a QoS flow from an application client (e.g., an application client of the UE or an application client of a connected device, etc.) In some aspects, the information may indicate a deadline (e.g., a de-jitter buffer deadline), a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, and / or a nominal arrival time, etc., for data packets of a communication session.

[0115] In some aspects, the UE may identify a burst index for a data packet based at least in part on burst metadata available at an application layer of the data packet and / or a burst index determined based at least in part on a timing of the data packet. In some aspects, the deadline is periodic and the burst index is associated with a timing of the deadline.

[0116] As indicated by reference numeral 615, the UE may convert the deadline to the RAN time domain. For example, the UE may convert the deadline from a time relative to an application associated with the QoS flow or an absolute time to a RAN time domain unit, such as a subframe number and / or a time slot number, etc. In some aspects, the UE may convert the deadline to the RAN time domain, the process including converting the deadline from the application time domain to the RAN time domain based at least in part on: a deadline map associated with a quality of service (QoS) flow, one or more deadline notification messages, and / or one or more data radio bearer (DRB) QoS parameters associated with the deadline, etc. In some aspects, the UE may receive the deadline map, the deadline notification message, and / or the DRB QoS parameters during or after establishing the QoS flow as described in conjunction with reference numeral 605 and / or via an application client, etc.

[0117] As shown by reference numeral 620, the UE may identify the IP flow and / or QoS flow to which the cutoff applies. For example, the UE may know the IP flow associated with the cutoff based at least in part on the communication session and / or data packets being associated with the IP flow via the application client. In some aspects, the UE may use an IP flow to QoS flow mapping to identify the QoS flow with the IP flow. In some aspects, the UE may identify the IP flow to which the cutoff applies based at least in part on an indication of the IP flow via an application layer of the data packet and / or a logical channel identifier determined at least in part based on an IP packet index of the data packet in the IP flow, etc.

[0118] As indicated by reference numeral 625, the UE may send, and the network node may receive, an indication of a cutoff time and / or traffic pattern information (e.g., additional traffic pattern information) and / or an indication that a QoS flow is associated with a cutoff time. In some aspects, the traffic pattern information may include a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time for data packets of a communication session associated with the QoS flow. In some aspects, the cutoff time may include a converted cutoff time (e.g., converted from an application-based time or an absolute time to a RAN time, such as a subframe number and / or a timeslot number, etc.).

[0119] In some aspects, the UE may send additional or alternative information. For example, the UE may send an indication that a QoS flow or logical channel associated with the data packet is associated with the cutoff time, an indication of a burst index associated with the timing of the cutoff time, and / or an indication that a logical channel identifier associated with the data packet is associated with the cutoff time, etc.

[0120] In some aspects, the UE may receive an additional indication that the QoS flow or logical channel is configured with a cutoff time and send an indication that the QoS flow or logical channel associated with the data packet is associated with the cutoff time. For example, the network node may indicate that the QoS flow is a QoS flow based on the cutoff time. In some aspects, the network node may indicate that the network node is informed of the cutoff time based at least in part on receiving traffic pattern information and / or an indication of jitter for the QoS flow from a CN network node, an application server, and / or a UE, etc.

[0121] In some aspects, the UE may send an indication of one or more of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival time, or nominal arrival time for data packets of a communication session via an RRC message, a MAC CE, and / or an application layer indication, etc.

[0122] In some aspects, the UE may send an indication of the cutoff time and / or traffic pattern information to a CU of the network (e.g., a network node or a component of a network node). The CU may forward the cutoff time and / or traffic pattern information to a DU of the network (e.g., a network node or a component of a network node). In some aspects, the CU may use the traffic information to derive the cutoff time and may forward the cutoff time to the DU.

[0123] As indicated by reference numeral 630, the network node may receive, and the CN network node may provide, traffic pattern information and / or an indication of jitter associated with a QoS flow. In some aspects, the traffic pattern information may include periodicity, frequency, a nominal packet delay budget, jitter of burst arrival times, and / or a nominal arrival time of data packets for a communication session, etc. In some aspects, the network node may derive a cutoff time based at least in part on the traffic pattern information and / or jitter.

[0124] In some aspects, the network node may receive the traffic mode information from the CN network node as an alternative to receiving the traffic mode information from the UE. In some aspects, the network node may receive one or more information elements of the traffic mode information from the CN network node and one or more additional information elements of the traffic mode information from the UE.

[0125] In some aspects, the network node may receive an indication of jitter via a user plane header. For example, the network node may receive an indication of jitter in a general packet radio service (GPRS) tunneling protocol user plane (GTP-U) header. In some aspects, the jitter is based at least in part on the actual burst arrival network time and the nominal arrival time associated with the data packet. In this way, the jitter may indicate a deadline opportunity to which the data packet belongs. For example, positive jitter may indicate that the data packet may be approaching the deadline. Alternatively, negative jitter may indicate that the data packet is early and not approaching the deadline (e.g., if the data packet is approaching the deadline, a subsequent opportunity of the deadline is applied to the data packet).

[0126] As indicated by reference numeral 635, the network node may receive the data packet from the application server (eg, via the CN node). In some aspects, the data packet may be associated with a QoS flow and may be addressed to a UE.

[0127] As shown by reference numeral 640, the network node may identify the cut-off time and / or the burst group, and / or may discard the data packet. In some aspects, the network node may identify the cut-off time based at least in part on receiving an indication of the cut-off time or based at least in part on deriving the cut-off time using traffic pattern information received via the UE and / or CN network node, etc. In some aspects, the network node may identify the cut-off time based at least in part on one or more of the periodicity, frequency, nominal packet delay budget, jitter of the burst arrival time, and / or nominal arrival time of the data packet. For example, the network node may derive the cut-off time and / or may determine the timing of the cut-off time to be applied to the data packet.

[0128] In some aspects, the network node may identify a deadline opportunity associated with the data packet. For example, the deadline may be periodic such that a data packet received late for a first deadline opportunity may be received before a second deadline opportunity. The network node may first identify which deadline opportunity applies to the data packet, and then determine whether the data packet is timely (e.g., meets the deadline).

[0129] In some aspects, the network node may discard data packets based at least in part on failure to meet the deadline.For example, the network node may discard data packets that the network node cannot schedule for transmission to the UE before or at the deadline.

[0130] In some aspects, a network node may identify a deadline to apply to the data packets based at least in part on a burst group of the data packets. For example, a network node may group data packets into burst groups based at least in part on a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or an indication of a nominal arrival time for data packets of a communication session. For example, a network node may group data packets into groups associated with a deadline based at least in part on receiving the data packets within a threshold amount of time from the nominal arrival time and / or one or more deadlines (e.g., a previous deadline, a (current / active) deadline, and / or a subsequent deadline).

[0131] As shown by reference numeral 645, the UE may receive and the network node may send an indication of downlink resources for receiving data packets for the QoS flow, an indication of acceptance of the cutoff time, and / or an indication of the QoS or logical channel identification (LCID) associated with the cutoff time. In some aspects, the downlink resources may be based at least in part on an indication of the cutoff time, periodicity, frequency, nominal packet delay budget, jitter of burst arrival time, and / or nominal arrival time for the data packets of the communication session. For example, the network node may schedule downlink resources to meet the cutoff time. In this way, the network node may prioritize the data packets appropriately while allowing the sending of additional data packets that may have greater urgency.

[0132] In some aspects, a network node may send an indication that the network node accepts a deadline and / or one or more business pattern information elements, such as periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times of data packets for a communication session.

[0133] In some aspects, the network node may send to the UE an indication that a QoS flow or logical channel associated with the data packet is associated with a cutoff time, an indication of a burst index associated with the timing of the cutoff time, and / or an indication that an LCID associated with the data packet is associated with the cutoff time.

[0134] In some aspects, the network node may send an additional indication that the QoS flow or logical channel associated with the data packet is configured with a cutoff time based at least in part on receiving an indication that the QoS flow or logical channel is associated with a cutoff time. For example, the network node may confirm that the QoS flow is configured to use a cutoff time based at least in part on receiving an indication that the QoS flow is associated with a cutoff time (e.g., from a UE, an application server, and / or a CN network node, etc.).

[0135] In some aspects, in preparing and / or when determining to send a data packet, a network node may identify a QoS associated with the data packet, apply a cutoff time to the data packet based at least in part on the QoS flow being associated with the cutoff time, and / or apply periodic timing of the cutoff time to the data packet based at least in part on a time at which the network node receives the data packet or an indication of a burst number of data packets.

[0136] As indicated by reference numeral 650, the UE may receive, and the network node may send, data packets for the QoS flow. In some aspects, the UE may receive, and the network node may send, the data packets based at least in part on a reception time and / or an expected reception time of the data packets meeting a deadline (e.g., at or before the deadline).

[0137] Based at least in part on the use of the deadline, parameters used to determine the expiration of data packets and / or the prioritization of the transmission of data packets can reflect the actual timing requirements of the data packets with improved accuracy. In this way, the network node can schedule the transmission of data packets with improved efficiency without having to prioritize some data packets (e.g., associated with a particular data flow) over other data packets with greater urgency (e.g., associated with another data flow). This can allow the network node to support additional devices in a cell operated by the network node, which can save computing, power, communication and / or network resources that could otherwise be used to form and / or operate additional cells to support the additional devices.

[0138] As indicated above, Figure 6 are provided as examples. Other examples can be found in the Figure 6 The examples described are different.

[0139] Figure 7 is a diagram of an example 700 associated with deadline-based data grouping according to the present disclosure. Figure 7 As shown, a UE (e.g., UE 120) may communicate with a network (e.g., with one or more network nodes of the network). The network may include one or more base stations 110, one or more CUs, one or more DUs, one or more RUs, one or more core network nodes, one or more network servers, one or more application servers and / or one or more AMFs, etc. In some aspects, the UE and the network nodes in the plurality of network nodes (e.g., RAN network nodes) may be part of a wireless network (e.g., wireless network 100). The UE and the network nodes may be in a Figure 7 The operations shown are performed after a wireless connection has been established.

[0140] like Figure 7 As shown, a burst 705A of data packets may be directed to the UE. The burst 705A may be Figure 7 710A relative to the nominal arrival time 710A. The nominal arrival time 710A may be associated with a periodic arrival time from which the burst 705A may be offset by a jitter. However, the burst 705A may arrive at the nominal arrival time 710A with zero jitter.

[0141] The network may send a burst 705A, where reception at the UE is as follows: Figure 7The amount of time between arrival at the network and reception at the UE is latency 715A. Nominal PDB 720A may be the amount of time between nominal arrival time 710 and de-jitter buffer deadline 725A before or during which the network node may send burst 705A to the UE without failing to meet de-jitter buffer deadline 725A.

[0142] The network may determine whether to send burst 705A based at least in part on whether the network node can send burst 705A so that the UE receives burst 705A at or before de-jitter buffer deadline 725A. If de-jitter buffer deadline 725A is missed, the network may discard burst 705A and regard the data packets of burst 705A as expired.

[0143] Based at least in part on the latency 715A satisfying the de-jitter buffer deadline 725A, the network sends the burst 705A to the UE. From the UE's perspective, the UE must receive the burst 705A at or before the de-jitter buffer deadline 725A. In this way, the same deadline (e.g., the de-jitter buffer deadline 725A) is applied to the data packets at the network and at the UE. The de-jitter buffer deadline 725A may be based at least in part on the display time and the amount of time required by the UE to process the burst 705A before displaying the scene associated with the burst 705A via the UE's display.

[0144] BURST 705B is available in Figure 7 The burst 705B may arrive at the network at a time indicated relative to the nominal arrival time 710B. The burst 705B may arrive before the nominal arrival time 710B, where the jitter 730B has a negative value to indicate an arrival time before the nominal arrival time 710B.

[0145] The network may determine the UE's Figure 7 The expected reception at the time indicated in 705B is at or before the de-jitter buffer deadline 725B and / or the nominal PDB 720B and the burst 705B is sent. For example, even if the delay 715B is greater than the nominal PDB 720B, the delay 715B may not control whether the network node sends the data packet.

[0146] BURST 705C is available in Figure 7 The burst 705C may arrive at the network at a time indicated relative to the nominal arrival time 710C. The burst 705C may arrive after the nominal arrival time 710C, where the jitter 730C has a negative value to indicate an arrival time after the nominal arrival time 710C.

[0147] The network may determine the UE's Figure 7720C at or before the de-jitter buffer deadline 725C and / or the nominal PDB 720C. In some aspects, the network node may send the burst 705C with a relatively short latency 715C to meet the de-jitter buffer deadline 725C. For example, the network node may prioritize the burst 705C to send the burst 705C at or before the de-jitter buffer deadline 725C.

[0148] The nominal arrival time 710 is associated with a periodicity 735. The periodicity 735 may be based at least in part on an application associated with the data packet. For example, the periodicity 735 may be associated with a refresh rate of a video feed of a video to be displayed via the UE, which may be an XR video feed.

[0149] As indicated above, Figure 7 are provided as examples. Other examples can be found in the Figure 7 The examples described are different.

[0150] Figure 8 8 is a diagram of an example 800 associated with deadline-based data grouping according to the present disclosure. Figure 8 As shown, multiple network nodes may communicate with a UE (e.g., UE 120). The multiple network nodes may include one or more base stations 110, one or more CUs, one or more DUs, one or more RUs, one or more core network nodes, one or more network servers, one or more application servers, and / or one or more AMFs, etc. In some aspects, the UE and the network nodes in the multiple network nodes (e.g., RAN network nodes) may be part of a wireless network (e.g., wireless network 100). The UE and the network nodes may be in a Figure 8 The operations shown are performed after a wireless connection has been established.

[0151] As shown by reference numeral 805, a CN network node may establish a QoS flow based on a deadline. For example, a CN network node (e.g., a 5G core network) may set up a new "QoS flow with a deadline" in a protocol data unit (PDU) session. A QoS flow may define a deadline instead of a PDB.

[0152] For QoS flows with a cutoff time, the UE may define its own cutoff time by indicating the timing to the network node, or the cutoff time may eventually converge to the nominal arrival time + nominal PDB. In some aspects, the 5G QoS flow table may include a new information element indicating a packet delivery requirement of "cutoff time" instead of "PDB". For example, the cutoff time may be defined using PDU set design parameters such as ADB and AER.

[0153] In some aspects, the CN network node may decide which IP flow to set for a QoS flow with a deadline (e.g., using a policy control function (PCF) / session management function (SMF)). In some aspects, the CN network node may indicate to the network node during PDU session establishment which QoS flow to set for the deadline. In some aspects, the CN network node may utilize a non-access stratum (NAS) message to indicate to the UE which QoS flow to set for the deadline. Additionally or alternatively, the network node may utilize an RRC message to indicate to the UE which LCID to set for the deadline.

[0154] In some aspects, relevant information elements in the communication standard can be extended. For example, [CN to NAS] N11 / N2 interface + F1 / E1 interface (e.g., PDU session-QoS parameters); [CN to UE] NAS message (e.g., indicating QoS flow for deadline); and / or [gNB to UE] RRC message (e.g., indicating LCID for deadline).

[0155] As shown by reference numeral 810, the application client may provide and the UE may receive information indicating the deadline. In some aspects, the application client may provide the information indicating the deadline using an application layer indication (e.g., an X-layer application programming interface (API)). In some aspects, in example 800, the UE and / or application client may not need to indicate a burst index and / or a PDU set index. In some aspects, in example 800, the UE and / or application client may need to indicate a burst index and / or a PDU set index.

[0156] In some aspects, the application layer utilizes a Layer X API to indicate a deadline for an IP flow to a modem of a UE (eg, to translate an application deadline into a deadline understood by a network node).

[0157] The application client may indicate a specific timing of the UE internal clock for the deadline. The application client calculates the deadline based on the de-jitter buffer timing and converts the deadline to the UE clock timing. The clocks of the UE's modem and the application client may be different, so the application client may need to map (e.g., continuously or periodically) the UE clock timing and the application timing to compensate for clock drift.

[0158] The application client may indicate the burst index (or PDU set index) and / or the internal IP packet index to the UE. For example, the application client may indicate which burst index is associated with the deadline. If the burst metadata (or PDU set metadata) is available at the application layer, the application client may explicitly indicate the burst index to the UE. If the burst metadata is not available at the application layer, the application client may provide the IP packet index of the deadline, which may be assumed internally between the UE and the application client, and the UE may convert the IP packet index into a burst index (or PDU set index). The UE interface may be used to provide the burst metadata (or PDU set metadata) index to the UE, and the UE may need to maintain mapping information between the burst index (or PDU set index) and the IP packet index.

[0159] The application client may provide an indication of an IP flow or an internal IP packet index. For example, the application layer may indicate which IP flow (e.g., IP 5-tuple) is associated with the deadline. In another example, the application layer may provide an IP packet index, and the UE may convert the IP packet index into an associated LCID.

[0160] The application client may indicate the traffic mode and requirements. In some aspects, instead of an enhanced Tandem Switching Management Channel Interface (enhanced TSCAI or eTSCAI) (application server to network node), the application server may indicate the traffic mode and requirements (e.g., periodicity, frequency, nominal PDB, nominal arrival time, etc.) to the application client, and the UE may transmit all information related to the deadline to the network node.

[0161] As indicated by reference numeral 815, the UE may convert the deadline into the RAN time domain. In some aspects, the UE may convert the deadline using a deadline mapping with a QoS flow (e.g., an X-layer API). In some aspects, the UE may use a deadline notification message (e.g., a 3GPP-RRC message). In some aspects, the UE may use a DRB QoS parameter for the deadline (e.g., a deadline key performance indicator (KPI)).

[0162] In some aspects, the application layer does not know the information of the QoS flow, so the UE may need to provide an indication of the QoS flow to the network node. In some aspects, NAS messages are used to provide the UE with packet filters for the uplink direction, but packet filters for the downlink direction may not be provided to the UE. In some aspects, the network (e.g., a CN network node) may use NAS messages (mapping relationship between IP flows and QoS flows) to provide the UE with information on uplink and downlink packet filters. In some aspects, the network may indicate a packet filter with a service flow template (TFT) or a service data flow (SDF) template. For example, the network may indicate a packet filter that is typically composed of an IP 5-tuple = {source IP, destination IP, source port, destination port, protocol ID}. Based at least in part on the DL TFT, the UE converts the IP flow into a QoS flow.

[0163] As indicated by reference numeral 820, the UE may send, and the network node may receive, an indication of a cutoff time and / or traffic pattern information.

[0164] In some aspects, the UE may send an indication of the deadline and / or traffic mode information via an RRC message. For example, the UE may send a message with information elements indicating the deadline notification: deadline, burst index, and / or QoS flow or LCID.

[0165] In some aspects, a UE may have multiple flows, and thus the UE may need to specify which QoS flow has a deadline and / or which QoS flows are associated with which deadlines. In some aspects, for QoS mapping in the downlink direction, the CN SMF (e.g., at the NAS level) may indicate the mapping using IP flows to QoS flows (e.g., via packet filters, TFTs, or otherwise), the network node may use the SDAP layer (e.g., at the access layer level) to indicate QoS flows to DRBs (e.g., using n:1 mapping), and / or the network node may use the RLC layer to indicate DRBs to LCIDs (e.g., using 1:1 mapping).

[0166] In some aspects, the UE may use a MAC CE command or an RRC message to indicate a deadline for a burst and / or PDU set to a network node. For example, for a MAC CE command, the deadline is directly related to scheduling of the MAC layer (e.g., scheduling based on the deadline). Using the RRC message, the network node may utilize the RRC protocol to negotiate the timing of the deadline between the UE and the network node.

[0167] In some aspects, an indication of a deadline for a burst (e.g., a PDU set) may include one or more protocol information elements. For example, the indication may include a deadline (e.g., converted to a 5G system clock), a burst index (PDU set index), and / or a QoS flow or LCID. The deadline indication may indicate a specific timing of the deadline in the RAN system clock. For example, the UE converts the deadline timing indicated by the application client in the UE internal clock to the RAN system clock. For this conversion, the UE may require time synchronization between the application client and the UE. In some aspects, the time in the RAN system clock may include a subframe number (SFN) (e.g., the latest bit or partial bit), a subframe index (e.g., 10 bits, ms), and / or a time slot index. Additionally or alternatively, the time in the RAN system clock may include a SFN reference time (e.g., the latest bit or partial bit), a time difference between the SFN reference time and the deadline (e.g., ms (milliseconds) or microseconds)

[0168] The indication of the burst index (or PDU set index) may indicate which burst (or PDU set) has a specific timing of the deadline. If the application layer does not have an explicit burst index, the UE may convert the IP packet index into a burst index (or PDU set index).

[0169] The indication of a QoS flow or LCID may include the UE indicating which QoS flow has a cut-off time. For example, the UE may convert an IP flow indicated by an application client into a QoS flow. Additionally or alternatively, the UE may indicate which LCID has a cut-off time. In this way, the RAN may handle the cut-off time without any information from upper layers. However, all QoS flows in an LCID may have the same cut-off time requirement.

[0170] In some aspects, the network node may respond to the indication of the cutoff time and / or traffic pattern information with an indication of acceptance or rejection.In some aspects, the cutoff time provided by the individual UE may not be acceptable at the network node side, so the network node may negotiate the cutoff time with the UE.

[0171] If the deadline is not acceptable at the network node side, the network node may transmit a rejection message to the UE. In some aspects, the network node may provide the negotiated deadline to the UE. Additionally or alternatively, if the deadline is rejected, the UE may need to adjust the display timing of displaying the video via the UE's display based at least in part on the updated deadline.

[0172] In some aspects, the UE may send an indication of a deadline and / or a business mode to a CU (e.g., a network node or a component of a network node). The CU may provide an indication of a deadline and / or a business mode to the DU. In some aspects, the CU may indicate a deadline using a new DRB QoS parameter via an F1 interface (e.g., CU to DU). For example, the DU may indicate the use of an information flow to provide an indication, such as a UE context to a DRB to a QoS flow-level QoS parameter to a dynamic 5G QoS identifier (5QI) descriptor. In some aspects, the CU may utilize a dynamic descriptor to specify a deadline timing to the DU. In some aspects, the CU may mark and / or indicate that the QoS flow is associated with a deadline and indicate the deadline timing. In some aspects, the DU may transmit an acceptance or rejection message back to the CU.

[0173] As indicated by reference numeral 825, the network node may receive traffic mode information from the application server. For example, the network node may receive periodicity, frequency, and / or nominal PDB from the application server. In some aspects, the network node may use enhanced TSCAI to provide the nominal PDB, periodicity, and / or frequency to the network node (e.g., to provide application functionality to the network node). Alternatively, the UE may provide all traffic mode information to the network node.

[0174] In some aspects, the network node may determine the burst of data packets using implicit burst packet grouping for a deadline (e.g., for a deadline KPI). In some aspects, the network node may need to identify which IP packets belong to the nth burst (or PDU set). The UE may check the QoS flow of the packets so that the deadline is applied only to the relevant QoS flow. Based at least in part on the burst timing information (e.g., deadline, nominal PDB, periodicity, frequency), the network node may identify packets delivered within the following time period as part of the nth burst:

[0175] nth cutoff time - nominal PDB + n*periodicity + / -periodicity / 2

[0176] The Nth burst packet may need to be delivered within the nth deadline. For example, for the CN (user plane function) UPF solution, the CN UPF (e.g., the CN network node) uses the UPF to mark the burst packet. The CN UPF identifies the burst packet based at least in part on the packet arrival timing related to the UPF, and the CN UPF marks the burst in the GTP-U header. The CN UPF indicates the burst packet to the network node CU via the N3 (N3 frequency band) interface (e.g., using the GTP-U header). The network node CU indicates the burst packet to the network node DU via the F1-U interface (e.g., using the GTP-U header).

[0177] In some aspects, the network node may use PDCP to mark burst packets. The network node DU may identify burst packets based at least in part on the arrival timing of packets to the network node CU, and the DU or CU may mark the burst in the GTP-U header. The network node CU indicates the burst packets to the network node DU via the F1-U interface (e.g., using the GTP-U header).

[0178] In some aspects, the network node DU may self-identify burst packets using a MAC layer indication. The network node DU self-identifies burst packets based at least in part on packet arrival timing to the network node DU. The LCID indicates which packet flows are associated with a deadline.

[0179] As shown by reference numeral 830, the UE may receive and the network node may send an indication of downlink resources for receiving data packets of the QoS flow. In some aspects, the network node may schedule services (e.g., XR services) for the data packets based at least in part on the cutoff time. In some aspects, the network node may perform implicit burst packet grouping. For example, the network node may group the data packets into bursts based at least in part on the cutoff time, nominal PDB, frequency, and / or periodicity (e.g., cutoff time-nominal PDB+n*periodicity+ / -periodicity / 2).

[0180] In some aspects, the network node may schedule data packets arriving during [deadline - nominal PDB + n*periodicity + / - periodicity / 2] for transmission before the deadline + n*periodicity. In some aspects, the network node may use [3GPP - burst grouping] to implicitly group bursts of data packets for a deadline KPI (e.g., implicit burst grouping). In some aspects, data packets delivered within a periodicity and / or frequency are assumed to be a burst packet set.

[0181] As indicated above, Figure 8 are provided as examples. Other examples can be found in the Figure 8 The examples described are different.

[0182] Fig. 9 is a diagram of an example 900 associated with deadline-based data grouping according to the present disclosure. Fig. 9As shown, multiple network nodes may communicate with a UE (e.g., UE 120). The multiple network nodes may include one or more base stations 110, one or more CUs, one or more DUs, one or more RUs, one or more core network nodes, one or more network servers, one or more application servers, and / or one or more AMFs, etc. In some aspects, the UE and the network nodes in the multiple network nodes (e.g., RAN network nodes) may be part of a wireless network (e.g., wireless network 100). The UE and the network nodes may be in a Fig. 9 The operations shown are performed after a wireless connection has been established.

[0183] As shown in reference numeral 905, the CN network node and the network node may establish a QoS flow based on a deadline. For example, the CN network node (e.g., 5G core network) may set up a new "QoS flow with a deadline" in a PDU session. The QoS flow may define a deadline instead of a PDB.

[0184] For QoS flows with a cutoff time, the UE may define its own cutoff time by indicating the timing to the network node, or the cutoff time may eventually converge to the nominal arrival time + nominal PDB. In some aspects, the 5G QoS flow table may include a new information element indicating a packet delivery requirement of a "cutoff time" instead of a PDB. For example, the cutoff time may be defined using PDU set design parameters such as ADB and AER.

[0185] In some aspects, the CN network node may decide which IP flow to set for a QoS flow with a deadline (e.g., using PCF / SMF). In some aspects, the CN network node may indicate to the network node during PDU session establishment which QoS flow to set for the deadline. In some aspects, the CN network node may utilize NAS messages to indicate to the UE which QoS flow to set for the deadline. Additionally or alternatively, the network node may utilize RRC messages to indicate to the UE which LCID to set for the deadline.

[0186] In some aspects, relevant information elements in the communication standard can be extended. For example, [CN to NAS] N11 / N2 interface + F1 / E1 interface (e.g., PDU session-QoS parameters); [CN to UE] NAS message (e.g., indicating QoS flow for deadline); and / or [gNB to UE] RRC message (e.g., indicating LCID for deadline).

[0187] As shown by reference numeral 910, the CN network node may receive business mode information from an application server. For example, an application function of the application server may provide XR business mode information (e.g., periodicity, frequency, nominal PDB, nominal arrival time) to the CN network node. The application server may provide the XR business mode information using an Nx interface for sending an enhanced TSCAI or another message. Alternatively, the UE may provide the information to the network node. In some aspects, the CN network node and the network node may need to be synchronized to determine the deadline using the nominal arrival time.

[0188] As shown by reference numeral 915, the network node may receive an indication of jitter for the QoS flow. In some aspects, the CN network node (e.g., using a user plane function) may use metadata of the burst in the N3 / F1 interface to mark the jitter in the GTP-U header. For example, the GTP-U header may indicate jitter of the burst arrival time. In some aspects, the CN network node (e.g., UPF) may mark the jitter of the burst arrival time for each burst in the GTP-U header.

[0189] In some aspects, the CN UPF calculates the jitter of the burst arrival time and uses the jitter to mark the GTU-U header. In some aspects, the jitter of the burst arrival time = the actual burst arrival time - the nominal arrival time. The CN UPF can indicate the jitter of the burst arrival time to the network node CU via the N3 interface. The network node CU can indicate the jitter information to the network node DU via the F1 interface.

[0190] The indication may be a new information element "Jitter of Burst Arrival Time" in the GTU-U header (N3 / F1 interface). The CNUPF may provide the network node with the jitter of the burst arrival time of the current burst (or PDU set). In order to reduce the amount of information bits, the jitter may be digitized (e.g., mean square error (MSB) of the jitter amount). The GTP-U may be extended to employ an indication of a burst or PDU set (e.g., burst index, PDU set index), and the jitter information may be added on top of the indication of the burst or PDU set.

[0191] In some aspects, the methods and systems described herein are applicable to one or more PDUs and / or PDU sets. A PDU set may be a group of packets that carry a single information unit generated at the application layer.

[0192] In some aspects, the application server and the CN network node (eg, CN UPF) may need to be time synchronized to calculate jitter.

[0193] As indicated by reference numeral 920, the UE may receive, and the network node may send, an indication of downlink resources for receiving data packets for the QoS flow. In some aspects, the network node may use implicit burst packet grouping to correlate bursts with deadlines and / or timing of deadlines.

[0194] In some aspects, the network node may schedule downlink resources based at least in part on a cutoff time associated with a data packet. For example, a data packet arriving during [cutoff time - nominal PDB + n*periodicity + -periodicity / 2] should be delivered before the cutoff time + n*periodicity. Additionally or alternatively, the network node may perform implicit burst packet grouping based at least in part on the arrival time of the data packets.

[0195] As indicated above, Fig. 9 are provided as examples. Other examples can be found in the Fig. 9 The examples described are different.

[0196] Fig.10 is a diagram illustrating an example process 1000 performed, for example, by a UE in accordance with the present disclosure. Example process 1000 is an example in which a UE (eg, UE 120) performs operations associated with deadline-based data packetization.

[0197] like Fig.10 As shown, in some aspects, process 1000 may include sending an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time for data packets of a communication session to a network node (block 1010). For example, a UE (e.g., using communications manager 140 and / or Fig.13 The sending component 1304 depicted in can send an indication of one or more of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times for data packets of the communication session to the network node, as described above.

[0198] like Fig.10 As further shown, in some aspects, process 1000 may include receiving one or more data packets based at least in part on the one or more data packets arriving at or before the deadline (block 1020). For example, a UE (e.g., using communications manager 140 and / or Fig.13 The receiving component 1302 depicted in can receive the one or more data packets based at least in part on the one or more data packets arriving at or before the deadline, as described above.

[0199] Process 1000 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.

[0200] In a first aspect, process 1000 includes receiving information from an application client at the UE indicating the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of burst arrival times, or the nominal arrival time of data packets of the communication session.

[0201] In a second aspect, alone or in combination with the first aspect, process 1000 includes converting the cutoff time into a radio access network (RAN) time domain to create a converted cutoff time, the cutoff time indicated by the indication being the converted cutoff time.

[0202] In a third aspect, either alone or in combination with one or more of the first and second aspects, converting the deadline to the RAN time domain comprises converting the deadline from the application time domain to the RAN time domain based at least in part on one or more of the following: a deadline mapping associated with a QoS flow, one or more deadline notification messages, or one or more DRB QoS parameters associated with the deadline.

[0203] In a fourth aspect, either alone or in combination with one or more of aspects 1 to 3, process 1000 comprises identifying a burst index for the data packets based at least in part on one or more of: burst metadata available at an application layer of the data packets or a burst index determined at least in part based on the timing of the data packets, wherein the deadline is a periodic deadline, and wherein the burst index is associated with the timing of the deadline.

[0204] In a fifth aspect, either alone or in combination with one or more of aspects 1 to 4, process 1000 includes identifying an IP flow to which the deadline applies, the IP flow being associated with the data packets (e.g., the UE receives the data packets via the IP flow) and being identified based at least in part on one or more of: an indication of the IP flow via an application layer of the data packets or a logical channel identifier determined at least in part based on an IP packet index of the data packets.

[0205] In a sixth aspect, either alone or in combination with one or more of the first to fifth aspects, process 1000 includes converting the IP flow into a QoS flow to which the deadline applies.

[0206] In a seventh aspect, either alone or in combination with one or more of aspects 1 to 6, process 1000 comprises sending one or more of an indication of a QoS flow or logical channel associated with the data packets and associated with the cut-off time, an indication of a burst index associated with the timing of the cut-off time, or an indication of a logical channel identifier associated with the data packets and associated with the cut-off time.

[0207] In an eighth aspect, either alone or in combination with one or more of aspects 1 to 7, process 1000 comprises receiving an additional indication that the QoS flow or the logical channel is configured with the deadline, and sending an indication that the QoS flow or the logical channel associated with these data packets is associated with the deadline.

[0208] In a ninth aspect, either alone or in combination with one or more of aspects one to eight, process 1000 comprises receiving an indication that expiration of the data packets for the communication session is associated with the deadline and is not associated with a packet delay budget, or sending an indication that expiration of the data packets for the communication session is associated with the deadline and is not associated with a packet delay budget.

[0209] In a tenth aspect, either alone or in combination with one or more of aspects one to nine, process 1000 comprises receiving an indication of acceptance of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time for data packets of the communication session.

[0210] In the eleventh aspect, alone or in combination with one or more of the first to tenth aspects, sending the indication of one or more of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time for data packets of the communication session includes sending the indication via an RRC message, sending the indication via MAC-CE, or sending the indication via an application layer indication.

[0211] In a twelfth aspect, alone or in combination with one or more of the first to eleventh aspects, the deadline is associated with a periodic display time and a UE internal data processing time.

[0212] In a thirteenth aspect, alone or in combination with one or more of aspects one to twelfth, process 1000 includes receiving an indication of downlink resources for receiving the data packets, the downlink resources being based at least in part on the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the indication of the nominal arrival time for the data packets of the communication session, wherein the data packets are received based on the downlink resources.

[0213] In a fourteenth aspect, alone or in combination with one or more of aspects one to thirteen, process 1000 includes receiving an indication of a mapping of QoS flows to IP flows, wherein sending the indication of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time includes sending additional indications of the QoS flows associated with the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time based at least in part on the mapping of the QoS flows to the IP flows.

[0214] although Fig.10 An example block diagram of process 1000 is shown, but in some aspects, process 1000 may include Fig.10 Additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in the process 1000. Additionally or alternatively, two or more of the blocks in the process 1000 may be performed in parallel.

[0215] Fig.11 is a diagram illustrating an example process 1100 performed, for example, by a network node according to the present disclosure. The example process 1100 is an example in which a network node (eg, a base station, a CU, a DU, and / or a RU) performs operations associated with deadline-based data packetization.

[0216] like Fig.11 As shown, in some aspects, process 1100 may include receiving an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time associated with data packets of a communication session (block 1110). For example, a network node (e.g., using communication manager 150 and / or Fig.14 The receiving component 1402 depicted in can receive an indication of one or more of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times associated with data packets of a communication session, as described above.

[0217] like Fig.11 As further shown, in some aspects, process 1100 may include sending the one or more data packets based at least in part on the one or more data packets being sent at or before the deadline (block 1120). For example, a network node (e.g., using communication manager 150 and / or Fig.14 The sending component 1404 depicted in can send the one or more data packets based at least in part on the one or more data packets being sent at or before the deadline, as described above.

[0218] Process 1100 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.

[0219] In a first aspect, receiving the indication comprises one or more of: receiving information indicating one or more of the deadline, the periodicity, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time of the data packets of the communication session from a UE associated with the data packets; or receiving information indicating one or more of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time of the data packets of the communication session from an application server associated with the data packets.

[0220] In a second aspect, either alone or in combination with the first aspect, receiving the indication of one or more of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time for data packets of the communication session comprises receiving the indication via an RRC message, receiving the indication via a MAC-CE, or receiving the indication via an application layer indication.

[0221] In a third aspect, alone or in combination with one or more of the first and second aspects, the cut-off time is associated with a periodic display time and a UE internal data processing time.

[0222] In a fourth aspect, either alone or in combination with one or more of aspects 1 to 3, process 1100 comprises sending an indication of downlink resources for receiving these data packets, the downlink resources being based at least in part on the deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival time or indication of the nominal arrival time for data packets of the communication session, wherein the data packets are received by a receiving device at least in part based on these downlink resources.

[0223] In a fifth aspect, either alone or in combination with one or more of aspects 1 to 4, process 1100 comprises grouping data packets into burst groups based at least in part on the deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival time, or an indication of the nominal arrival time of the data packets for the communication session.

[0224] In a sixth aspect, either alone or in combination with one or more of aspects 1 to 5, process 1100 includes receiving one or more of an indication of a QoS flow or logical channel associated with the data packets and associated with the cutoff time, an indication of a burst index associated with the timing of the cutoff time, or an indication of a logical channel identifier associated with the data packets and associated with the cutoff time.

[0225] In a seventh aspect, either alone or in combination with one or more of aspects 1 to 6, process 1100 comprises sending an additional indication that the QoS flow or the logical channel associated with the data packets is configured with the cut-off time based at least in part on receiving the indication that the QoS flow or the logical channel associated with the cut-off time is associated with the cut-off time.

[0226] In an eighth aspect, either alone or in combination with one or more of aspects one to seven, process 1100 includes sending an indication of a mapping of a QoS flow to an IP flow for converting the IP flow to which the deadline applies into the QoS flow to which the deadline applies.

[0227] In a ninth aspect, either alone or in combination with one or more of aspects one to eight, process 1100 comprises sending an indication of acceptance of the deadline, the periodicity, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time for data packets of the communication session.

[0228] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, receiving the indication of the deadline comprises receiving the indication of the deadline via a centralized unit, and wherein the network node comprises a distributed unit.

[0229] In an eleventh aspect, alone or in combination with one or more of aspects one to ten, sending the one or more data packets comprises: identifying a QoS flow associated with the data packets; applying the cutoff time to the data packets based at least in part on the QoS flow being associated with the cutoff time; and applying the cutoff time to the data packets at a periodic timing based at least in part on a time at which the network node receives the data packets or an indication of a burst quantity of the data packets.

[0230] In a twelfth aspect, alone or in combination with one or more of the first to eleventh aspects, receiving the jitter of burst arrival times comprises receiving an indication of the jitter of burst arrival times in a user plane header.

[0231] In a thirteenth aspect, alone or in combination with one or more of the first to twelfth aspects, the jitter of the burst arrival time is based at least in part on an actual burst arrival time and a nominal arrival time.

[0232] In a fourteenth aspect, either alone or in combination with one or more of aspects one to thirteen, process 1100 comprises receiving an indication that expiration of the data packets for the communication session is associated with the deadline and is not associated with a packet delay budget, or sending an indication that expiration of the data packets for the communication session is associated with the deadline and is not associated with a packet delay budget.

[0233] In a fifteenth aspect, either alone or in combination with one or more of the first to fourteenth aspects, process 1100 includes discarding the one or more additional data packets based at least in part on a failure of the one or more additional data packets to meet the deadline.

[0234] In a sixteenth aspect, either alone or in combination with one or more of aspects one to fifteen, process 1100 comprises identifying the cutoff time based at least in part on one or more of the periodicity of the data packets, the frequency, the nominal packet delay budget, the jitter of the burst arrival time, or the nominal arrival time.

[0235] although Fig.11 An example block diagram of process 1100 is shown, but in some aspects, process 1100 may include Fig.11 Additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in the process 1100. Additionally or alternatively, two or more blocks of the blocks of process 1100 may be performed in parallel.

[0236] Fig. 12A 1 is a diagram illustrating an example process 1200A performed, for example, by a UE and a client application executing (e.g., hosted) thereon and performed by a network node in accordance with the present disclosure. The example process 1200 is an example in which a UE (e.g., UE 120d), an associated client application (e.g., an XR application), and a network node perform operations associated with deadline-based data packetization.

[0237] like Fig. 12A As shown, in some aspects, process 1200A may include sending, by the UE, to a network node an indication of a data delivery deadline for data traffic to be received by the network node, wherein the data delivery deadline indicates when the network node is to deliver one or more data packets received from the user equipment (block 1210A). For example, a UE (e.g., using Fig.13The communication manager 1308 and / or the sending component 1304 depicted in FIG. 1 may be configured to send an indication of a data delivery deadline to a network node. Fig. 12A As further shown, in some aspects, process 1200A may include sending, by the UE, one or more data packets to the network node (block 1220A), which may also be performed by the UE (e.g., using Fig.13 1308 and / or sending component 1304) depicted in FIG.

[0238] In addition, process 1200A may also include receiving, by the network node, an indication of a data delivery deadline and one or more data packets from the UE (block 1230A). Fig.14 1402) can receive an indication of a data delivery deadline and one or more data packets from a UE. In an exemplary aspect, the data delivery deadline is first received, and then the UE begins sending data packets or bursts to the network node. In response thereto, the process 1200A may also include sending, by the network node, one or more data packets from the user equipment at a time between an actual arrival time of the one or more data packets from the user equipment and the data delivery deadline (block 1240A). For example, the network node (e.g., using Fig.14 The communication manager 1408 and / or the sending component 1404 depicted in FIG. 1404 may send one or more data packets from the user equipment to an upstream device, such as a server.

[0239] Fig. 12B 1 is a diagram illustrating another example process 1200B performed, for example, by a UE and a client application executing (e.g., hosted) thereon and performed by a network node according to the present disclosure. Likewise, it should be understood that the example process 1200B is an example in which a UE (e.g., UE 120d), an associated client application (e.g., an XR application), and a network node perform operations associated with a deadline-based data packet. Process 1200B may be an alternative to process 1200A. In addition, the UE (e.g., UE 120d) and the corresponding network node may each be configured to perform any of the corresponding sub-processes based on the exemplary configuration.

[0240] Specifically, Fig. 12B As shown, in some aspects, process 1200B may include sending, by the UE, to a network node an indication of a nominal arrival time of data traffic to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send one or more data packets received from the user equipment (block 1210B). Fig.13The communication manager 1308 and / or the sending component 1304 depicted in FIG. 1 may be configured to send a nominal arrival time for data traffic to be received at a network node. Fig. 12B As further shown, in some aspects, process 1200B may include sending, by the UE, one or more data packets to the network node (block 1220B), which may also be performed by the UE (e.g., using Fig.13 1308 and / or sending component 1304) depicted in FIG.

[0241] In addition, process 1200B may also include receiving, by the network node, an indication of a nominal arrival time and one or more data packets from the UE (block 1230B). Fig.14 140B) can receive an indication of a nominal arrival time and one or more data packets from a UE. In an exemplary aspect, the nominal arrival time is first received and then the UE begins sending data packets or bursts to the network node. In response thereto, process 1200B can also include sending, by the network node, one or more data packets from the user equipment at a time between an actual arrival time of the one or more data packets from the user equipment and a second time based at least in part on the nominal arrival time and the nominal delay budget (block 1240B). For example, the network node (e.g., using Fig.14 The communication manager 1408 and / or the sending component 1404 depicted in FIG. 1404 may send one or more data packets from the user equipment to an upstream device, such as a server.

[0242] Processes 1200A and 1200B may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.

[0243] In a first aspect, process 1200A and / or process 1200B includes sending, to the network node, an indication of a periodicity or frequency of the nominal arrival time at which the network node sends the one or more data packets from the UE.

[0244] In a second aspect, alone or in combination with the first aspect, process 1200A and / or process 1200B includes defining the nominal arrival time of the network node to be independent of when the network node receives the one or more data packets from the UE.

[0245] In a third aspect, alone or in combination with one or more of the first and second aspects, process 1200A and / or process 1200B includes overwriting a data delivery deadline grouping data buffer set according to actual arrival times of the one or more data packets from the UE.

[0246] In a fourth aspect, alone or in combination with one or more of the first to third aspects, process 1200A and / or process 1200B includes dynamically adjusting, by the client application, the data delivery deadline of the data service based on a quality of service (QoS) flow of the data to be delivered to the network node.

[0247] In a fifth aspect, alone or in combination with one or more of the first to fourth aspects, process 1200A and / or process 1200B includes determining, by the client application, the nominal arrival time based on the timing when the client application generates the one or more data packets.

[0248] In a sixth aspect, alone or in combination with one or more of aspects 1 to 5, process 1200A and / or process 1200B includes providing the data delivery deadline to the UE by the client application hosted on the UE utilizing a cross-layer application programming interface and based on uplink traffic received from a server coupled to the network node.

[0249] In the seventh aspect, alone or in combination with one or more of the first to sixth aspects, process 1200A and / or process 1200B includes: receiving, by the client application, a relative time offset of the uplink timing that meets the data delivery deadline; and determining the data delivery deadline based on the relative time offset.

[0250] In the eighth aspect, alone or in combination with one or more of the first to seventh aspects, process 1200A and / or process 1200B includes: determining the nominal arrival time of the data service includes calculating the nominal arrival time by the UE based on the incoming data packets received from the client application, and adjusting the nominal arrival time based on the timing of the received incoming data packets.

[0251] In a ninth aspect, alone or in combination with one or more of aspects 1 to 8, process 1200A and / or process 1200B includes: marking a jitter or delay budget in a header of each of the data packets delivered by the client application to the UE; and adjusting the nominal arrival time based on the timing indicated by the jitter or the delay budget in the header of each of the data packets.

[0252] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, process 1200A and / or process 1200B includes converting the data delivery deadline into a radio access network (RAN) time domain to create a converted deadline for the network node.

[0253] In the eleventh aspect, alone or in combination with one or more of the first and tenth aspects, process 1200A and / or process 1200B includes: converting the data delivery deadline to the RAN time domain includes converting the deadline from the application time domain to the RAN time domain based at least in part on one or more of the following: a deadline mapping associated with a quality of service (QoS) flow, one or more deadline notification messages, or one or more data radio bearer (DRB) QoS parameters associated with the deadline.

[0254] In a twelfth aspect, alone or in combination with one or more of the first to eleventh aspects, process 1200A and / or process 1200B includes sending the indication of the data delivery deadline for the data traffic to be delivered by the network node.

[0255] In a thirteenth aspect, alone or in combination with one or more of the first to twelfth aspects, process 1200A and / or process 1200B includes: sending to the network node includes sending the indication of the nominal arrival time of the data service to be received at the network node.

[0256] In a fourteenth aspect, alone or in combination with one or more of the first to thirteenth aspects, process 1200A and / or process 1200B includes estimating the data delivery deadline of subsequent one or more data packets by adding the periodicity to the current data delivery deadline.

[0257] In a fifteenth aspect, either alone or in combination with one or more of the first to fourteenth aspects, process 1200A and / or process 1200B comprises estimating additional time consumed by retransmission of the one or more data packets uplink packets.

[0258] although Fig. 12A and Fig. 12B Example blocks of processes 1200A and 1200B are shown, but in some aspects, processes 1200A and 1200B may include Fig. 12A and Fig. 12B Additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in the process 1200A and 1200B. Additionally or alternatively, two or more blocks in each of the blocks in the process 1200A and 1200B may be performed in parallel.

[0259] Fig.131 is a diagram of an example apparatus 1300 for wireless communication. Apparatus 1300 may be a UE, or a UE may include apparatus 1300. In some aspects, apparatus 1300 includes a receiving component 1302 and a transmitting component 1304 that may communicate with each other (e.g., via one or more buses and / or one or more other components). As shown, apparatus 1300 may communicate with another apparatus 1306 (such as a UE, a base station, or another wireless communication apparatus) using receiving component 1302 and transmitting component 1304. As further shown, apparatus 1300 may include a communication manager 1308 (e.g., communication manager 140).

[0260] In some aspects, the apparatus 1300 may be configured to perform Figures 6 to 9 Additionally or alternatively, the apparatus 1300 may be configured to perform one or more processes described herein, such as Fig.10 The process of 1000 Fig. 12A Process 1200A and Fig. 12B Additionally or alternatively, the apparatus 1300 may be configured to perform the process 1200B in conjunction with Figures 15 to 21 In some aspects, the apparatus 1300 and / or Fig.13 One or more of the components shown in the figure may include a combination of Figure 2 Additionally or alternatively, Fig.13 One or more of the components shown in the figure may be combined with Figure 2 In one or more components described herein, the components may be implemented in a plurality of ways. Additionally or alternatively, one or more components in the component set may be at least partially implemented as software stored in one or more memories. For example, a component (or a portion of a component) may be implemented individually or in combination as instructions or codes stored in a non-transitory computer-readable medium, and may be executed individually or in combination by a controller or one or more processors to perform the function or operation of the component.

[0261] Receive component 1302 may receive communications, such as reference signals, control information, data communications, or combinations thereof, from device 1306. Receive component 1302 may provide the received communications to one or more other components of device 1300. In some aspects, receive component 1302 may perform signal processing (such as filtering, amplification, demodulation, analog-to-digital conversion, demultiplexing, deinterleaving, demapping, equalization, interference cancellation, or decoding, etc.) on the received communications and may provide the processed signals to the one or more other components of device 1300. In some aspects, receive component 1302 may include in conjunction with Figure 2One or more antennas, modems, demodulators, MIMO detectors, one or more receive processors, one or more controllers / processors, one or more memories, or a combination thereof of the described UE.

[0262] Transmit component 1304 may transmit communications, such as reference signals, control information, data communications, or combinations thereof, to device 1306. In some aspects, one or more other components of device 1300 may generate communications and may provide the generated communications to transmit component 1304 for transmission to device 1306. In some aspects, transmit component 1304 may perform signal processing (such as filtering, amplification, modulation, digital-to-analog conversion, multiplexing, interleaving, mapping, or encoding, etc.) on the generated communications and may transmit the processed signals to device 1306. In some aspects, transmit component 1304 may include in conjunction with Figure 2 One or more antennas, modems, modulators, one or more transmit MIMO processors, one or more transmit processors, one or more controllers / processors, one or more memories, or a combination thereof of the described UE. In some aspects, the transmitting component 1304 can be co-located with the receiving component 1302 in a transceiver.

[0263] The transmitting component 1304 can transmit to the network node an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time for data packets of the communication session. The receiving component 1302 can receive the one or more data packets based at least in part on the one or more data packets arriving at or before the deadline.

[0264] Receiving component 1302 can receive information from an application client at a UE indicating a deadline, periodicity, frequency, a nominal packet delay budget, jitter of a burst arrival time, or a nominal arrival time of data packets for a communication session.

[0265] The communications manager 1308 may convert the cutoff time into the RAN time domain to create a converted cutoff time, the cutoff time indicated by the indication being the converted cutoff time.

[0266] The communication manager 1308 can identify a burst index for a data packet based at least in part on one or more of: burst metadata available at an application layer of the data packet or a burst index determined at least in part based on the timing of the data packet, wherein the deadline is a periodic deadline, and wherein the burst index is associated with the timing of the deadline.

[0267] The communications manager 1308 may identify an IP flow to which the deadline applies, the IP flow being associated with the data packet and being identified based at least in part on one or more of: an indication of the IP flow via an application layer of the data packet or a logical channel identifier determined at least in part on an IP packet index of the data packet.

[0268] The communication manager 1308 may convert the IP flows into QoS flows to which the deadlines apply.

[0269] The sending component 1304 can send one or more of an indication of a QoS flow or logical channel associated with the data packet and the deadline, an indication of a burst index associated with the timing of the deadline, or an indication of a logical channel identifier associated with the data packet and the deadline.

[0270] Receiving component 1302 may receive an additional indication that the QoS flow or logical channel is configured with a deadline and send an indication that the QoS flow or logical channel associated with the data packet is associated with the deadline.

[0271] Receiving component 1302 can receive an indication that expiration of a data packet for a communication session is associated with a deadline and is not associated with a packet delay budget.

[0272] Transmitting component 1304 can transmit an indication that expiration of data packets for the communication session is associated with a deadline and not associated with a packet delay budget.

[0273] Receiving component 1302 can receive an indication of acceptance of a deadline, periodicity, frequency, a nominal packet delay budget, jitter of a burst arrival time, or a nominal arrival time for data packets of a communication session.

[0274] The receiving component 1302 can receive an indication of downlink resources for receiving data packets, the downlink resources being based at least in part on an indication of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times for data packets of a communication session, wherein the data packets are received based on the downlink resources.

[0275] Receiving component 1302 can receive an indication of a mapping of QoS flows to IP flows.

[0276] Fig.13 The number and arrangement of components shown in the figure are provided as examples. In practice, there may be Fig.13 The components shown in the figure may include additional components, fewer components, different components, or components arranged in a different manner. Fig.13 Two or more components shown in may be implemented in a single component, or Fig.13The single component shown in may be implemented as multiple distributed components. Additionally or alternatively, Fig.13 The collection of (one or more) components shown in can perform the operations described by Fig.13 One or more functions performed by another component collection shown in .

[0277] Fig.14 1 is a diagram of an example apparatus 1400 for wireless communication. Apparatus 1400 may be a network node, or a network node may include apparatus 1400. In some aspects, apparatus 1400 includes a receiving component 1402 and a transmitting component 1404 that may communicate with each other (e.g., via one or more buses and / or one or more other components). As shown, apparatus 1400 may communicate with another apparatus 1406 (such as a UE, a base station, or another wireless communication apparatus) using receiving component 1402 and transmitting component 1404. As further shown, apparatus 1400 may include a communication manager (e.g., communication manager 150).

[0278] In some aspects, the apparatus 1400 may be configured to perform Figures 6 to 9 Additionally or alternatively, the apparatus 1400 may be configured to perform one or more processes described herein, such as Fig.11 Process 1100, Fig. 12A Process 1200A and Fig. 12B Additionally or alternatively, the apparatus 1400 may be configured to perform the process 1200B in conjunction with Figures 15 to 21 In some aspects, the apparatus 1400 and / or Fig.14 One or more of the components shown in the figure may include a combination of Figure 2 Additionally or alternatively, Fig.14 One or more of the components shown in the figure may be combined with Figure 2 In one or more components described herein, the components may be implemented in a plurality of ways. Additionally or alternatively, one or more components in the component set may be at least partially implemented as software stored in one or more memories. For example, a component (or a portion of a component) may be implemented individually or in combination as instructions or codes stored in a non-transitory computer-readable medium, and may be executed individually or in combination by one or more controllers and / or processors to perform the function or operation of the component.

[0279] The receiving component 1402 may receive communications, such as reference signals, control information, data communications, or combinations thereof, from the device 1406. The receiving component 1402 may provide the received communications to one or more other components of the device 1400. In some aspects, the receiving component 1402 may perform signal processing (such as filtering, amplification, demodulation, analog-to-digital conversion, demultiplexing, deinterleaving, demapping, equalization, interference cancellation, or decoding, etc.) on the received communications and may provide the processed signals to the one or more other components of the device 1400. In some aspects, the receiving component 1402 may include combining Figure 2 One or more antennas, modems, demodulators, MIMO detectors, one or more receive processors, one or more controllers / processors, one or more memories, or a combination thereof of the described network nodes.

[0280] Transmit component 1404 may transmit communications, such as reference signals, control information, data communications, or combinations thereof, to device 1406. In some aspects, one or more other components of device 1400 may generate communications and may provide the generated communications to transmit component 1404 for transmission to device 1406. In some aspects, transmit component 1404 may perform signal processing (such as filtering, amplification, modulation, digital-to-analog conversion, multiplexing, interleaving, mapping, or encoding, etc.) on the generated communications and may transmit the processed signals to device 1406. In some aspects, transmit component 1404 may include in conjunction with Figure 2 One or more antennas, modems, modulators, one or more transmit MIMO processors, one or more transmit processors, one or more controllers / processors, one or more memories, or a combination thereof of the described network nodes. In some aspects, the transmit component 1404 can be co-located with the receive component 1402 in a transceiver.

[0281] The receiving component 1402 can receive an indication of one or more of a deadline, a periodicity, a frequency, a nominal packet delay budget, a jitter of a burst arrival time, or a nominal arrival time associated with data packets for the communication session. The sending component 1404 can send the one or more data packets based at least in part on the one or more data packets being sent at or before the deadline.

[0282] The sending component 1404 can send an indication of downlink resources for receiving data packets, the downlink resources being based at least in part on an indication of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times for data packets for a communication session, wherein the data packets are received by a receiving device based at least in part on the downlink resources.

[0283] The communications manager 1408 may group the data packets into burst groups based at least in part on a deadline, periodicity, frequency, a nominal packet delay budget, jitter of burst arrival times, or an indication of a nominal arrival time for the data packets of the communication session.

[0284] The receiving component 1402 may receive one or more of an indication that a QoS flow or logical channel associated with the data packet is associated with a deadline, an indication of a burst index associated with a timing of the deadline, or an indication that a logical channel identifier associated with the data packet is associated with the deadline.

[0285] Transmitting component 1404 can transmit an additional indication that the QoS flow or logical channel associated with the data packet is configured with a deadline based at least in part on receiving an indication that the QoS flow or logical channel associated with the data packet is associated with a deadline.

[0286] The sending component 1404 can send an indication of a mapping of QoS flows to IP flows for converting the IP flows to which the deadlines apply to the QoS flows to which the deadlines apply.

[0287] Transmitting component 1404 can transmit an indication of acceptance of a deadline, periodicity, frequency, nominal packet delay budget, jitter of burst arrival times, or nominal arrival times for data packets for the communication session.

[0288] Receiving component 1402 can receive an indication that expiration of a data packet for a communication session is associated with a deadline and not associated with a packet delay budget.

[0289] Transmitting component 1404 can transmit an indication that expiration of a data packet for a communication session is associated with a deadline and not associated with a packet delay budget.

[0290] The communications manager 1408 may discard the one or more additional data packets based at least in part on the one or more additional data packets failing to meet the deadline.

[0291] The communications manager 1408 may identify the deadline based at least in part on one or more of a periodicity, a frequency, a nominal packet delay budget, a jitter in a burst arrival time, or a nominal arrival time of the data packets.

[0292] Fig.14 The number and arrangement of components shown in the figure are provided as examples. In practice, there may be Fig.14 The components shown in the figure may include additional components, fewer components, different components, or components arranged in a different manner. Fig.14 Two or more components shown in may be implemented in a single component, or Fig.14The single component shown in may be implemented as multiple distributed components. Additionally or alternatively, Fig.14 The collection of (one or more) components shown in can perform the operations described by Fig.14 One or more functions performed by another component collection shown in .

[0293] Fig.15 1500 is a diagram illustrating an operation when a UE sends a PDU earlier than expected. As shown in example 1500, a UE application may send at time t0. A UE modem (e.g., one or more of 254a-254r, individually or in combination) may send a PDU such that the PDU is transmitted before a nominal arrival time (NAT). The RAN may send a PDU such that the PDU is transmitted before a data delivery deadline (DDD). The DDD may be the sum of a nominal arrival time (NAT) and a nominal delay budget (NDB). In some aspects, the NDB may be equivalent to an access network packet delay budget (AN PDB).

[0294] The UE application will then be expected to send the PDU at the expected time (e.g., t0 + period). Thus, the expected NAT will be NAT + period, and the expected DDD will be DDD + period. However, in some aspects, the UE application may send the PDU earlier than expected at a time before the expected send time (e.g., a time before t0 + period). The UE modem may then send the PDU earlier than expected such that the PDU arrives before the expected NAT. The RAN may then send the PDU earlier than expected such that the PDU arrives before the expected DDD.

[0295] As indicated above, Fig.15 are provided as examples. Other examples can be found in the Fig.15 The examples described are different.

[0296] Fig.16 1600 is a diagram illustrating an operation when a UE sends a PDU later than expected. As shown in example 1500, a UE application may send at time t0. A UE modem (e.g., one or more of 254a-254r, individually or in combination) may send a PDU such that the PDU is transmitted before a nominal arrival time (NAT). The RAN may send a PDU such that the PDU is transmitted before a data delivery deadline (DDD). The DDD may be the sum of a nominal arrival time (NAT) and a nominal delay budget (NDB). In some aspects, the NDB may be equivalent to an access network packet delay budget (AN PDB).

[0297] The UE application will then be expected to send the PDU at the expected time (e.g., t0 + period). Thus, the expected NAT will be NAT + period, and the expected DDD will be DDD + period. However, in some aspects, the UE application may send the PDU later than expected at a time after the expected send time (e.g., at a time later than t0 + period). The UE modem may then send the PDU later than expected such that it arrives after the expected NAT. However, the RAN may still need to send the PDU before the expected DDD.

[0298] As indicated above, Fig.16 are provided as examples. Other examples can be found in the Fig.16 The examples described are different.

[0299] Fig.17 1700 is a diagram illustrating an operation of a UE sending a PDU. As shown in example 1700, a UE application may send at time t0. The RAN may send the PDU such that the PDU is transmitted before the AN PDB. The UPF may send the PDU such that the PDU is transmitted before the CN PDB. In some aspects, the total PDB may be the sum of the AN PDB and the CN PDB.

[0300] As indicated above, Fig.17 are provided as examples. Other examples can be found in the Fig.17 The examples described are different.

[0301] Fig.18 is a diagram of example 1800 illustrating operations when a UE sends a PDU earlier than expected. As shown in example 1800, the UE may send at time t0. The RAN may send the PDU such that the PDU is transmitted before the AN PDB and NAT. In some aspects, the NDB may be equivalent to the access network packet delay budget (AN PDB). The UPF may send the PDU such that the PDU is transmitted before the CN PDB and DDD. In some aspects, the total PDB may be the sum of the AN PDB and the CN PDB.

[0302] The UE will then be expected to send the PDU at the expected time (e.g., t0 + period). Thus, the expected NAT will be NAT + period, and the expected DDD will be DDD + period. However, in some aspects, the UE may send the PDU earlier than expected at a time before the expected send time (e.g., a time before t0 + period). The RAN may then send the PDU earlier than expected such that the PDU arrives before the expected NAT. The UPF may then send the PDU earlier than expected such that the PDU arrives before the expected DDD.

[0303] As indicated above, Fig.18 are provided as examples. Other examples can be found in the Fig.18 The examples described are different.

[0304] Fig.19 is a diagram of example 1900 illustrating operations when a UE sends a PDU later than expected. As shown in example 1900, the UE may send at time t0. The RAN may send the PDU such that the PDU is transmitted before the AN PDB and NAT. In some aspects, the NDB may be equivalent to the access network packet delay budget (AN PDB). The UPF may send the PDU such that the PDU is transmitted before the CN PDB and DDD. In some aspects, the total PDB may be the sum of the AN PDB and the CN PDB.

[0305] The UE will then be expected to send the PDU at the expected time (e.g., t0 + period). Thus, the expected NAT will be NAT + period, and the expected DDD will be DDD + period. However, in some aspects, the UE may send the PDU later than expected at a time later than the expected send time (e.g., at a time later than t0 + period). The RAN may then send the PDU later than expected such that it arrives after the expected NAT. However, the UPF may still need to send the PDU before the expected DDD.

[0306] As indicated above, Fig.19 are provided as examples. Other examples can be found in the Fig.19 The examples described are different.

[0307] Fig. 20 is a diagram of example 2000 illustrating operation when a UE sends a PDU earlier than expected. As shown in example 2000, the UE may send at time t0. The RAN may send the PDU such that it is transmitted before the AN PDB and DDD.

[0308] The UE will then be expected to send the PDU at the expected time (e.g., t0 + period). Therefore, the expected DDD will be DDD + period. However, in some aspects, the UE may send the PDU earlier than expected at a time before the expected sending time (e.g., a time before t0 + period). The RAN may then send the PDU earlier than expected such that the PDU arrives before the expected DDD.

[0309] As indicated above, Fig. 20 are provided as examples. Other examples can be found in the Fig. 20 The examples described are different.

[0310] Fig.21is a diagram of example 2100 illustrating operation when a UE sends a PDU later than expected. As shown in example 2100, the UE may send at time t0. The RAN may send the PDU such that it is transmitted before the AN PDB and DDD.

[0311] The UE will then be expected to send the PDU at the expected time (e.g., t0 + period). Therefore, the expected DDD will be the DDD + period. However, in some aspects, the UE may send the PDU later than expected at a time later than the expected sending time (e.g., a time before t0 + period). The RAN may then send the PDU later than expected, but the PDU may still arrive before the expected DDD.

[0312] As indicated above, Fig.21 are provided as examples. Other examples can be found in the Fig.21 The examples described are different.

[0313] Fig. 22 2200 is a diagram illustrating an example of a UE-indicated deadline for an uplink. As shown in example 2200, an application server AS may establish a QoS flow with a deadline to a RAN through a 5G core (5GC), wherein the 5G network includes the RAN and the 5GC. The AS may request a relative shift in uplink timing that satisfies an uplink deadline of a device. The device may include an application client and a UE. An uplink deadline indication including one or more of a relative time offset, a periodicity, and / or a frequency may be transmitted from the application client to the UE. An uplink deadline indication including one or more of a relative time offset, a periodicity, and / or a frequency may be transmitted from the UE to the RAN. Scheduling based on the uplink deadline may be transmitted from the RAN to the UE.

[0314] In some aspects including the X-layer API, the application client receives the deadline for uplink traffic from the server and indicates the deadline to the UE via the X-layer API. In order to avoid the strict synchronization requirements between the server and the client, the server requests the client to meet the relative time offset of the uplink timing of the uplink deadline. For example, if the uplink (UL) PDU set arrives at the server 2.5ms after the deadline, the server can request the client to shift the uplink timing by 2.5ms. In some aspects, the application client requests the UE to reduce the delay budget for uplink transmission. In some aspects, the application client shifts the uplink packet generation time earlier, thereby increasing the latency.

[0315] In some aspects, including for 3GPP messages, the UE may indicate to the gNB a deadline for a certain UL PDU set. New 3GPP messages for uplink deadlines may include MAC-CE or RRC at the protocol layer. These may include indicators related to deadlines, periodicity, frequency, PDU set identifiers, QoS flows, or LCIDs. Periodicity information may also be delivered from an application server. In some aspects, the deadline may be defined by an absolute time related to a system frame number (SFN), subframe, time slot, or the deadline may be defined by a relative time offset. Periodicity may be defined in frames per second or Hertz. The gNB may track the next estimated Nth deadline for the uplink Nth PDU set or PDU as deadline + N*periodicity.

[0316] As indicated above, Fig. 22 are provided as examples. Other examples can be found in the Fig. 22 The examples described are different.

[0317] Fig.23 2300 is a diagram illustrating an example of a 5GC-indicated deadline for an uplink. As shown in example 2300, an application server AS may establish a QoS flow with a deadline to a RAN via a 5G core (5GC), wherein the 5G network includes the RAN and the 5GC. The AS may also transmit QoS parameters of the PSDD to the RAN via the 5GC. The device may include an application client and a UE. The X-layer API of the XR UL mode may transmit an indicator having one or more of a relative time offset, a periodicity, and / or a frequency to the UE, or the UE inference of the XR UL mode may be based on one or more of a relative time offset, a periodicity, and / or a frequency. QoS parameters of the PSDD may be transmitted from the UE to the RAN, including one or more of a relative time offset, a periodicity, and / or a frequency. Scheduling based on the uplink deadline may be transmitted from the RAN to the UE.

[0318] In terms of having an X-layer API, the UE can extract the XR service mode for uplink services. The UE may need XR UL service mode information including NAT and periodicity or frequency. Alternatively or additionally, for the X-layer API, the application client can explicitly indicate the XR uplink service mode to the UE using the X-layer API. This can eliminate ambiguity, and strict information can be defined by the application client, but the client will need to adopt a new API. Alternatively or additionally, via AI / ML, the UE can infer the nominal arrival time and periodicity based on the incoming packets of the application client. Alternatively or additionally, the 5GC instead of the UE can provide the nominal arrival time of the uplink service based on information from the application function (AF) (e.g., TSCAI). Alternatively or additionally, the 5GC instead of the UE can provide the deadline for the UL service based on information from the AF (e.g., TSCAI). This can provide compatibility with legacy application clients, but it may take more time when the XR mode changes.

[0319] In aspects with 3GPP messaging, the UE may indicate to the gNB a nominal time of arrival for a certain uplink PDU set or PDU. New 3GPP messaging for uplink nominal time of arrival may include MAC-CE (e.g., enhanced BSR) or RRC at the protocol layer. Indicators may include NAT, periodicity (or delivery from AF to RAN), frequency, PDU set ID, QoS flow, or LCID. The gNB may attempt to deliver the next Nth PDU set or PDU according to NAT+PSDD+N*periodicity.

[0320] As indicated above, Fig.23 are provided as examples. Other examples can be found in the Fig.23 The examples described are different.

[0321] Fig.24 2400 is a diagram illustrating an example of a client-indicated deadline for an uplink. As shown in example 2400, an application server AS may establish a QoS flow with PSDD to a RAN via a 5G core (5GC), wherein the 5G network includes the RAN and the 5GC. The AS may also transmit QoS parameters of the PSDD to the RAN via the 5GC. The device may include an application client and a UE. The application client may mark the jitter of each PDU set or PDU in an RTP header transmitted to the RAN. A schedule based on the uplink deadline may be transmitted from the RAN to the UE.

[0322] In the aspect of having a PDU set header, the application client marks the jitter or delay budget of each PDU set or PDU in the application layer header. The application client can know the jitter of the uplink PDU set based on the generation time of the PDU set, so the application client marks the jitter in each PDU set header accordingly. Therefore, a field for the jitter or delay budget is added in the application layer header design. The UE can reduce the delay budget of the PDU set header by the time consumed until the uplink packet of the scheduling PDU set or PDU is scheduled.

[0323] In some aspects, the relative delay budget offset (jitter) for each PDU set or PDU includes that the gNB considers the relative delay budget as an additional delay budget in addition to the fixed delay budget (e.g., PSDB, PSDD). For example, if PSDD = 10ms, the jitter of the PDU set is set to 2ms. The PDU set should be delivered within 10ms-(-2ms) = 12ms.

[0324] In some aspects, the absolute delay budget for each PDU set includes the absolute delay budget taken into account by the gNB. The gNB internal delay from PDCP to MAC is subtracted at the gNB MAC layer. For example, the delay budget for a PDU set is 12ms, so the PDU set should be delivered within 12ms.

[0325] As indicated above, Fig.24 are provided as examples. Other examples can be found in the Fig.24 The examples described are different.

[0326] Fig.25 2500 is a diagram of an example of a client-indicated deadline for an uplink. In some aspects, the gNB may know the delay budget when it receives an initial packet of a PDU set or PDUs and reads the header without error. If the initial uplink transmission has an error, a retransmission procedure (HARQ, ARQ) will occur and the gNB will consume more time until it reads the delay budget in the header. However, since the delay budget of the header does not take into account the retransmission time, the delay budget of the gNB varies depending on the transmission time. Therefore, it can be advantageous to consider the delay budget of the header when initiating from the initial transmission time of the first PDU, either alone or in a PDU set. In some aspects, if the initial transmission does not receive an uplink packet, the gNB estimates the initial transmission time based on the same HARQ ID (MAC, HARQ) and the same SN (RLC, ARQ). In some aspects, the gNB subtracts the time consumed by the retransmission from the delay budget in the header. For example, if HARQ retransmission takes 2.5ms, the gNB reduces the delay budget of the header by 2.5ms.

[0327] As shown in example 2500, a PDU set may have a delay budget (e.g., 10 ms). The delay budget information may be included and / or written in metadata for the PDU set (e.g., in the PDU set header). Due to the retransmission time (e.g., 2.5 ms), the gNB may need to reduce the delay budget written in the PDU set metadata. This reduction may modify the actual delay budget used to complete the retransmission (e.g., 10 ms minus the 2.5 ms retransmission time requirement equals 7.5 ms).

[0328] As indicated above, Fig.25 are provided as examples. Other examples can be found in the Fig.25 The examples described are different.

[0329] Fig.26 is a diagram of example 2600 illustrating capacity improvement using a cut-off time. As shown in example 2600, using a cut-off time delay can increase the number of UEs per cell compared to using a packet delay. For example, compared to only 4 UEs using PDB, capacity can be improved by 50%, and 6 UEs can be included in the cell using a cut-off time. Further optimization can be performed in a delay-aware scheduler, where a CDRX offset can be set close to the cut-off time.

[0330] As indicated above, Fig.26 are provided as examples. Other examples can be found in the Fig.26 The examples described are different.

[0331] Fig. 27 is a diagram illustrating an example 2700 of periodic downlink traffic with jitter according to the present disclosure, which includes capacity improvements compared to legacy PDBs.

[0332] like Fig. 27 As shown, a burst 2705A of data packets may be directed to the UE. The burst 2705A may be Fig. 27 The burst 2705A may arrive at a network (e.g., a network node, such as a RAN network node and / or a CN network node, etc.) at a time indicated in the figure relative to a nominal arrival time. The nominal arrival time may be associated with a periodic arrival time, and the burst 2705A may be offset from the periodic arrival time by a jitter. However, the burst 2705A may arrive at the nominal arrival time with zero jitter.

[0333] The network may send a burst 2705A, where reception at the UE is Fig. 27The amount of time between arrival at the network and reception at the UE is the latency. The latency may vary depending on when the burst arrives, but according to the systems and methods described herein using cutoff times, capacity is increased over existing PDB systems and methods where the latency budget is relaxed for all but the most recently arrived burst.

[0334] As indicated above, Fig. 27 are provided as examples. Other examples can be found in the Fig. 27 The examples described are different.

[0335] Fig.28 is a diagram illustrating an example 2800 of periodic downlink traffic with jitter according to the present disclosure, showing improved UE power consumption compared to legacy PDB.

[0336] like Fig.28 As shown, a burst 2805A of data packets may be directed to the UE. The burst 2805A may be Fig.28 2805A may arrive at a network (e.g., a network node, such as a RAN network node and / or a CN network node, etc.) at a time indicated in the figure relative to a nominal arrival time. The nominal arrival time may be associated with a periodic arrival time, from which the burst 2805A may be offset by a jitter. However, the burst 2805A may arrive at the nominal arrival time with zero jitter.

[0337] Even if the discontinuous reception (DRX) offset is set later than the burst arrival, the burst 2805B can be delivered before the cut-off time. The DRX on-duration can be set to a smaller value and the burst c 2805C is still covered.

[0338] As indicated above, Fig.28 are provided as examples. Other examples can be found in the Fig.28 The examples described are different.

[0339] The following provides an overview of some aspects of the disclosure:

[0340] Aspect 1: A method for wireless communication performed by a user equipment (UE), comprising: sending an indication of at least one of the following to a network node: a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE; or a nominal arrival time of the data service to be received at the network node, wherein the nominal arrival time in combination with a nominal delay budget indicates when the network node is to send the one or more data packets received from the UE; and sending the one or more data packets to the network node, wherein the one or more data packets are capable of including a PDU or a PDU group or a PDU set or a burst, wherein the one or more data packets include a protocol data unit (PDU), a PDU group or a PDU set or a burst.

[0341] Aspect 2: The method according to aspect 1, wherein the nominal delay budget is an access network packet delay budget.

[0342] Aspect 3: A method according to any one of Aspects 1 or 2, wherein sending the indication to the network node comprises: sending the indication of the data delivery deadline of the data service to be delivered by the network node, or sending the indication of the nominal arrival time of the data service to be received at the network node.

[0343] Aspect 4: The method according to any one of Aspects 1 to 3 further includes: sending to the network node an indication of the periodicity or frequency of the data delivery deadline for the data service to be delivered by the network node or the nominal arrival time of the data service to be received at the network node.

[0344] Aspect 5: The method according to any one of Aspects 1 to 4 further includes: estimating the data delivery deadline of one or more subsequent data packets at the UE by adding a value corresponding to the indicated periodicity or frequency to the current data delivery deadline or the current nominal arrival time.

[0345] Aspect 6: The method according to any one of aspects 1 to 5, wherein the data delivery deadline or the nominal arrival time covers a packet delay budget of an actual arrival time of the one or more data packets from the UE.

[0346] Aspect 7: The method according to any one of Aspects 1 to 6 also includes: dynamically adjusting, by a client application hosted on the UE, the data delivery deadline of the data service to be delivered to the network node based on a quality of service (QoS) flow or one or more data radio bearer (DRB) QoS parameters.

[0347] Aspect 8: The method according to any one of Aspects 1 to 7 further includes: a client application hosted on the UE providing the data delivery deadline to the UE using a cross-link application programming interface, or a client application hosted on the UE determining the nominal arrival time based on the timing when the client application generates the one or more data packets.

[0348] Aspect 9: The method according to any one of Aspects 1 to 8 further includes: receiving, by a client application hosted on the UE, a relative time offset of the uplink timing that meets the data delivery deadline; and determining the data delivery deadline based on the relative time offset.

[0349] Aspect 10: The method according to any one of Aspects 1 to 9 further includes: calculating the nominal arrival time of the data service based on incoming data packets received from a client application hosted on the UE; and adjusting the nominal arrival time based on the timing of the received incoming data packets.

[0350] Aspect 11: The method according to any one of Aspects 1 to 10 further includes: marking a jitter or delay budget in the header of each of the incoming data packets delivered by the client application to the UE; and adjusting the nominal arrival time based on the timing indicated by the jitter or the delay budget in the header of each of the data packets.

[0351] Aspect 12: The method according to any one of aspects 1 to 11 further comprises: estimating the additional time consumed by the retransmission of the one or more data packets.

[0352] Aspect 13: The method according to aspect 12, further comprising: converting the data delivery deadline into a radio access network (RAN) time domain to create a converted deadline for the network node.

[0353] Aspect 14: A method according to any one of Aspects 1 to 13, wherein converting the data delivery deadline to the RAN time domain includes converting the deadline from the application time domain to the RAN time domain based at least in part on one or more of the following: a deadline mapping associated with a quality of service (QoS) flow, one or more deadline notification messages, or one or more data radio bearer (DRB) QoS parameters associated with the deadline.

[0354] Aspect 15: The method according to any one of Aspects 1 to 14 further includes: the network node sending the one or more data packets from the UE at a time between the actual arrival time of the one or more data packets from the UE and the data delivery deadline or the nominal arrival time added to the nominal delay budget.

[0355] Aspect 16: An apparatus for performing wireless communications at a device, comprising: one or more processors; one or more memories coupled to the one or more processors; and instructions stored in the one or more memories and executable by the one or more processors individually or in combination to cause the apparatus to perform one or more of the methods described in Aspects 1 to 15.

[0356] Aspect 17: An apparatus for wireless communication, comprising: at least one component for performing the method according to one or more of aspects 1 to 15.

[0357] Aspect 18: One or more non-transitory computer-readable media storing, alone or in combination, code for wireless communication, the code comprising instructions executable by one or more processors, alone or in combination, to perform the method according to one or more of aspects 1 to 15.

[0358] Aspect 19: One or more non-transitory computer-readable media storing, alone or in combination, an instruction set for wireless communication, wherein the instruction set includes one or more instructions that, when executed, alone or in combination, by one or more processors of the device, cause the device to perform one or more of the methods described in aspects 1 to 18.

[0359] Aspect 20: A method for wireless communication performed by a network node, comprising: receiving, by the network node, an indication of a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receiving, by the network node, the one or more data packets from the UE; and sending, by the network node, the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline, wherein the one or more data packets include a protocol data unit (PDU), a PDU group or a PDU set or a burst.

[0360] Aspect 21: The method according to Aspect 20, further comprising a nominal delay budget.

[0361] Aspect 22: A method according to Aspect 20 or 21, wherein receiving the indication by the network node includes: receiving the indication of the data delivery deadline of the data service to be delivered by the network node, or receiving the indication of the nominal arrival time of the data service to be received at the network node.

[0362] Aspect 23: The method according to any one of Aspects 20 to 22 further includes: receiving, by the network node, an indication of the periodicity or frequency of the data delivery deadline for the data service to be delivered by the network node or the nominal arrival time of the data service to be received at the network node.

[0363] Aspect 24: The method according to any one of Aspects 20 to 23 further includes: estimating by the network node the data delivery deadline or the nominal arrival time of one or more subsequent data packets by adding a value corresponding to the indicated periodicity or frequency to the current data delivery deadline or the current nominal arrival time.

[0364] Aspect 25: The method according to any one of aspects 20 to 24, wherein the data delivery deadline or the nominal arrival time covers a packet delay budget of an actual arrival time of the one or more data packets from the UE.

[0365] Aspect 26: A method according to any one of Aspects 20 to 25, wherein the data delivery deadline of the data service to be delivered to the network node is dynamically adjusted based on a client application hosted on the UE based on a quality of service (QoS) flow or one or more data radio bearer (DRB) QoS parameters.

[0366] Aspect 27: A method according to any one of Aspects 20 to 26, wherein a client application hosted on the UE provides the data delivery deadline to the UE using a crosslink application programming interface, or determines the nominal arrival time based on the timing when the client application generates the one or more data packets.

[0367] Aspect 28: A method according to any one of Aspects 20 to 27, wherein a relative time offset of an uplink timing that meets the data delivery deadline is received by a client application hosted on the UE; and the method also includes determining the data delivery deadline based on the relative time offset.

[0368] Aspect 29: According to the method described in any one of Aspects 20 to 28, the nominal arrival time of the data service is calculated based on incoming data packets received from a client application hosted on the UE; and the nominal arrival time is adjusted based on the timing of the received incoming data packets.

[0369] Aspect 30: According to the method described in any one of Aspects 20 to 29, a jitter or delay budget is marked in the header of each of the incoming data packets received from the client application on the UE; and the nominal arrival time is adjusted based on the timing indicated by the jitter or the delay budget in the header of each of the data packets.

[0370] Aspect 31: The method according to any one of aspects 20 to 30, wherein the additional time consumed by the retransmission of the one or more data packets is estimated.

[0371] Aspect 32: The method according to any one of aspects 20 to 31, wherein the data delivery deadline is converted into a radio access network (RAN) time domain to create a converted deadline for the network node.

[0372] Aspect 33: A method according to any one of Aspects 20 to 32, wherein converting the data delivery deadline to the RAN time domain includes converting the data delivery deadline from the application time domain to the RAN time domain based at least in part on one or more of the following: a deadline mapping associated with a quality of service (QoS) flow, one or more deadline notification messages, or one or more data radio bearer (DRB) QoS parameters associated with the deadline.

[0373] Aspect 34: According to the method described in any one of Aspects 20 to 33, the network node sends the one or more data packets from the UE at a time between the actual arrival time of the one or more data packets from the UE and the data delivery deadline or the nominal arrival time added to the nominal delay budget.

[0374] Aspect 35: A network node for wireless communication, comprising: one or more memories; and one or more processors, the one or more processors being coupled to the one or more memories individually or in combination and configured to: receive an indication of a data delivery deadline for a data service to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receive the one or more data packets from the UE; and send the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline, wherein the one or more data packets include a protocol data unit (PDU), a PDU group or a PDU set or a burst.

[0375] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations may be made in light of the above disclosure or may be acquired from practice of the various aspects.

[0376] Further disclosure is included in the appendix. This appendix is ​​provided as an example only and is considered a part of this specification. The definitions, illustrations, or other descriptions in the appendix do not replace or cover similar information included in the specific embodiments or figures. In addition, the definitions, illustrations, or other descriptions in the specific embodiments or figures do not replace or cover similar information included in the appendix. In addition, this appendix is ​​not intended to limit the disclosure of possible aspects.

[0377] As used herein, the term "component" is intended to be broadly interpreted as a combination of hardware and / or hardware and software. Whether referred to as software, firmware, middleware, microcode, hardware description language or other names, "software" should be broadly interpreted as meaning instructions, instruction sets, codes, code segments, program codes, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, procedures and / or functions, etc. As used herein, a "processor" is implemented in a combination of hardware and / or hardware and software. It will be apparent that the systems and / or methods described herein can be implemented by a combination of hardware and / or hardware and software in different forms. The actual dedicated control hardware or software code used to implement these systems and / or methods does not limit various aspects. Therefore, there is no reference to a specific software code herein to describe the operation and behavior of the system and / or method, because those skilled in the art will understand that software and hardware can be designed to implement the system and / or method based at least in part on the description herein.

[0378] As used herein, a processor, at least one processor, and / or one or more processors configured to perform or operable to perform multiple actions (alone or in combination) is intended to include at least two different processors capable of performing different subsets, overlapping subsets, or non-overlapping subsets of the multiple actions, or a single processor capable of performing all of the multiple actions. In a non-limiting example of multiple processors capable of performing different actions combined in the multiple actions, a description of a processor, at least one processor, and / or one or more processors configured to perform or operable to perform actions X, Y, and Z may include at least a first processor configured to perform or operable to perform a first subset of X, Y, and Z (e.g., perform X) and at least a second processor configured to perform or operable to perform a second subset of X, Y, and Z (e.g., perform Y and Z). Alternatively, the first processor, the second processor, and the third processor may be configured to perform or operable to perform corresponding actions in actions X, Y, and Z, respectively. It should be understood that any combination of one or more processors may each be configured to perform or operable to perform any one of the multiple actions or any combination of the multiple actions.

[0379] As used herein, a memory, at least one memory, and / or one or more memories configured to store or having stored thereon instructions for performing multiple actions that are executable by one or more processors are intended to include at least two different memories capable of storing different subsets, overlapping subsets, or non-overlapping subsets of instructions for performing different subsets, overlapping subsets, or non-overlapping subsets of the multiple actions, or a single memory capable of storing instructions for performing all of the multiple actions. In one non-limiting example of one or more memories (alone or in combination) capable of storing different subsets of instructions for performing different actions of the plurality of actions, a description of a memory, at least one memory, and / or one or more memories configured or operable to store or have stored thereon instructions for performing actions X, Y, and Z may include at least a first memory configured or operable to store or have stored thereon a first subset of instructions for performing a first subset of X, Y, and Z (e.g., instructions to perform X), and at least a second memory configured or operable to store or have stored thereon a second subset of instructions for performing a second subset of X, Y, and Z (e.g., instructions to perform Y and Z). Alternatively, the first memory, the second memory, and the third memory may be configured or have stored thereon a respective one of the first subset of instructions for performing X, the second subset of instructions for performing Y, and the third subset of instructions for performing Z, respectively. It should be understood that any combination of one or more memories may each be configured or operable to store or have stored thereon any instruction or any combination of instructions that can be executed by one or more processors to perform any of a plurality of actions or any combination of the plurality of actions. In addition, one or more processors may each be coupled to at least one of the one or more memories and configured or operable to execute instructions to perform the plurality of actions. For example, in the above non-limiting example of different instruction subsets for performing actions X, Y, and Z, a first processor may be coupled to a first memory storing instructions for performing action X, at least a second processor may be coupled to at least a second memory storing instructions for performing actions Y and Z, and the first processor and the second processor may execute the corresponding instruction subsets in combination to complete the execution of actions X, Y, and Z. Alternatively, three processors may access one of three different memories, each of which stores instructions for performing actions X, Y, or Z, and the three processors may execute the corresponding instruction subsets in combination to complete the execution of actions X, Y, and Z. Alternatively, a single processor may execute instructions stored on a single memory or distributed on multiple memories to complete the execution of actions X, Y, and Z.

[0380] As used herein, "satisfying a threshold" may refer to a value being greater than a threshold, greater than or equal to a threshold, less than a threshold, less than or equal to a threshold, equal to a threshold, not equal to a threshold, etc., depending on the context.

[0381] Although the specific combination of features is set forth in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of various aspects. Many of these features can be combined in a manner that is not specifically described in the claims and / or is not disclosed in the specification. The disclosure of various aspects includes each dependent claim combined with each other claim in the claim set. As used herein, the phrase "at least one of" the list of items refers to any combination of these items (it includes a single member). As an example, "at least one of a, b or c" is intended to cover a, b, c, a+b, a+c, b+c and a+b+c, and any combination with multiple identical elements (e.g., a+a, a+a+a, a+a+b, a+a+c, a+b+b, a+c+c, b+b, b+b+b, b+b+c, c+c and c+c+c, or any other ordering of a, b and c).

[0382] Any element, action or instruction used herein should not be interpreted as key or necessary, unless explicitly described as such. In addition, as used herein, the article "one" is intended to include one or more items, and can be used interchangeably with "one or more". In addition, as used herein, the article "said" is intended to include one or more items connected with the article "said", and can be used interchangeably with "one or more". In addition, as used herein, the terms "set" and "group" are intended to include one or more items, and can be used interchangeably with "one or more". If only want to refer to a project, the phrase "only one" or similar terms will be used. In addition, as used herein, the terms "have", "have", "have" etc. are intended to be open terms, which do not limit the elements they modify (for example, "an element with" A can also have B). In addition, the phrase "based on" is intended to represent "based at least in part", unless explicitly stated otherwise. Furthermore, as used herein, the term "or" when used in a series is intended to be open-ended and used interchangeably with "and / or" unless explicitly stated otherwise (e.g., if used in conjunction with "either" or "only one of").

Claims

1. A method for wireless communication performed by a user equipment (UE), comprising: Sending to a network node an indication of at least one of: a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE, or a nominal time of arrival of the data traffic to be received at the network node, wherein the nominal time of arrival in combination with a nominal delay budget indicates when the network node is to transmit the one or more data packets received from the UE; as well as The one or more data packets are sent to the network node, wherein the one or more data packets include a protocol data unit (PDU).

2. The method of claim 1, wherein the nominal delay budget is an access network packet delay budget, and wherein the one or more data packets comprise a PDU group, a PDU set, or a burst.

3. The method of claim 1 , wherein sending the indication to the network node comprises: sending said indication of said data delivery deadline for said data traffic to be delivered by said network node, or The indication of the nominal time of arrival of the data traffic to be received at the network node is sent.

4. The method according to claim 3, further comprising: An indication of the periodicity or frequency of the data delivery deadline for data traffic to be delivered by the network node or the nominal arrival time of the data traffic to be received at the network node is sent to the network node.

5. The method according to claim 4, further comprising: The data delivery deadline or the nominal time of arrival of subsequent one or more data packets is estimated at the UE by adding a value corresponding to the indicated periodicity or frequency to the current data delivery deadline or the current nominal time of arrival.

6. The method of claim 1, wherein the data delivery deadline or the nominal arrival time covers a packet delay budget of an actual arrival time of the one or more data packets from the UE.

7. The method according to claim 1, further comprising: The data delivery deadline of the data traffic to be delivered to the network node is dynamically adjusted by a client application hosted on the UE based on a Quality of Service (QoS) flow or one or more Data Radio Bearer (DRB) QoS parameters.

8. The method according to claim 1, further comprising: providing the data delivery deadline to the UE by a client application hosted on the UE using a crosslink application programming interface, or The nominal time of arrival is determined by a client application hosted on the UE based on timing when the client application generates the one or more data packets.

9. The method according to claim 1, further comprising: receiving, by a client application hosted on the UE, a relative time offset of uplink timing that meets the data delivery deadline; as well as The data delivery deadline is determined based on the relative time offset.

10. The method according to claim 1, further comprising: calculating the nominal time of arrival of the data traffic based on incoming data packets received from a client application hosted on the UE; as well as The nominal arrival time is adjusted based on the timing of received incoming data packets.

11. The method according to claim 10, further comprising: marking a jitter or delay budget in a header of each of the incoming data packets received from the client application on the UE; as well as The nominal arrival time is adjusted based on the timing indicated by the jitter or the delay budget in the header of each of the data packets.

12. The method according to claim 1, further comprising: Additional time consumed by retransmission of the one or more data packets is estimated.

13. The method according to claim 1, further comprising: The data delivery deadline is converted into a radio access network (RAN) time domain to create a converted deadline for the network node.

14. The method of claim 13, wherein converting the data delivery deadline into the RAN time domain comprises converting the data delivery deadline from an application time domain into the RAN time domain based at least in part on one or more of: a deadline map associated with a Quality of Service (QoS) flow, One or more deadline notification messages, or One or more data radio bearer (DRB) QoS parameters associated with the deadline.

15. The method according to claim 1, further comprising: The one or more data packets from the UE are sent by the network node at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline or the nominal arrival time added to the nominal delay budget.

16. A user equipment (UE) for wireless communication, comprising: one or more memories; and one or more processors, the one or more processors being coupled, individually or in combination, to the one or more memories and configured to: Sending to a network node an indication of at least one of: a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from the UE, or a nominal time of arrival of the data traffic to be received at the network node, wherein the nominal time of arrival in combination with a nominal delay budget indicates when the network node is to transmit the one or more data packets received from the UE; as well as The one or more data packets are sent to the network node, wherein the one or more data packets include a protocol data unit (PDU).

17. A method for wireless communication performed by a network node, comprising: receiving, by the network node, an indication of a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE); receiving, by the network node, the one or more data packets from the UE; as well as The network node sends the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline. ， wherein the one or more data packets include a protocol data unit (PDU) 。 18. The method of claim 17, further comprising a notional delay budget.

19. The method of claim 17, wherein receiving, by the network node, the indication comprises: receiving said indication of said data delivery deadline for said data traffic to be delivered by said network node, or The indication of a nominal time of arrival of the data traffic to be received at the network node is received.

20. The method according to claim 19, further comprising: An indication of a periodicity or frequency of the data delivery deadline for data traffic to be delivered by the network node or the nominal arrival time of the data traffic to be received at the network node is received by the network node.

21. The method according to claim 20, further comprising: The data delivery deadline or the nominal arrival time of subsequent one or more data packets is estimated by the network node by adding a value corresponding to the indicated periodicity or frequency to a current data delivery deadline or a current nominal arrival time.

22. The method of claim 17, wherein the data delivery deadline or nominal arrival time covers a packet delay budget of an actual arrival time of the one or more data packets from the UE.

23. The method of claim 17, wherein the data delivery deadline of the data traffic to be delivered to the network node is dynamically adjusted based on a quality of service (QoS) flow or one or more data radio bearer (DRB) QoS parameters based on a client application hosted on the UE.

24. The method of claim 17, wherein a client application hosted on the UE provides the data delivery deadline to the UE using a crosslink application programming interface, or A nominal arrival time is determined based on the timing when the client application generates the one or more data packets.

25. The method of claim 17, wherein a relative time offset of uplink timing that satisfies the data delivery deadline is received by a client application hosted on the UE; and the method further comprises: The data delivery deadline is determined based on the relative time offset.

26. The method of claim 17, wherein calculating a nominal time of arrival of the data traffic based on incoming data packets received from a client application hosted on the UE; and The nominal arrival time is adjusted based on the timing of received incoming data packets.

27. The method according to claim 26, wherein marking a jitter or delay budget in a header of each of the incoming data packets received from the client application on the UE; and The nominal arrival time is adjusted based on the timing indicated by the jitter or the delay budget in the header of each of the data packets.

28. The method of claim 17, wherein Additional time consumed by retransmission of the one or more data packets is estimated.

29. The method of claim 17, wherein the data delivery deadline is converted into a radio access network (RAN) time domain to create a converted deadline for the network node.

30. A network node for wireless communication, comprising: one or more memories; and one or more processors, the one or more processors being coupled, individually or in combination, to the one or more memories and configured to: receiving an indication of a data delivery deadline for data traffic to be delivered by the network node, wherein the data delivery deadline indicates when the network node is to send one or more data packets received from a user equipment (UE), receiving the one or more data packets from the UE, and sending the one or more data packets from the UE at a time between an actual arrival time of the one or more data packets from the UE and the data delivery deadline, Wherein the one or more data packets include a protocol data unit (PDU).

Images