Methods, devices, and systems for delivering service characteristic information.

By integrating service characteristic information in downlink and uplink frames, the method addresses latency and overhead issues in wireless communication, optimizing resource scheduling for efficient data delivery in high-data-rate applications.

JP2026514555APending Publication Date: 2026-05-12ZTE CORP
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
ZTE CORP
Filing Date
2023-05-19
Publication Date
2026-05-12

AI Technical Summary

Technical Problem

Existing wireless communication technologies face challenges with long latency, increased signaling overhead, and long downtime in delivering service characteristic information, particularly for high-data-rate and low-latency applications like augmented reality (AR), virtual reality (VR), and video streaming, which require efficient congestion control and packet loss identification.

Method used

Incorporating service characteristic information in downlink user data frames and uplink feedback frames, such as PDU set sequence numbers, sizes, and discard indications, to optimize gNB wireless resource scheduling and improve latency and efficiency.

Benefits of technology

This approach reduces latency, minimizes signaling overhead, and enhances resource utilization efficiency, ensuring reliable data delivery for high-data-rate and low-latency applications.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2026514555000001_ABST
    Figure 2026514555000001_ABST
Patent Text Reader

Abstract

This disclosure describes methods, systems, and devices for distributing service characteristic information. One method involves a first network node transmitting downlink (DL) data to a second network node, the DL data including service characteristic information corresponding to a data burst containing at least one set of protocol data units (PDUs). Another method involves a second network node receiving DL data from the first network node, the DL data including service characteristic information corresponding to a data burst containing at least one set of PDUs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This disclosure generally relates to wireless communication. In particular, this disclosure relates to methods, devices, and systems for delivering service characteristic information.

Background Art

[0002] Background Wireless communication technologies are leading the world towards a more connected and networked society. High-speed and low-latency wireless communication depends on efficient network resource management and allocation between user equipment and wireless access network nodes (including but not limited to base stations). New-generation networks are expected to provide high-speed, low-latency, and ultra-high reliability communication capabilities to meet the requirements from various industries and users.

[0003] Some devices and applications, such as applications including extended reality (XR), virtual reality (VR), mixed reality (MR), video streaming, etc., require high data rates and low latency. Efficient and robust congestion control and mitigation mechanisms are important to support these applications. Identification and recognition of dropped data packets can be utilized by the receiving entity so that the receiving entity can recognize that these data packets were dropped as early as possible. Since these types of services require high data rates and low latency, service characteristic information is used to optimize gNB wireless resource scheduling, for example, to improve scheduling efficiency. When scheduling is improved, data rates and latency can be ensured. There are many problems / challenges associated with delivering service characteristic information between wireless communication nodes and / or between a wireless communication node and a wireless communication device. The problems / challenges may include and / or result in long latency, more signaling overhead, and / or long interruption times.

[0004] This disclosure describes various embodiments for delivering service characteristic information in order to address at least one of the aforementioned problems / challenges. The various embodiments in this disclosure can achieve low latency, low overhead, and short interruption times, thereby improving the efficiency and / or performance of wireless communications. [Overview of the project] [Means for solving the problem]

[0005] overview This document relates to methods, systems, and devices for wireless communications, more specifically, for delivering service characteristic information. Various embodiments of this disclosure may improve resource utilization efficiency, increase the latency performance of wireless communications, and / or save energy consumption of user equipment.

[0006] In one embodiment, the disclosure describes a method for wireless communication. The method includes a first network node transmitting downlink (DL) data to a second network node, the DL data including service characteristic information corresponding to a data burst containing at least one set of protocol data units (PDUs).

[0007] In another embodiment, the disclosure describes a method for wireless communication. The method includes a second network node receiving downlink (DL) data from a first network node, the DL data including service characteristic information corresponding to a data burst comprising at least one set of protocol data units (PDUs).

[0008] In some other embodiments, the device for wireless communication may include a memory for storing instructions and a processing circuit communicating with the memory. When the processing circuit executes an instruction, the processing circuit is configured to perform the method described above.

[0009] In some other embodiments, a device for wireless communication may include a memory that stores instructions and a processing circuit that communicates with the memory. When the processing circuit executes the instructions, the processing circuit is configured to perform the above-described method.

[0010] In some other embodiments, a computer-readable medium includes instructions that, when executed by a computer, cause the computer to perform the above-described method. The computer-readable medium may include a non-transitory computer-readable medium.

[0011] The above and other aspects and their implementations are described in more detail in the drawings, the body of the specification, and the claims.

Brief Description of the Drawings

[0012] [Figure 1A] A schematic diagram of a wireless communication system is shown.

[0013] [Figure 1B] A schematic diagram of a base station is shown.

[0014] [Figure 1C] Another schematic diagram of a base station is shown.

[0015] [Figure 1D] A schematic diagram of communication between two network nodes is shown.

[0016] [Figure 1E] A schematic diagram of an application data unit structure is shown.

[0017] [Figure 2] An example of a network node is shown.

[0018] [Figure 3] An example of a user equipment is shown.

[0019] [Figure 4A] Shows a flowchart of a method for wireless communication.

[0020] [Figure 4B] Shows a flowchart of another method for wireless communication.

[0021] [Figure 5] Shows a flowchart of an exemplary embodiment for wireless communication.

[0022] [Figure 6] Shows a flowchart of another exemplary embodiment for wireless communication.

Best Mode for Carrying Out the Invention

[0023] Detailed Description The present disclosure will be described in detail below with reference to the accompanying drawings, which form a part of the present disclosure and illustrate specific examples of embodiments. However, it should be noted that the present disclosure may be embodied in various different forms, and thus the subject matter encompassed or claimed is not intended to be limited to any of the embodiments described below.

[0024] Throughout this specification and the claims, terms may have nuances implied or suggested in context beyond their expressly stated meanings. Similarly, the phrases “in one embodiment” or “in several embodiments” used herein do not necessarily refer to the same embodiment, and the expressions “in another embodiment” or “in other embodiments” used herein do not necessarily refer to different embodiments. The phrases “in one implementation” or “in several implementations” used herein do not necessarily refer to the same implementation, and the expressions “in another implementation” or “in other implementations” used herein do not necessarily refer to different implementations. For example, the claimed subject matter is intended to include typical embodiments or combinations of implementations, either in whole or in part.

[0025] In general, terms can be understood at least partially from their use in context. For example, terms such as “and,” “or,” and “and / or,” when used herein, may have a variety of meanings that may at least partially depend on the context in which such terms are used. Typically, when “or” is used to relate a list such as A, B, or C, it is intended to mean A, B, and C, used here in an inclusive sense, as well as A, B, or C, used here in an exclusive sense. Furthermore, the terms “one or more” or “at least one” as used herein may be used at least partially, depending on the context, to describe any feature, structure, or characteristic in a singular sense, or to describe a combination of features, structures, or characteristics in a plural sense. Similarly, terms such as “a,” “an,” and “the” can also be understood, at least partially, depending on the context, to convey either a singular or plural usage. Furthermore, the terms “based on” or “determined by” may be understood not necessarily to convey an exclusive set of factors, but rather, depending at least partially on the context, may allow for the presence of additional factors that are not necessarily explicitly stated.

[0026] This disclosure describes various embodiments for distributing service characteristic information.

[0027] Wireless communication technology is driving the world towards an increasingly connected and networked society. High-speed and low-latency wireless communication relies on efficient network resource management and allocation between user equipment and wireless access network nodes (including, but not limited to, base stations). Next-generation networks are expected to provide high-speed, low-latency, and ultra-high-reliability communication capabilities, meeting the requirements of various industries and users.

[0028] Some devices and applications, including augmented reality (XR), virtual reality (VR), mixed reality (MR), and video streaming, require high data rates and low latency. Efficient and robust congestion control and mitigation mechanisms are crucial to supporting these applications. Identification and recognition of dropped data packets can be utilized by receiving entities so that they can recognize that these data packets have been dropped as soon as possible. Because these types of services require high data rates and low latency, service characteristic information is used to optimize gNB radio resource scheduling, for example, by improving scheduling efficiency. Improved scheduling can ensure data rates and latency. There are many problems / challenges associated with distributing service characteristic information between wireless communication nodes and / or between wireless communication nodes and wireless communication devices. These problems / challenges include, and may result in, long latency, increased signaling overhead, and / or long downtime.

[0029] In various embodiments, the method may include service characteristic information in downlink (DL) user data, for example, in a DL USER DATA frame. The service characteristic information may include some or all of the following: one or more PDU set sequence numbers (SNs), one or more PDU set sizes in bytes, one or more PDU SNs within a PDU set, one or more indications of the end PDU of a PDU set, one or more PDU set severity (PSIs), and / or one or more data burst end indications in the header of the last PDU of a data burst.

[0030] In various embodiments, the method may include indicating user data, for example, one or more discarded NR PDCP PDUs in the DL DATA DELIVERY STATUS frame. The discard indication information may include some or all of one or more DL discarded NR PDCP PDU SN flags, one or more DL discarded block information flags, one or more DL discarded NR PDCP PDU SNs, one or more DL discarded block counts, one or more discarded NR PDCP PDU SN start, and / or one or more discarded block sizes indicating the number of NR PDCP PDUs to be discarded, counted from the start SN.

[0031] In various embodiments, the method may include indicating user data, for example, one or more discarded NR PDCP PDUs in the DL DATA DELIVERY STATUS frame. The discard indication information may include some or all of one or more DL discarded NR PDCP PDU set SN flags, one or more DL discarded PDU set block information flags, one or more DL discarded NR PDCP PDU set SNs, one or more DL discard counts of a PDU set block, one or more discarded NR PDCP PDU set SN starts, and / or one or more discarded PDU set block sizes indicating the number of NR PDCP PDU sets to be discarded, counted from the start SN.

[0032] Figure 1A shows an exemplary cellular wireless communication network 100 (also called a wireless communication system) including a core network 110, a radio access network (RAN) 120, and one or more user equipment (UEs) 130.

[0033] RAN120 further includes a plurality of base stations 122 and 124. The base stations 122 and one or more user equipment (UEs) 130 communicate with each other via an over-the-air (OTA) radio communication resource 140. The wireless communication network 100 may be implemented as, for example, a 2G, 3G, 4G / LTE, 5G, or 6G cellular communication network. Correspondingly, the base stations 122 and 124 may be implemented as a 2G base station, a 3G nodeB, an LTE eNB, or a 5G New Radio (NR) gNB. The UEs 130 may be implemented as mobile or fixed communication devices for accessing the wireless communication network 100. One or more UEs 130 may include, but are not limited to, mobile phones, Internet of Things (IoT) devices, machine-type communication (MTC) devices, laptop computers, tablets, personal digital assistants, wearable devices, distributed remote sensor devices, roadside assistance equipment, and desktop computers. Instead of the context of a cellular wireless network, RAN120 and the principles described later may be implemented as other types of wireless access networks, such as Wi-Fi, Bluetooth®, ZigBee®, and WiMAX networks.

[0034] In the exemplary wireless communication system 100 shown in Figure 1A, one or more UEs 130 may connect to a base station 122 via an OTA interface 140 and establish a communication session. The communication session between the UEs 130 and the base station 122 may utilize downlink (DL) transmission resources and / or uplink (UL) transmission resources. DL transmission resources carry data from the base station 122 to the UEs 130, and UL transmission resources carry data from the UEs 130 to the base station 122. Under certain conditions, for example, when the base station 122 is unavailable or when the UEs 130 move into the coverage of base station 124, one or more UEs 130 may connect to the base station 122 and establish a communication session with the base station 122.

[0035] Referring to Figure 1B, a base station (e.g., gNB) 122 may have a control distribution isolation structure which may include a control unit (CU) 160 and one or more distributed units (DU) 171 and / or 172. 5GCs may communicate with the gNB via NG interfaces between them. gNBs and other gNBs may communicate via Xn-C interfaces. gNB-CUs may communicate with one or more gNB-DUs via F1 interfaces.

[0036] In some implementations, in a CU / DU partitioned architecture, a gNB may consist of a gNB central unit (gNB-CU) and one or more gNB distributed units (gNB-DU). The gNB-CU and gNB-DU are connected via an F1 interface. The gNB-CU is defined as a logical node that hosts the gNB's RRC, SDAP, and PDCP protocols, or the en-gNB's RRC and PDCP protocols, and controls the operation of one or more gNB-DUs. The gNB-DU is defined as a logical node that hosts the gNB or en-gNB's RLC, MAC, and PHY layers, and its operation is partially controlled by the gNB-CU. A single gNB-DU supports one or more cells. A single cell is supported by only one gNB-DU.

[0037] In some implementations, a gNB-CU is defined as a logical node that hosts the RRC, SDAP, and PDCP protocols of the gNB, or the RRC and PDCP protocols of the en-gNB, controlling the operation of one or more gNB-DUs. A gNB-DU is defined as a logical node that hosts the RLC, MAC, and PHY layers of the gNB or en-gNB, and its operation is partially controlled by the gNB-CU. A single gNB-DU supports one or more cells. A single cell can be supported by only one gNB-DU.

[0038] Figure 1C shows another schematic diagram of a base station (e.g., gNB) 150. The gNB may have a control distribution isolation structure which may include a control unit (CU) 160 and one or more distributed units (DUs) (e.g., 171 and / or 172). The CU may include a control plan (gNB-CU-CP) 161 and one or more user plans (gNB-CU-UP) 162. The gNB-CU-CP 161 may be referred to as CU-CP or CP, and the gNB-CU-UP 162 may be referred to as CU-UP or UP. The CU-CP 161 can communicate with one or more CU-UPs 162 via an E1 interface between them. The CU-CP 161 can communicate with one or more DUs via an F1-C interface, and each of the one or more CU-UPs 162 can communicate with one or more DUs via an F1-U interface.

[0039] In several implementations, a gNB can consist of a gNB-CU-CP, multiple gNB-CU-UPs, and multiple gNB-DUs. A gNB-CU-CP is connected to a gNB-DU via an F1-C interface. A gNB-CU-UP is connected to a gNB-DU via an F1-U interface. A gNB-CU-UP is connected to a gNB-CU-CP via an E1 interface. A single gNB-DU is connected to only one gNB-CU-CP. A single gNB-CU-UP is connected to only one gNB-CU-CP.

[0040] In some implementations, for flexibility, a gNB-DU and / or gNB-CU-UP may be connected to multiple gNB-CU-CPs by an appropriate implementation. In some implementations, one gNB-DU can be connected to multiple gNB-CU-UPs under the control of the same gNB-CU-CP. In some implementations, one gNB-CU-UP can be connected to multiple DUs under the control of the same gNB-CU-CP.

[0041] In some implementations, connectivity between gNB-CU-UP and gNB-DU is established by gNB-CU-CP using bearer context management functionality.

[0042] In some implementations, the gNB-CU-CP selects the appropriate gNB-CU-UP for the service requested by the UE. In some implementations, multiple CU-UPs may belong to the same security domain.

[0043] In some implementations, data transfer between gNB-CU-UP during a handover within a gNB-CU-CP can be supported by Xn-U.

[0044] In several implementations, downlink user data may be transferred under specific conditions. One purpose of the downlink user data transfer procedure is to provide NR-U-specific sequence number information when transferring user data that carries DL NR PDCP PDUs from a node hosting an NR PDCP entity to a corresponding node. Figure 1D shows a schematic diagram of communication between two network nodes illustrating the downlink user data transfer and downlink data distribution conditions, where DL user data is transmitted by the node hosting the NR PDCP and received by the corresponding node.

[0045] In some implementations, the frame format may be defined, for example, to enable the corresponding node to detect lost NR-U packets and may be associated with the forwarding of downlink PDCP PDUs. Table 1 shows an example for each DL USER DATA frame. [Table 1-1] [Table 1-2]

[0046] In several implementations, the downlink data delivery status may be transmitted. One purpose of the downlink data delivery status procedure is to provide feedback from the corresponding node to the node hosting the NR PDCP entity, so that the node hosting the NR PDCP entity can control the downlink user data flow via the corresponding node for each data radio bearer. The corresponding node may also transmit uplink user data for the associated data radio bearer to the node hosting the NR PDCP entity, along with the DL DATA DELIVERY STATUS frame within the same GTP-U PDU. Table 2 shows an example for each DL DATA DELIVERY STATUS frame, which serves as an example of how the frame is structured when all optional information elements (IE) (i.e., information elements whose presence is indicated by the relevant flag) are present. [Table 2-1] [Table 2-2]

[0047] In various embodiments / implementations of this disclosure, the XR service may include video streaming represented by a plurality of application data units, each application data unit consisting of a plurality of application frames (e.g., I-frames, P-frames, B-frames). Referring to Figure 1E, one application frame may include at least one IP packet that can be represented by a set of PDUs in a QoS flow (e.g., a “media unit” or “slice”, a sequence of packets containing all the information necessary to reconstruct a video frame, corresponding to video / audio frames / tiles, haptic application information, e.g., GTP-U, NG user plane interface (NG-U), Xn user plane (Xn-U) interface, or user data from the Non-Access Layer (NAS). For example, one of the application frames (I1) may contain n PDUs (i.e., I 11 ,I 12 ,I 13 ,...I 1n It can contain a first PDU set (PDU set 1) which includes ) where n is a positive integer. In another example, another application frame (B2) of the application frames may contain m PDUs (i.e., B 11 ,B 12 ,B 13 ,...B 1m It may include a second PDU set (PDU set 2) containing ), where m is a positive integer.

[0048] In some implementations, an I-frame is a keyframe that stores / transmits all the data necessary to display that frame. Typically, I-frames are interspersed with P-frames and B-frames in compressed video. The more I-frames included, the better the video quality. However, I-frames contain the most bits and therefore occupy more space on the storage medium and consume more wireless resources to deliver them over the Uu interface. A P-frame is a delta frame and contains only data that has changed from the preceding I-frame (such as changes in color or content). For this reason, a P-frame relies on the preceding I-frame to fill most of its data. A B-frame is also a delta frame and contains only data that has changed from the previous frame and is different from the data in the very next frame. Therefore, a B-frame relies on the preceding and succeeding frames to fill most of its data.

[0049] In various embodiments / implementations of this disclosure, a set of protocol data units (PDUs) may be a set containing one or more PDUs carrying a payload of one unit of information generated at the application level (e.g., a frame or video slice for an XRM service). A data burst may contain one or more sets of PDUs generated and transmitted by an application over a short period of time. Periodicity may be the duration between the start of two data bursts. Burst arrival time may be the latest possible time when the first packet of a data burst arrives at either the RAN entry (downlink flow direction) or the UE exit interface (uplink flow direction). In some implementations, all PDUs in a set of PDUs are required by the application layer to use the corresponding unit of information. In other implementations, the application layer can still recover all or part of the information unit if some PDUs are missing.

[0050] In various embodiments / implementations of this disclosure, PDU may refer to an NR-U PDU or a PDCP PDU contained within an NR-U PDU. In some implementations, the core network may transmit an NG-U PDU (which is also a GTP-U PDU) to a base station. The internal data packet is an IP packet. The protocol may modify the GTP-U extension header, and the base station (e.g., CU) may, after acquiring the core network's PDU, extract the data packet, encapsulate it in a PDCP PDU, add a GTP-U extension header (encapsulated in the GTP-U PDU and also in the NR-U PDU), and further add a PDCP header to the DU. In various implementations, an NR PDCP PDU may be referred to as a PDCP PDU, and / or a PDCP PDU may contain an NR PDCP PDU.

[0051] Figure 2 shows an example of an electronic device 200 implementing a network base station. The exemplary electronic device 200 may include a radio transmission / reception (Tx / Rx) circuit 208 for transmitting / receiving communications with UEs and / or other base stations. The electronic device 200 may also include a network interface circuit 209 for the base station to communicate with other base stations and / or core networks, such as optical or wired interconnects, Ethernet®, and / or other data transmission media / protocols. The electronic device 200 may optionally include an input / output (I / O) interface 206 for communicating with operators, etc.

[0052] The electronic device 200 may also include a system circuit 204. The system circuit 204 may include a processor 221 and / or memory 222. Memory 222 may include an operating system 224, instructions 226, and parameters 228. Instructions 226 may be configured so that one or more of the processors 124 perform the functions of a network node. Parameters 228 may include parameters to support the execution of instructions 226. For example, parameters may include network protocol settings, bandwidth parameters, radio frequency mapping assignments, and / or other parameters.

[0053] Figure 3 shows an example of an electronic device for implementing a terminal device 300 (e.g., a user device (UE)). The UE 300 may be a mobile device, such as a smartphone or a mobile communication module installed in a vehicle. The UE 300 may include a communication interface 302, a system circuit 304, an input / output interface (I / O) 306, a display circuit 308, and storage 309. The display circuit may include a user interface 310. The system circuit 304 may include any combination of hardware, software, firmware, or other logic / circuits. The system circuit 304 may be implemented using, for example, one or more system-on-a-chip (SoCs), application-specific integrated circuits (ASICs), separate analog and digital circuits, and other circuits. The system circuit 304 may be part of an implementation of any desired function in the UE 300. In this regard, the system circuit 304 may include logic to facilitate, for example, decoding and playback of music and video, e.g., decoding and playback of MP3, MP4, MPEG, AVI, FLAC, AC3, or WAV; execution of applications; acceptance of user input; storage and retrieval of application data; establishment, maintenance, and termination of data connections for cellular phone calls or, for example, internet connections; establishment, maintenance, and termination of wireless network connections, Bluetooth® connections, or other connections; and display of relevant information on the user interface 310. The user interface 310 and the input / output (I / O) interface 306 may include a graphical user interface, a touch sensor display, haptic feedback or other haptic output, voice or facial recognition input, buttons, switches, speakers, and other user interface elements. Further examples of I / O interface 306 include microphones, video and still image cameras, temperature sensors, vibration sensors, rotation and orientation sensors, headset and microphone input / output jacks, Universal Serial Bus (USB) connectors, memory card slots, radiation sensors (e.g., IR sensors), and other types of inputs.

[0054] Referring to Figure 3, the communication interface 302 may include a radio frequency (RF) transmission (Tx) and reception (Rx) circuit 316 that handles the transmission and reception of signals via one or more antennas 314. The communication interface 302 may include one or more transceivers. The transceivers may be wireless transceivers that include a modulation / demodulation circuit, a digital-to-analog converter (DAC), a shaping table, an analog-to-digital converter (ADC), filters, waveform shapers, filters, preamplifiers, power amplifiers, and / or other logic for transmission and reception via one or more antennas or (in some devices) via a physical (e.g., wired) medium. The signals transmitted and received may conform to one of a variety of arrays of format, protocol, modulation (e.g., QPSK, 16-QAM, 64-QAM, or 256-QAM), frequency channels, bitrate, and encoding. As a specific example, the communication interface 302 may include transceivers that support transmission and reception under 2G, 3G, BT, WiFi, Universal Mobile Telecommunications System (UMTS), High-Speed ​​Packet Access (HSPA)+, 4G / Long-Term Evolution (LTE), 5G standards, and / or 6G standards. However, the technologies described below are applicable to other wireless communication technologies, whether they originate from the Third Generation Partnership Project (3GPP®), the GSM® Association, 3GPP2, IEEE, or other partnerships or standardization bodies.

[0055] Referring to Figure 3, the system circuit 304 may include one or more processors 321 and a memory 322. The memory 322 stores, for example, an operating system 324, instructions 326, and parameters 328. The processor 321 is configured to execute instructions 326 to perform desired functions for the UE300. Parameters 328 may provide and specify setting and operation options for instructions 326. The memory 322 may also store any BT, WiFi, 3G, 4G, 5G, 6G, or other data that the UE300 transmits or receives via the communication interface 302. In various implementations, the system power of the UE300 may be supplied by a battery or energy storage device such as a transformer.

[0056] This disclosure describes various embodiments for distributing service characteristic information that may be partially or fully implemented on the network base stations and / or user equipment described in Figures 2 and 3.

[0057] Referring to Figure 4A, the disclosure describes various embodiments of Method 400 for wireless communication. Method 400 may include a step 410 in which a first network node transmits downlink (DL) data to a second network node, the DL data including service characteristic information corresponding to a data burst containing at least one set of protocol data units (PDUs).

[0058] In some implementations, method 400 may further include step 420, in which a first network node receives uplink (UL) feedback from a second network node, the UL feedback including information of at least one discarded packet data convergence protocol (PDCP) PDU.

[0059] Referring to Figure 4B, the disclosure describes various embodiments of Method 450 for wireless communication. Method 450 may include a step 460 in which a second network node receives downlink (DL) data from a first network node, the DL data including service characteristic information corresponding to a data burst containing at least one set of protocol data units (PDUs).

[0060] In some implementations, method 450 may further include step 470, in which a second network node transmits uplink (UL) feedback to the first network node, the UL feedback including information of at least one discarded packet data convergence protocol (PDCP) PDU.

[0061] In several implementations, the first network node and the second network node each include either a first radio access network (RAN) node and a second RAN node, or a central unit (CU) and a distributed unit (DU) of a RAN node, DL data includes user plane frames, and UL feedback includes user plane frames.

[0062] In some implementations, DL data includes DL user data frames, and UL feedback includes DL data delivery status frames.

[0063] In some implementations, in response to network congestion, at least one discarded PDCP PDU includes at least one PDCP PDU in a low-priority PDU set, and in response to PDCP PDUs in a PDU set not being successfully delivered to the UE and the PDU set requiring integrated processing, at least one discarded PDCP PDU includes all other PDCP PDUs in the PDU set.

[0064] In some implementations, network congestion can be considered as congestion between the gNB and the UE. In some implementations, network congestion can also be considered as a cell being in a congested state, including cell radio congestion, cell hardware congestion, etc.

[0065] In some implementations, DL data includes a service characteristic information flag indicating whether the DL data includes service characteristic information, and / or, in response to the service characteristic information flag indicating that the DL data includes service characteristic information, the service characteristic information includes at least one of the following: PDU set sequence number, PDU set size, PDU sequence number within the PDU set, a first indicator indicating that it is the end PDU of the PDU set, PDU set importance (PSI), and a second indicator indicating that it is the end PDU of a data burst.

[0066] In some implementations, DL data includes a service characteristics information flag indicating whether the DL data includes service characteristics information, and / or, in response to the service characteristics information flag indicating that the DL data includes service characteristics information, the service characteristics information includes the PDU set size and an indicator indicating that it is the end PDU of a data burst.

[0067] In some implementations, DL data includes a service characteristics information flag indicating whether the DL data includes service characteristics information, and / or, in response to the service characteristics information flag indicating that the DL data includes service characteristics information, the service characteristics information includes a PDU set sequence number, a PDU sequence number within the PDU set, an indicator indicating that it is the end PDU of the PDU set, and a PDU set importance (PSI).

[0068] In some implementations, DL data includes a first indicator indicating that it is the end PDU of a PDU set, and a second indicator indicating that it is the end PDU of a data burst.

[0069] In some implementations, the DL data further includes a first flag for a first indicator and a second flag for a second indicator, the first flag indicating whether the DL data includes the first indicator and the second flag indicating whether the DL data includes the second indicator.

[0070] In some implementations, the UL feedback includes a first flag indicating whether the UL feedback includes a PDU sequence number, and a second flag indicating whether the UL feedback includes PDU block information. In response to the first flag indicating that the UL feedback includes a PDU sequence number, the UL feedback includes a PDU sequence number indicating a range of PDCP PDUs from which multiple PDCP PDUs are discarded, the PDCP PDU range being based on the PDU sequence number, and / or in response to the second flag indicating that the UL feedback includes PDU block information, the UL feedback includes PDU block information indicating one or more PDCP PDU blocks that are being discarded.

[0071] In some implementations, the PDU block information includes N and N sets of block start numbers and block sizes, where N is a positive integer indicating the number of PDCP PDU blocks to be discarded, the block start number indicates the starting sequence number of the PDCP PDU block to be discarded, and the block size indicates the number of PDCP PDUs counted from the starting sequence number to be discarded.

[0072] In some implementations, the UL feedback includes a first flag indicating whether the UL feedback includes a PDU set sequence number, and a second flag indicating whether the UL feedback includes PDU set block information. In response to the first flag indicating that the UL feedback includes the PDU set sequence number, the UL feedback includes a PDU set sequence number indicating a range of PDCP PDU sets from which multiple PDCP PDU sets are discarded. In response to the second flag indicating that the PDCP PDU set range is based on the PDU set sequence number and / or that the UL feedback includes PDU set block information, the UL feedback includes PDU set block information indicating one or more PDCP PDU set blocks that are being discarded.

[0073] In some implementations, the PDU set block information includes N and N sets of block start numbers and block sizes, where N is a positive integer indicating the number of PDCP PDU set blocks to be discarded, the block start number indicates the starting sequence number of the PDCP PDU set block to be discarded, and the block size indicates the number of PDCP PDU sets counted from the starting sequence number to be discarded.

[0074] This disclosure describes various embodiments using a typical example for delivering service characteristic information. The typical embodiment provides an example for this disclosure and does not impose any limitations on this disclosure. In the embodiments and implementations of this disclosure, any steps and / or operations may be combined or arranged in any quantity or order as needed. Two or more steps and / or operations may be performed in parallel. The embodiments and implementations of this disclosure may be used separately or combined in any order. Furthermore, any one of the methods (or embodiments), wireless communication nodes, and wireless communication devices may be implemented by processing circuits (e.g., one or more processors or one or more integrated circuits). Embodiment Set I [Table 3]

[0075] Various embodiments of this disclosure include a service characteristic information presence flag to indicate the presence of service characteristic information. In some implementations, the field length may include 1 bit, which is a non-limiting example, or other field length values ​​depending on the final design, where a value of 1 may be used to indicate the presence of service characteristic information, and a value of 0 may be used to indicate the absence of service characteristic information. Table 3 shows non-limiting examples including one or more service characteristic information presence flags.

[0076] In some implementations, service characteristic information may include some or all of the following: PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the last PDU in the PDU set, PDU set severity (PSI), and data burst end indication in the header of the last PDU in the data burst.

[0077] In some implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU of the PDU set, or PDU set importance (PSI) are identifiers that identify whether PDU set information and PDUs are in the same PDU set.

[0078] In some implementations, if the network is congested, one or all of the NR PDCP PDUs within the same set of PDUs of lower importance may be discarded. Therefore, PDU set information and identification information can be used to determine which PDUs should be discarded. In some implementations, network congestion may be considered congestion between the gNB and the UE. In some implementations, network congestion may also be considered a cell being in a congested state, including cell radio congestion, cell hardware congestion, etc.

[0079] In some implementations, when there are unified processing requirements for a PDU set, and when one or more NR PDCP PDUs within a PDU set are not successfully delivered to the UE, all other NR PDCP PDUs belonging to the same PDU set may be discarded. PDU set information and identification information can also be used to determine whether the NR PDCP PDUs should be discarded in this case.

[0080] In some implementations, the integrated processing requirement means that all PDUs in a PDU set are required by the application layer to use the PDU set.

[0081] In some implementations, the data burst end indication in the header of the last PDU of a data burst is used to configure cDRX, semi-persistent scheduling (SPS), or configuration grant (CG), which is determined by the implementation. cDRX refers to connected mode discontinuous reception (DRX), and there are two types of cDRX: short DRX cycles and long DRX cycles.

[0082] In some implementations, the PDU set sequence number indicates the PDU set sequence number. In some implementations, the field length may include, in non-restrictive examples, 1 octet / byte, and may include other field length values ​​depending on the final design.

[0083] In some implementations, the PDU set size in bytes indicates the size of the PDU set used to verify whether all PDUs within the PDU set have been successfully received. In some implementations, the field length may include M octets / byte, where M is a positive integer.

[0084] In some implementations, the PDU SN within a PDU set indicates the PDU sequence number. In some implementations, its field length may include, in non-restrictive examples, 3 octets / byte, or other field length values ​​depending on the final design.

[0085] In some implementations, an indication for the last PDU in a PDU set is used to indicate that it is the last PDU in the PDU set. In some implementations, the field length may include 1 bit, which is an unrestricted example, or may include other field length values ​​depending on the final design, with a value of 1 used to indicate that it is the last PDU in the PDU set, and a value of 0 used to indicate that it is not the last PDU in the PDU set. In some implementations, including this indication may indicate that it is the last PDU in the PDU set, and not including this indication may indicate that it is not the last PDU in the PDU set.

[0086] In some implementations, PDU set importance (PSI) is used to identify the relative importance of a PDU set compared to other PDU sets in a QoS flow. RAN may use it to discard PDU set level packets in the presence of congestion, e.g., discarding PDU sets with lower PSIs. All PDUs within the same PDU set have the same PSI. In some implementations, its field length may include 1 bit, a non-restrictive example, or other field length values ​​depending on the final design; a value of 1 may be used to indicate that this PDU set is important, and a value of 0 may be used to indicate that this PDU set is not important. In some implementations, including this indication may indicate that the PDU set is important, and not including this indication may indicate that the PDU set is not important. In some implementations, the field may include 4 bits, which is an unrestricted example, and may include other field length values ​​depending on the final design. A value of 0 may be used to indicate that this PDU set is the most important, and a value of 15 may be used to indicate that this PDU set is the least important.

[0087] In some implementations, a data burst end indication in the header of the last PDU in a data burst is used to indicate that this is the last PDU in the data burst. In some implementations, the field length may include 1 bit, which is an unrestricted example, or may include other field length values ​​depending on the final design, with a value of 1 used to indicate that this is the last PDU in the data burst, and a value of 0 used to indicate that this is not the last PDU in the data burst. In some implementations, including this indication may indicate that this is the last PDU in the data burst, and not including this indication may indicate that this is not the last PDU in the data burst.

[0088] In one non-restrictive example, referring to Figure 1E, an I1 frame contains I11, I12, ..., I1n packets (PDUs) corresponding to PDU set 1. I11 represents a PDU set sequence number of 1 and a PDU SN of 1 in the PDU set. I12 represents a PDU set sequence number of 1 and a PDU SN of 2 in the PDU set. The indication for the end PDU of a PDU set is 1, indicating that this PDU is the last PDU in the PDU set. The indication for the end PDU of a PDU set is 0, indicating that this PDU is not the last PDU in the PDU set. The indication for the end PDU of a PDU set in I1n is 1, and the indication for the end PDU of a PDU set in I11, I12, ..., I1n-1 is 0. In some implementations, the indication of the end PDU in the PDU set at I1n is 1, and there is no indication of the end PDU in the PDU set at I11, I12, ..., I1n-1.

[0089] In some implementations, the PSI for I1 can be 1, and the PSI for B2 can be 0, indicating that I1 is more important than B2. Since I11, I12, ..., I1n have the same level of importance, their PSIs can be included in either I11, I1n, or all PDUs (I11, I12, ..., I1n all have a PSI value of 1).

[0090] In some implementations, the PSI for I1 can be 0, and the PSI for B2 can be 15, indicating that I1 is more important than B2. Since I11, I12, ..., I1n have the same level of importance, their PSIs can be included in either I11 or I1n or all PDUs (I11, I12, ..., I1n all have a PSI value of 0).

[0091] In some implementations, the byte-based PDU set size of I1 is the sum of the sizes of I11, I12, ..., I1n.

[0092] In some implementations, the data burst end indication in the header of the last PDU in a data burst is 1, indicating that this PDU is the last PDU in the data burst. The data burst end indication in the header of the last PDU in a data burst is 0, indicating that this PDU is not the last PDU in the data burst. If I1n is the last PDU in a data burst, the data burst end indication in I1n is 1, and the data burst end indications in I11, I12, ..., I1n-1 are 0. In some implementations, the data burst end indication in I1n is 1, and there is no end PDU indication in I11, I12, ..., I1n-1.

[0093] Embodiment Set II Various embodiments of this disclosure include a service characteristic information presence flag to indicate the presence of service characteristic information. In some implementations, the field length may include 1 bit, which is a non-limiting example, or other field length values ​​depending on the final design, where a value of 1 may be used to indicate the presence of service characteristic information, and a value of 0 may be used to indicate the absence of service characteristic information.

[0094] In some implementations, service characteristic information may include the PDU set size in bytes and some or all of the data burst end indication in the header of the last PDU in the data burst.

[0095] In some implementations, service characteristic information may include the PDU set sequence number, the PDU SN within the PDU set, the indication of the end PDU in the PDU set, and some or all of the PDU set importance (PSI).

[0096] In various implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU in the PDU set, PDU set importance (PSI), and data burst end indication in the header of the last PDU in the data burst can have similar meanings and can be implemented in the same way as any other embodiment / implementation described herein. Embodiment Set III [Table 4-1] [Table 4-2]

[0097] In various embodiments of this disclosure, a frame may include indication of the end PDU of a PDU set and / or indication of a data burst end indication in the header of the last PDU of a data burst within the frame. Table 4 shows non-limiting examples.

[0098] In some implementations, the data burst end indicator in the header of the last PDU in a data burst is 1, indicating that this PDU is the last PDU in the data burst. The data burst end indicator in the header of the last PDU in a data burst is 0, indicating that this PDU is not the last PDU in the data burst. In some implementations, including this indicator may indicate that it is the last PDU in the data burst, and not including this indicator may indicate that it is not the last PDU in the data burst.

[0099] In some implementations, the indication for the last PDU in a PDU set is 1, indicating that this PDU is the last PDU in the PDU set. The indication for the last PDU in a PDU set is 0, indicating that this PDU is not the last PDU in the PDU set. In some implementations, including this indication may indicate that this is the last PDU in the PDU set, and not including this indication may indicate that this is not the last PDU in the PDU set.

[0100] In some implementations, the indication of the end PDU in a PDU set may not be included in the frame when it is "0".

[0101] In some implementations, the data burst end indication in the header of the last PDU in a data burst may not be included in the frame when it is "0".

[0102] In various implementations, the indication of the end PDU in a PDU set and the data burst end indication in the header of the last PDU in a data burst can have the same meaning and can be implemented in the same way as any of the other embodiments / implementations described herein. Embodiment Set IV [Table 5-1] [Table 5-2]

[0103] In various embodiments of this disclosure, the frame may include, and may not include, a PDU set end PDU presence flag and a data burst end indication presence flag. Table 5 shows non-limiting examples.

[0104] In some implementations, this example may differ from the example in Embodiment Set III, where the previous example uses one bit to include the end PDU of the PDU set and one bit to include the indication of the end of the data burst in the header of the last PDU of the data burst, while this example includes this information in an information element field.

[0105] In some implementations, a data burst end indication presence flag and a PDU set end PDU indication presence flag are included. The data burst end indication presence flag indicates the presence of a data burst end indication. In some implementations, its field length may include 1 bit (a non-restrictive example) or other field length values ​​depending on the final design, and a value of 1 may be used to indicate the presence of a data burst end indication, while a value of 0 may be used to indicate the absence of a data burst end indication. The PDU set end PDU indication presence flag indicates the presence of an indication for the PDU set end PDU. In some implementations, its field length may include 1 bit (a non-restrictive example) or other field length values ​​depending on the final design, and a value of 1 may be used to indicate the presence of an indication for the PDU set end PDU, while a value of 0 may be used to indicate the absence of an indication for the PDU set end PDU.

[0106] In various implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU in the PDU set, PDU set importance (PSI), and data burst end indication in the header of the last PDU in the data burst can have similar meanings and can be implemented in the same way as any other embodiment / implementation described herein.

[0107] Embodiment Set V Various embodiments in this disclosure describe DL USER DATA transmitted from one network node to another. Figure 5 shows a non-limiting example between a first node (node ​​1) 591 and a second node (node ​​2) 592.

[0108] In some implementations, when node 1 transmits downlink data to node 2, the downlink data may be a user plane frame and / or the downlink data may be a user plane frame, for example, the downlink data may be a DL USER DATA frame. The DL USER DATA frame format may be any of the formats described in any one or any combination of embodiments of this disclosure.

[0109] In some implementations, node 1 may be gNB1 and node 2 may be gNB2. In some implementations, node 1 may be CU and node 2 may be DU.

[0110] Embodiment Set VI Various embodiments of this disclosure describe DL USER DATA transmitted from one network node to another. Figure 6 shows a non-limiting example between a first node (node ​​1) 691 and a second node (node ​​2) 692.

[0111] In step 601: Node 1 sends DL USER DATA containing a service characteristic information presence flag and service characteristic information to Node 2. The service characteristic information may include the PDU set sequence number, the PDU set size in bytes, the PDU SN within the PDU set, the indication of the last PDU in the PDU set, the PDU set severity (PSI), and some or all of the data burst end indication in the header of the last PDU in the data burst.

[0112]

[0106] In various implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU of the PDU set, PDU set importance (PSI), and data burst end indication in the header of the last PDU of the data burst can have the same meaning and can be implemented in the same way as any other embodiment / implementation described herein.

[0113] In various implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU in the PDU set, PDU set importance (PSI), and data burst end indication in the header of the last PDU in the data burst can have similar meanings and can be implemented in the same way as any other embodiment / implementation described herein.

[0114] In some implementations, the PDU set sequence number, PDU set size in bytes, PDU SN within the PDU set, indication of the end PDU of the PDU set, and PDU set importance (PSI) are PDU set information and identifiers to identify whether PDUs are in the same PDU set. In some implementations, the service characteristic information presence flag indicates the presence of service characteristic information.

[0115] In step 602, node 2 receives the above information and can therefore recognize which PDCP PDUs contained in the NR-U PDU belong to the same PDU set and the importance of each PDU set. If the network is congested, one or all NR PDCP PDUs within the same PDU set with low importance may be discarded. Therefore, PDU set information and identification information may be used to determine which PDUs should be discarded.

[0116] If there are unified processing requirements for a PDU set, and one or more NR PDCP PDUs within the PDU set are not successfully delivered to the UE, all other NR PDCP PDUs belonging to the same PDU set may be discarded. PDU set information and identification information may also be used to determine whether the NR PDCP PDUs should be discarded in this case.

[0117] In some implementations, node 2 can determine, based on the above information, which NR PDCP PDUs need to be discarded. After discarding the NR PDCP PDUs, node 2 may notify node 1 of which NR PDCP PDUs were discarded via UL GTP-U feedback, for example, a user plane frame. In some implementations, the UL GTP-U feedback may be a DL DATA DELIVERY STATUS frame. The DL DATA DELIVERY STATUS frame format may be any of the formats described in any embodiment of this disclosure, for example, sets VII and VIII of embodiments.

[0118] In some implementations, node 1 may be gNB1 and node 2 may be gNB2. In some implementations, node 1 may be CU and node 2 may be DU. Embodiment Set VII [Table 6-1] [Table 6-2] [Table 6-3]

[0119] In a non-restrictive example, as shown in Table 6, the DL discard NR PDCP PDU SN flag indicates the presence of a DL discard NR PDCP PDU SN. In some implementations, the field length may include 1 bit, as in a non-restrictive example, or other field length values ​​depending on the final design, with a value of 1 used to indicate the presence of a DL discard NR PDCP PDU SN, and a value of 0 used to indicate the absence of a DL discard NR PDCP PDU SN.

[0120] In some implementations, the DL discard block information flag indicates the presence of the DL discard block count, the DL discard NR DCP PDU SN start, and the discard block size. In some implementations, its field length may include 1 bit, which is an unrestricted example, or other field length values ​​depending on the final design. A value of 1 may be used to indicate the presence of the DL discard block count, DL discard NR DCP PDU SN start, and discard block size, while a value of 0 may be used to indicate the absence of the DL discard block count, DL discard NR DCP PDU SN start, and discard block size.

[0121] In some implementations, the DL discard NR PDCP PDU SN indicates the discard NR PDCP PDU sequence number, and all NR PDCP PDUs up to this number, including this number, are discarded. In some implementations, its field length may include, in non-restrictive examples, 3 octets / byte, and may include other field length values ​​depending on the final design. Discard NR PDCP PDUs may be represented as a first range from 0 to the sequence number, a second range from 1 to the sequence number, or a third range from 0 to (sequence number-1).

[0122] In some implementations, the DL discard block count indicates that the number of PDCP PDU blocks discarded was that number. In some implementations, the field length may include a non-restrictive example of 1 octet / byte, or may include other field length values ​​depending on the final design.

[0123] In some implementations, the discarded NR PDCP PDU SN start indicates the start SN of the discarded PDCP PDU block. In some implementations, its field length may include, in non-restrictive examples, 3 octets / byte, and may include other field length values ​​depending on the final design.

[0124] In some implementations, the discard block size indicates the number of NR PDCP PDUs to be discarded, counted from the starting SN. In some implementations, its field length may include, in non-restrictive examples, 1 octet / byte, or may include other field length values ​​depending on the final design. Embodiment Set VIII [Table 7-1] [Table 7-2] [Table 7-3]

[0125] In a non-restrictive example, as shown in Table 7, the DL discard PDU set SN flag indicates the presence of a DL discard PDU set SN. In some implementations, its field length may include 1 bit, as in the non-restrictive example, or other field length values ​​depending on the final design, with a value of 1 used to indicate the presence of a DL discard PDU set SN, and a value of 0 used to indicate the absence of a DL discard PDU set SN.

[0126] In some implementations, the DL discard PDU set block information flag indicates the presence of the DL discard count, DL discard PDU set SN start, and discard PDU set block size of the PDU set block. In some implementations, its field length may include 1 bit, which is an unrestricted example, or other field length values ​​depending on the final design. A value of 1 may be used to indicate the presence of the DL discard count, DL discard PDU set SN start, and discard PDU set block size of the PDU set block, while a value of 0 may be used to indicate the absence of the DL discard count, DL discard PDU set SN start, and discard PDU set block size of the PDU set block.

[0127] In some implementations, the DL discard PDU set SN indicates the discard PDU set sequence number, and all PDU sets up to this number, including this number, are discarded. In some implementations, the field length may include a non-restrictive example of 1 octet / byte, or may include other field length values ​​depending on the final design.

[0128] In some implementations, the DL discard count for a PDU set block indicates that number of PDU set blocks have been discarded. In some implementations, the field length may include a non-restrictive example of 1 octet / byte, or other field length values ​​depending on the final design.

[0129] In some implementations, the DL discard PDU set SN start indicates the start SN of the discarded PDU set block. In some implementations, its field length may include, in non-restrictive examples, 1 octet / byte, or may include other field length values ​​depending on the final design.

[0130] In some implementations, the discard block size indicates the number of PDU sets to be discarded, counted from the starting SN. In some implementations, its field length may include, in non-restrictive examples, 1 octet / byte, or may include other field length values ​​depending on the final design.

[0131] This disclosure describes methods, apparatus, and computer-readable media for wireless communications. This disclosure addresses the issue of delivering service characteristic information. The methods, devices, and computer-readable media described in this disclosure can facilitate the performance of wireless communications by delivering QoS flow information, thereby improving efficiency and overall performance. The methods, devices, and computer-readable media described in this disclosure can improve the overall efficiency of wireless communication systems.

[0132] In some other embodiments, the computer-readable medium includes instructions that cause the computer to perform the above-described method when executed by the computer. The computer-readable medium may be referred to as non-temporary computer-readable medium (CRM) that stores data for a long period of time, such as a flash drive or compact disc (CD), or that stores data for a short period of time in the presence of power, such as a memory device or random access memory (RAM). In some embodiments, the computer-readable instructions may be contained in software embodied in one or more tangible non-temporary computer-readable mediums. Such non-temporary computer-readable mediums may be media associated with user-accessible mass storage, as well as certain short-term storage of a non-temporary nature, such as internal mass storage or ROM. Software implementing various embodiments of this disclosure may be stored in such devices and executed by a processor (or processing circuit). The computer-readable medium may include one or more memory devices or chips, depending on the specific needs. The software may cause a processor (including a CPU, GPU, FPGA, etc.) to perform certain processes or specific parts of certain processes described herein, including defining data structures stored in RAM and modifying such data structures according to processes defined by the software.

[0133] Throughout this specification, references to features, advantages, or similar terms do not imply that all features and advantages that may be realized by the present solution should or will be included in any single implementation thereof. Rather, terms referring to features and advantages should be understood to mean that certain features, advantages, or characteristics described in relation to the embodiments are included in at least one embodiment of the present solution. Accordingly, descriptions of features and advantages, as well as similar terms throughout this specification, may, but not necessarily, refer to the same embodiment.

[0134] Furthermore, the described features, advantages, and characteristics of this solution may be combined in any suitable manner in one or more embodiments. As those skilled in the art will see, in light of the description herein, this solution can be implemented without one or more of the specific features or advantages of a particular embodiment. In other examples, additional features and advantages may be recognized in certain embodiments where they are not present in all embodiments of this solution.

Claims

1. A method for wireless communication, A method comprising a first network node transmitting downlink (DL) data to a second network node, wherein the DL data includes service characteristic information corresponding to a data burst comprising at least one set of protocol data units (PDUs).

2. The method according to claim 1, wherein the first network node receives uplink (UL) feedback from the second network node, and the UL feedback includes information of at least one discarded packet data convergence protocol (PDCP) PDU.

3. A method for wireless communication, A method comprising a second network node receiving downlink (DL) data from a first network node, wherein the DL data includes service characteristic information corresponding to a data burst comprising at least one set of protocol data units (PDUs).

4. The method according to claim 3, wherein the second network node transmits uplink (UL) feedback to the first network node, the UL feedback includes information of at least one discarded packet data convergence protocol (PDCP) PDU.

5. The first network node and the second network node each include one of the following: a first radio access network (RAN) node and a second RAN node, or a central unit (CU) of a RAN node and a distributed unit (DU) of the RAN node. The aforementioned DL data includes a user plane frame, The method according to any one of claims 1 to 4, wherein the UL feedback includes a user plane frame.

6. The aforementioned DL data includes a DL user data frame, The method according to claim 5, wherein the UL feedback includes a DL data distribution status frame.

7. In response to network congestion, the at least one discarded PDCP PDU includes at least one PDCP PDU in a set of less critical PDUs, The method according to any one of claims 1 to 6, wherein, in response to the failure of a PDCP PDU in a PDU set to be successfully delivered to the UE and the PDU set requiring integrated processing, the at least one discarded PDCP PDU includes all other PDCP PDUs in the PDU set.

8. The DL data includes a service characteristic information flag indicating whether the DL data includes the service characteristic information. The method according to any one of claims 1 to 7, in response to the service characteristic information flag indicating that the DL data includes the service characteristic information, the service characteristic information includes at least one of a PDU set sequence number, a PDU set size, a PDU sequence number within the PDU set, a first indicator indicating that it is the end PDU of the PDU set, a PDU set importance (PSI), and a second indicator indicating that it is the end PDU of the data burst.

9. The DL data includes a service characteristic information flag indicating whether the DL data includes the service characteristic information. The method according to any one of claims 1 to 7, wherein, in response to the service characteristic information flag indicating that the DL data includes the service characteristic information, the service characteristic information includes a PDU set size and an indicator indicating that it is the end PDU of the data burst.

10. The DL data includes a service characteristic information flag indicating whether the DL data includes service characteristic information. The method according to any one of claims 1 to 7, wherein, in response to the service characteristic information flag indicating that the DL data includes the service characteristic information, the service characteristic information includes a PDU set sequence number, a PDU sequence number within the PDU set, an indicator indicating that it is the end PDU of the PDU set, and a PDU set importance (PSI).

11. The method according to any one of claims 1 to 7, wherein the DL data includes a first indicator indicating that it is the end PDU of a PDU set, and a second indicator indicating that it is the end PDU of a data burst.

12. The method according to claim 11, wherein the DL data further includes a first flag for the first indicator and a second flag for the second indicator, the first flag indicating whether the DL data includes the first indicator and the second flag indicating whether the DL data includes the second indicator.

13. The UL feedback includes a first flag indicating whether the UL feedback includes a PDU sequence number, and a second flag indicating whether the UL feedback includes PDU block information. In response to the first flag indicating that the UL feedback includes the PDU sequence number, the UL feedback includes the PDU sequence number indicating a range of PDCP PDUs from which a plurality of PDCP PDUs are discarded, and the PDCP PDU range is determined based on the PDU sequence number. The method according to any one of claims 1 to 7, wherein, in response to the second flag indicating that the UL feedback includes the PDU block information, the UL feedback includes the PDU block information indicating one or more discarded PDCP PDU blocks.

14. The PDU block information includes N and N sets of block start number and block size, The method according to claim 13, wherein N is a positive integer indicating the number of PDCP PDU blocks to be discarded, the block start number indicates the start sequence number of the PDCP PDU blocks to be discarded, and the block size indicates the number of PDCP PDUs being discarded, counted from the start sequence number.

15. The UL feedback includes a first flag indicating whether the UL feedback includes a PDU set sequence number, and a second flag indicating whether the UL feedback includes PDU set block information. In response to the first flag indicating that the UL feedback includes the PDU set sequence number, the UL feedback includes the PDU set sequence number indicating a range of PDCP PDU sets from which a plurality of PDCP PDU sets are discarded, and the range of PDCP PDU sets is determined based on the PDU set sequence number. The method according to any one of claims 1 to 7, wherein, in response to the second flag indicating that the UL feedback includes the PDU set block information, the UL feedback includes the PDU set block information indicating one or more discarded PDCP PDU set blocks.

16. The PDU set block information includes N and N sets of block start number and block size, The method according to claim 15, wherein N is a positive integer indicating the number of PDCP PDU set blocks to be discarded, the block start number indicates the start sequence number of the PDCP PDU set blocks to be discarded, and the block size indicates the number of PDCP PDU sets being discarded, counted from the start sequence number.

17. A wireless communication device comprising a processor and memory, wherein the processor is configured to read code from the memory and carry out the method according to any one of claims 1 to 16.

18. A computer program product comprising stored computer-readable program media code, wherein the computer-readable program media code, when executed by a processor, causes the processor to perform the method according to any one of claims 1 to 16.