Communication method and communication apparatus

MYPI2025006126A0Undetermined Publication Date: 2024-10-07HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
MYPI2025006126
Authority / Receiving Office
MY · MY
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-04-07
Filing Date
2024-03-26
Publication Date
2024-10-07

AI Technical Summary

Technical Problem

In communication technology, when the receiving end processes the PDCP protocol data unit, the sending end may discard the data, causing a state variable update problem. There is currently a lack of effective methods, resulting in data packet loss and transmission performance degradation.

Method used

By determining the count value of discarded data at the receiving end and updating the state variables based on this count value, avoid updating directly based on the count value of discarded data. Pretend to receive or configure empty data packets to update state variables to ensure the integrity of the data packets. sex.

Benefits of technology

It effectively avoids data packet loss, improves transmission performance and reliability, and ensures the accuracy of status variable update at the receiving end.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure PI2025006126_DRAWING_001
    Figure PI2025006126_DRAWING_001
  • Figure PI2025006126_DRAWING_002
    Figure PI2025006126_DRAWING_002
  • Figure PI2025006126_DRAWING_003
    Figure PI2025006126_DRAWING_003
Patent Text Reader

Abstract

A communication method and a communication apparatus are provided. The communication method includes: determining first information, where the first information includes information about a count value of first data, and the first data is discarded data; and updating a state variable based on a first count value, where the first count value is the count value of the first data. The state variable is updated based on the count value of the discarded data, to effectively avoid a packet loss.
Need to check novelty before this filing date? Find Prior Art

Description

Communication method and communication device This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on April 7, 2023, with application number 202310417379.5 and invention name “Communication Method and Communication Device”, the entire contents of which are incorporated by reference in this application. Technical Field The present application relates to the field of communication technology, and more specifically, to a communication method and a communication device. Background Art In the prior art, a receiving end receives a packet data convergence protocol (PDCP) protocol data unit (PDU), and the PDCP PDU includes a sequence number (SN). The receiving end further calculates the hyper frame number (HFN) of the PDCP PDU based on the received SN to obtain a count COUNT value of the PDCP PDU. The receiving end determines whether to discard the PDCP PDU based on the obtained COUNT value. If the receiving end determines not to discard the data, the receiving end can update the state variable based on the COUNT value. In some cases, the sender may discard data. In this case, there is currently no effective way for the receiver to update the state variables. Summary of the invention The embodiments of the present application provide a communication method and a communication device, which can avoid the problem of data packet loss due to the update of PDCP entity state variables, thereby improving transmission performance. In the first aspect, a communication method is provided, which can be executed by a terminal device itself, or by a chip, circuit or module in the terminal device, which is not limited in the present application; alternatively, the method can be executed by a network device itself, or by a chip, circuit or module in the network device, which is not limited in the present application; unless there is ambiguity in the context, the present application is described as a first device. Methods include: The first device determines first information, the first information includes information about a count value of first data, and the first data is discarded data; the first device updates a state variable according to the first count value, and the first count value is the count value of the first data. According to the method provided by the present application, the first device determines the count value of the first data, and updates the state variable according to the first count value. The first count value is the count value of the first data, and the first data is discarded data. It can be understood that the first device determines the count value of the discarded data, and updates the state variable according to the count value of the discarded data. Compared with the prior art, it effectively avoids the problem of data packet loss caused by directly updating the state variable according to a count value greater than the discarded data. In combination with the first aspect, in some possible implementations, the first data is considered to have been received by the first device. Based on the above technical solution, the first data is discarded data, and the first data is considered to have been received by the first device. The first device determines that the first data is discarded data, and considers the first data to have been received. It should be understood that in some specific implementation processes, the first device may pretend to have received the first data and update the state variables; or, the first device configures an empty data packet at the position corresponding to the discarded data and updates the state variables. In conjunction with the first aspect, in some possible implementations, the first data is considered to have been received by the first device when a first condition is satisfied, wherein the first condition includes that a first state variable is less than or equal to a first count value, and the first state variable is used to indicate a count value of the first data that the first device is waiting to deliver. Based on the above technical solution, when the first state variable is less than or equal to the first count value, the first data will be regarded as having been received by the first device. In combination with the first aspect, in some possible implementations, the first information includes a count value of at least one data, the at least one data includes first data, and each data in the at least one data is discarded data. Based on the above technical solution, the first information includes a count value of at least one data, and the at least one data may include one or more data, each data in the at least one data is discarded data, and the at least one data includes first data. The first count value is the smallest count value in the at least one data. It should be understood that, generally, one data may correspond to one count value. In combination with the first aspect, in some possible implementations, the first data is considered to have been received by the first device and stored in a cache. In combination with the first aspect, in some possible implementations, the first information also includes information of a first quantity, where the first quantity is used to indicate the number of discarded data. In conjunction with the first aspect, in some possible implementations, the first device updates a state variable according to the first count value, including: If the first count value is greater than or equal to the second state variable, the first device updates the second state variable to: the sum of the first count value and the first quantity, or the first device updates the second state variable to: the sum of the first count value and 1; and / or, If the first count value is equal to the first state variable, the first device submits at least one third data, the third data includes data received by the first device and stored in the cache, and the count value corresponding to the third data is greater than or equal to the first state variable, and / or, If the first count value is equal to the first state variable, the first device updates the first state variable to a fourth count value, and the fourth count value is greater than the first state variable, wherein the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the first quantity is used to indicate the number of discarded data. Based on the above technical solution, when the first device updates the state variable according to the first count value, if the first count value is greater than or equal to the second state variable used to indicate the count value of the next data that the first device expects to receive, the first device updates the second state variable to the sum of the first count value and the first quantity. When at least one data includes multiple (2 or more) data, the first device only needs to update the second state variable once. Alternatively, the first device updates the second state variable to the sum of the first count value and 1. The first device needs to determine the relationship between the count value and the second state variable for each data in the at least one data, and further determine whether to update the second state variable. When the first count value is equal to the first state variable, the first device submits at least one third data to the upper layer. When submitting multiple (2 or more) third data, the count values ​​of the third data are continuous, and the count values ​​corresponding to the third data are greater than or equal to the first state variable. In a first aspect, in some possible implementations, the first device updates a state variable according to a first count value, further comprising: if the reordering timer is running, and the first state variable is greater than or equal to a third state variable, the first device stops the reordering timer. And / or, if the reordering timer is not running, and the first state variable is less than the second state variable, the first device starts the reordering timer. The first state variable is used to indicate the count value of the first data that the first device is waiting to deliver, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the third state variable is used to indicate the count value of the data that triggers the reordering timer plus 1. In a first aspect, in some possible implementations, the first device obtains a serial number SN or a first count value of the first data. Based on the above technical solution, the first device may also obtain the serial number SN or the first count value of the first data. The first device may determine the first count value according to the obtained serial number SN of the first data. In the first aspect, in some possible implementation methods, when the first device obtains the serial number SN of the first data, the method also includes: the first device determines a first count value based on the serial number SN of the first data and a first state variable, and the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device. Based on the above technical solution, when the first device obtains the serial number SN of the first data, the first device determines the first count value according to the serial number SN of the first data and the first state variable. Specifically, the first device may calculate the super frame number HFN according to the sequence number SN of the first data, and determine the first count value according to the sequence number SN and the super frame number HFN. In the first aspect, in some possible implementation methods, when the first information includes a count value of at least one data, the method also includes: the first device obtains any one or more of the following information of at least one data: a starting sequence number SN, an ending sequence number SN, a starting count value, an ending count value, and a first quantity, wherein the first quantity is the number of discarded data in the first data set. Based on the above technical solution, when the first information determined by the first device includes the count value of at least one data, the first device may also obtain information such as the starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, and the first quantity of at least one data. The first device may further determine the count value related to at least one data based on one or more of the above information. The related count value may be the starting count value, the ending count value, or any one or more of the at least one data. The count value of the data. In the first aspect, in some possible implementations, the first device determines a starting count value of at least one data based on a starting sequence number SN and a first state variable; and / or the first device determines a count value of at least one data among at least one data based on a starting count value and a first quantity of at least one data, and the first state variable is used to indicate the count value of the first data that the first device is waiting to submit. On the second aspect, a communication method is provided, which can be executed by the terminal device itself, or by a chip, circuit or module in the terminal device, which is not limited in the present application; alternatively, the method can be executed by the network device itself, or by a chip, circuit or module in the network device, which is not limited in the present application; unless there is ambiguity in the context, the present application is described as the first device. Methods include: The first device determines first information, the first information includes a count value of at least one data, each data of the at least one data is discarded data. When the second condition is met, the first device performs any one or more of the following: The first device delivers at least one data having a received count value greater than or equal to the second count value plus 1; The first device updates the first state variable to a third count value, the third count value being greater than the second count value; If the reordering timer is running, and the first state variable is greater than or equal to the third state variable, the first device stops the reordering timer; If the reordering timer is not running, and the first state variable is less than the second state variable, the first device starts the reordering timer, Among them, the second condition is: the first state variable is equal to the first count value, the first count value is the count value of the first data, the first data is the data with the smallest count value among at least one data, the second count value is the count value of the second data, the second data is the data with the largest count value among at least one data, the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the third state variable is used to indicate the count value of the data that triggers the reordering timer plus 1. According to the method provided by the present application, the first device determines the first information, the first information includes the count value of at least one data, and each data in the at least one data is discarded data. The first device further updates the state variable according to the first count value and the first state variable in the at least one data. Wherein, when the first device determines that the first state variable is equal to the first count value, the first device submits at least one data whose count value has been received is greater than or equal to the second count value plus 1, the second count value is the largest count value among the count values ​​of at least one data, the first device submits at least one data whose count value has been received is greater than or the second count value plus 1 to the upper layer, and the count value of at least one data submitted by the first device to the upper layer is continuous. Wherein, when the first device determines that the first state variable is equal to the first count value, the first device can update the first state variable to a third count value, the third count value is greater than the second count value, and the third count value is the count value of the first data packet greater than the second count value that the first device has not submitted to the upper layer. According to the technical solution provided by the present application, when the first device determines that the first state variable is equal to the first count value, the first device further determines the update of the state variable, thereby avoiding the loss of data packets and improving transmission performance. In combination with the second aspect, in some possible implementations, when the second state variable is less than the second count value, the method further includes: the first device updates the second state variable to: the second count value plus 1. In conjunction with the second aspect, in some possible implementations, after the first device determines the first information, the method further includes: if a third condition is satisfied, the first device ignores the first information. The third condition includes: the first state variable is greater than the second count value. Based on the above technical solution, after the first device determines the first information, when the first state variable is greater than the second count value, the first device ignores the first information, that is, the first device may not perform the above state variable update that meets the second condition. In conjunction with the second aspect, in some possible implementations, the method further includes: the first device acquires any one or more of the following information of the at least one data: The starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, the first quantity, The first number is the number of discarded data in the at least one data. Based on the above technical solution, before determining the first information, the first device may also obtain one or more of the starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, and the first quantity of at least one data. The first device may determine the count value of at least one data based on the obtained at least one information. In combination with the second aspect, in some possible implementation methods, when the first device obtains the serial number SN of the first data, the method also includes: the first device determines a first count value based on the serial number SN of the first data and a first state variable, and the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device. Based on the above technical solution, when the first device obtains the serial number SN of the first data in at least one data, the first device determines the count value of the first data, that is, the first count value, according to the serial number SN of the first data and the first state variable. In conjunction with the second aspect, in some possible implementations, the method further includes: the first device determines a starting count value of at least one data according to a starting sequence number SN and a first state variable. And / or, the first device determines a termination count value of at least one data according to a termination sequence number SN and a first state variable. And / or, the first device determines a termination count value of at least one data according to a first count value and a first quantity. The first state variable is used to indicate a count value of the first data that the first device is waiting to submit. In a third aspect, a device is provided, the device comprising: a processing unit, configured to determine first information, the first information comprising information of a count value of first data, the first data being discarded data; and the processing unit, configured to update a state variable according to the first count value, the first count value being the count value of the first data. In combination with the third aspect, in some possible implementations, the first data is considered to have been received by the first device. In conjunction with the third aspect, in some possible implementations, the first data is considered to have been received by the first device when a first condition is satisfied, wherein the first condition includes that a first state variable is less than or equal to a first count value, and the first state variable is used to indicate a count value of the first data that the first device is waiting to deliver. In combination with the third aspect, in some possible implementations, the first information includes a count value of at least one data, the at least one data includes first data, and each data in the at least one data is discarded data. In combination with the third aspect, in some possible implementations, the first data is considered to have been received by the first device and stored in a cache. In combination with the third aspect, in some possible implementations, the first information also includes information of a first quantity, where the first quantity is used to indicate the number of discarded data. In conjunction with the third aspect, in some possible implementations, the processing unit, configured to update the state variable according to the first count value, includes: If the first count value is greater than or equal to the second state variable, the processing unit is further used to update the second state variable to: the sum of the first count value and the first quantity, or the processing unit is further used to update the second state variable to: the sum of the first count value and 1; and / or, If the first count value is equal to the first state variable, the processing unit is further configured to submit at least one third data, the third data including data received by the first device and stored in the cache, and the count value corresponding to the third data is greater than or equal to the first state variable, and / or, If the first count value is equal to the first state variable, the processing unit is further configured to update the first state variable to a fourth count value, the fourth count value being greater than the first state variable, The first state variable is used to indicate the count value of the first data that the first device is waiting to deliver, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the first quantity is used to indicate the number of discarded data. In conjunction with the third aspect, in some possible implementations, the processing unit is used to update the state variable according to the first count value, and further includes: if the reordering timer is running, and the first state variable is greater than or equal to the third state variable, the processing unit is also used to stop the reordering timer. And / or, if the reordering timer is not running, and the first state variable is less than the second state variable, the processing unit is also used to start the reordering timer. The first state variable is used to indicate the count value of the first data that the first device is waiting to submit, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the third state variable is used to indicate that the count value of the data that triggers the reordering timer is increased by 1. In combination with the third aspect, in some possible implementations, the receiving unit is used to obtain a sequence number SN or a first count value of the first data. In combination with the third aspect, in some possible implementations, when the receiving unit is used to obtain the serial number SN of the first data, the processing unit is also used to determine a first count value based on the serial number SN of the first data and a first state variable, and the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device. In combination with the third aspect, in some possible implementation methods, when the first information includes a count value of at least one data, the receiving unit is also used to obtain any one or more of the following information of at least one data: a starting sequence number SN, an ending sequence number SN, a starting count value, an ending count value, and a first quantity, wherein the first quantity is the number of data in the first data set. In conjunction with the third aspect, in some possible implementations, the processing unit is further used to determine a starting count value of at least one data according to a starting sequence number SN and a first state variable; and / or the processing unit is further used to determine a count value of at least one data in at least one data according to a starting count value of at least one data and a first quantity, and the first state variable is used to indicate that the first device is waiting for the first data to be submitted. The count value of the data. In a fourth aspect, a communication device is provided, the device comprising: a processing unit, configured to determine first information, the first information comprising a count value of at least one data, each data of the at least one data being discarded data. When the second condition is met, the first device performs any one or more of the following: The processing unit is further used to submit at least one data having a received count value greater than or equal to the second count value plus 1; The processing unit is further used to update the first state variable to a third count value, where the third count value is greater than the second count value; If the reordering timer is running, and the first state variable is greater than or equal to the third state variable, the processing unit is further configured to stop the reordering timer; If the reordering timer is not running, and the first state variable is less than the second state variable, the processing unit is further configured to start the reordering timer, Among them, the second condition is: the first state variable is equal to the first count value, the first count value is the count value of the first data, the first data is the data with the smallest count value among at least one data, the second count value is the count value of the second data, the second data is the data with the largest count value among at least one data, the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device, the second state variable is used to indicate the count value of the next data that the first device expects to receive, and the third state variable is used to indicate the count value of the data that triggers the reordering timer plus 1. In combination with the fourth aspect, in some possible implementations, when the second state variable is less than the second count value, the processing unit is further used to update the second state variable to: the second count value plus 1. In conjunction with the fourth aspect, in some possible implementations, after the first device determines that the first information satisfies a third condition, the processing unit is further configured to ignore the first information. The third condition includes: the first state variable is greater than the second count value. In conjunction with the fourth aspect, in some possible implementations, the method further includes: a processing unit, further configured to obtain any one or more of the following information of at least one data: The starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, the first quantity, The first number is the number of discarded data in the at least one data. In combination with the fourth aspect, in some possible implementation methods, when the transceiver unit is also used to obtain the serial number SN of the first data, the processing unit is also used to determine the first count value based on the serial number SN of the first data and the first state variable, and the first state variable is used to indicate the count value of the first data waiting to be submitted by the first device. In conjunction with the fourth aspect, in some possible implementations, when the transceiver unit is also used to obtain the starting sequence number SN of at least one data, the processing unit is also used to determine the starting count value of at least one data according to the starting sequence number SN and the first state variable. And / or, the processing unit is also used to determine the ending count value of at least one data according to the ending sequence number SN and the first state variable. And / or, the processing unit is also used to determine the ending count value of at least one data according to the first count value and the first quantity. The first state variable is used to indicate the count value of the first data that the first device is waiting to submit. In a fifth aspect, a communication device is provided, which may be a terminal device or a network device, or a component (such as a chip or circuit) of a terminal device or a network device. The communication device includes a processor, and the processor is used to call and run a computer program from a memory, so that the communication device executes the method in any possible implementation of the first aspect or the second aspect. Optionally, there are one or more processors. Optionally, the communication device further includes one or more memories, and the memories may be integrated with the processor, or the memories may be arranged separately from the processor. Optionally, the communication device further includes a transmitter and a receiver. When the communication device is a terminal device or a network device, the transmitter and the receiver may be a radio frequency module, etc. When the communication device is a component (such as a chip or circuit) of a terminal device or a network device, the transmitter and the receiver may be an output / input circuit or an interface, etc. In a sixth aspect, a communication method is provided, comprising a method in any possible implementation of the first aspect and a method in any possible implementation of the second aspect. In the seventh aspect, a communication system is provided, comprising a network device and a terminal device, wherein the terminal device is used to execute the method in any possible implementation of the first aspect, and the network device is used to execute the method in any possible implementation of the second aspect. In an eighth aspect, a communication system is provided, including a network device, a first terminal device, and a second terminal device, wherein the first terminal device can be used to execute the method in any possible implementation manner of the first aspect above, and the second terminal device can be used to execute the method in any possible implementation manner of the first aspect above. In the method of any possible implementation manner of the second aspect, the first terminal device and the second terminal device are different. In the ninth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores a computer program or code, and when the computer program or code is run on a computer, the computer executes a method in any possible implementation of the first aspect or the second aspect. In the tenth aspect, a chip is provided, comprising at least one processor, wherein the at least one processor is coupled to a memory, the memory is used to store computer programs, and the processor is used to call and run the computer programs from the memory, so that a device equipped with the chip system executes a method in any possible implementation of the first aspect or the second aspect above. The chip may include an input circuit or interface for sending information or data, and an output circuit or interface for receiving information or data. In a ninth aspect, a computer program product is provided, the computer program product comprising: a computer program code, when the computer program code is executed by a device, the device executes a method in any possible implementation of the first aspect or the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS FIG1 is a schematic diagram of a communication system applicable to an embodiment of the present application. FIG2 is a schematic diagram of another network architecture applicable to an embodiment of the present application. FIG3 is a schematic diagram of another network architecture used in an embodiment of the present application. FIG. 4 is a schematic diagram of the structure of a GOP applicable to an embodiment of the present application. FIG5 is a schematic diagram of a protocol stack provided in an embodiment of the present application. FIG6 is a schematic diagram of the relationship between PDU and SDU of each protocol layer provided in an embodiment of the present application. FIG. 7 is a schematic diagram of a PDCP PDU provided in an embodiment of the present application. FIG8 is a schematic diagram of a COUNT provided in an embodiment of the present application. FIG. 9 is a schematic block diagram of a communication method provided in an embodiment of the present application. FIG. 10 is a schematic diagram of a packet loss scenario provided in an embodiment of the present application. FIG. 11 is a schematic block diagram of another communication method provided in an embodiment of the present application. FIG. 12 is a schematic block diagram of another communication method provided in an embodiment of the present application. FIG. 13 is a schematic block diagram of a communication device provided in an embodiment of the present application. FIG14 is a schematic block diagram of another communication device provided in an embodiment of the present application. FIG15 is a schematic block diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings. The technical solutions of the embodiments of the present application can be applied to various communication systems, for example: Global System of Mobile communication (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication system, fifth generation (5G) system or new radio (NR), sixth generation (6G) system or future communication system, etc. The terminal device involved in the embodiments of the present application is a device with wireless transceiver functions, which can be a fixed device or a mobile device, and can refer to user equipment, access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent or user device. The terminal device can also be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a Wireless Local Loop (Wireless Local Loop, WLL) station, a Personal Digital Assistant (Personal Digital Assistant, PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a 5G network or a terminal device in a future evolved Public Land Mobile Network (Public Land Mobile Network, PLMN), etc. The terminal device It can also be a handheld device (such as a mobile phone), a wearable device, an in-vehicle device, or a wireless device built into the above device (for example, a communication module, a modem, or a chip system, etc.). The terminal device is used to connect people, objects, machines, etc., and can be widely used in various scenarios, such as but not limited to the following scenarios: cellular communication, device-to-device communication (device-to-device, D2D), vehicle to everything (vehicle to everything, V2X), machine-to-machine / machine-type communications (machine-to machine / machine-type communications, M2M / MTC), Internet of Things (Internet of Things, IoT), virtual reality (virtual reality, VR), augmented reality (augmented reality, AR), industrial control (industrial control), self-driving, remote medical, smart grid (smart grid), smart furniture, smart office, smart wear, smart transportation, smart city (smart city), drones, robots and other scenarios of terminal devices. The embodiments of the present application are not limited to this. The network device in the embodiment of the present application may be a device for communicating with a terminal device, and the network device may be a base station (Base Transceiver Station, BTS) in a Global System of Mobile communication (GSM) system or a Code Division Multiple Access (CDMA), or a base station (NodeB, NB) in a Wideband Code Division Multiple Access (WCDMA) system, or an Evolutional Node B (eNB or eNodeB) in an LTE system, or a wireless controller in a Cloud Radio Access Network (CRAN) scenario, or the network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a future 5G network, or a network device in a future evolved PLMN network, etc. For example, the network device may include an access network device, and / or a core network device. The access network device is a device with a wireless transceiver function, which is used to communicate with the terminal device. The access network equipment includes, but is not limited to, base stations (BTS, Node B, eNodeB / eNB, or gNodeB / gNB) in the above-mentioned communication systems, transmission reception points (TRP), base stations of subsequent evolution of 3GPP, access nodes in WiFi systems, wireless relay nodes, wireless backhaul nodes, etc. The base station may be: a macro base station, a micro base station, a micro-micro base station, a small station, a relay station, etc. Multiple base stations may support the networks of the same access technology mentioned above, or may support the networks of different access technologies mentioned above. The base station may include one or more co-sited or non-co-sited transmission and reception points. The network device may also be a wireless controller, a centralized unit (CU), and / or a distributed unit (DU) in a cloud radio access network (CRAN) scenario. The network device may also be a server, a wearable device, or an in-vehicle device, etc. For example, the network device in the V2X technology may be a road side unit (RSU). This application does not specifically limit this. In an embodiment of the present application, a terminal device or a network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer. The hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and a memory (also referred to as main memory). The operating system may be any one or more computer operating systems that implement business processing through a process, such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a Windows operating system. The application layer includes applications such as a browser, an address book, a word processing software, and an instant messaging software. In addition, the embodiment of the present application does not specifically limit the specific structure of the execution subject of the method provided in the embodiment of the present application, as long as it can communicate according to the method provided in the embodiment of the present application by running a program that records the code of the method provided in the embodiment of the present application, for example, the execution subject of the method provided in the embodiment of the present application may be a terminal device or a network device, or a functional module, chip, or circuit in a terminal device or a network device that can call and execute a program. The technical solution of the present application is further described in detail below in conjunction with the accompanying drawings. FIG1 is a schematic diagram of a communication system applicable to an embodiment of the present application. As shown in FIG1 , a terminal device 130 can access a wireless network to obtain services of an external network (such as the Internet) through the wireless network, or communicate with other devices through the wireless network, such as communicating with other terminal devices. The wireless network includes a radio access network (RAN) device 110 and / or a core network (CN) device 120, wherein the RAN device 110 is used to access the terminal device 130 to the wireless network, and the CN device 120 is used to manage the terminal device and provide a gateway for communicating with the external network. It should be understood that the number of each device in the communication system shown in Figure 1 is for illustration only, and the embodiments of the present application are not limited to this. In actual applications, the communication system may also include more terminal devices 130, more RAN devices 110, and other devices. It should also be understood that when the terminal device 130 communicates with other terminal devices (such as the terminal device 130'), the technical solutions in the embodiments of the present application are also applicable. FIG2 is another schematic diagram of a network architecture applicable to an embodiment of the present application. As shown in FIG2 , the network architecture includes CN equipment, RAN equipment, and terminal equipment. Among them, the RAN equipment includes a baseband device and a radio frequency device, wherein the baseband device can be implemented by one node or by multiple nodes, and the radio frequency device can be independently implemented remotely from the baseband device, or integrated in the baseband device, or some functions can be independently integrated and some functions can be integrated in the baseband device. For example, in an LTE communication system, the RAN equipment (eNB) includes a baseband device and a radio frequency device, wherein the radio frequency device can be arranged remotely relative to the baseband device, such as a remote radio unit (RRU). It is a remote wireless unit arranged relative to the BBU. The communication between RAN equipment and terminal equipment follows a certain protocol layer structure. For example, the control plane protocol layer structure may include the functions of protocol layers such as the radio resource control (RRC) layer, the packet data convergence protocol (PDCP) layer, the radio link control (RLC) layer, the media access control (MAC) layer and the physical layer; the user plane protocol layer structure may include the functions of protocol layers such as the PDCP layer, the RLC layer, the MAC layer and the physical layer; in a possible implementation, a service data adaptation protocol (SDAP) layer may also be included above the PDCP layer. The RAN device can implement the functions of the protocol layers such as RRC, PDCP, RLC and MAC by one node, or can implement the functions of these protocol layers by multiple nodes. For example, in an evolutionary structure, the RAN device may include a CU) and a DU, and multiple DUs may be centrally controlled by one CU. As shown in FIG2 , the CU and the DU may be divided according to the protocol layers of the wireless network, for example, the functions of the PDCP layer and above protocol layers are set in the CU, and the functions of the protocol layers below the PDCP, such as the RLC layer and the MAC layer, are set in the DU. This division of the protocol layer is only an example. It can also be divided in other protocol layers, such as dividing in the RLC layer, setting the functions of the RLC layer and the protocol layers above in the CU, and the functions of the protocol layers below the RLC layer in the DU; or dividing in a certain protocol layer, for example, setting some functions of the RLC layer and the functions of the protocol layers above the RLC layer in the CU, and setting the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer in the DU. In addition, it can also be divided in other ways, such as dividing by latency, setting the functions whose processing time needs to meet the latency requirements in the DU, and the functions that do not need to meet the latency requirements in the CU. In addition, the radio frequency device can be independently integrated and not placed in the DU, or it can be integrated in the DU, or partly remotely located and partly integrated in the DU, without any limitation here. FIG3 is a schematic diagram of another network architecture applicable to an embodiment of the present application. Compared with the network architecture shown in FIG2, FIG3 can also separate the control plane (CP) and the user plane (UP) of the CU and implement them in different entities, namely, a control plane (CP) CU entity (i.e., a CU-CP entity) and a user plane (UP) CU entity (i.e., a CU-UP entity). In the above network architecture, the signaling generated by the CU can be sent to the terminal device through the DU, or the signaling generated by the terminal device can be sent to the CU through the DU. The DU can directly encapsulate the signaling through the protocol layer and transparently transmit it to the terminal device or CU without parsing it. In the following embodiments, if the transmission of such signaling between the DU and the terminal device is involved, at this time, the sending or receiving of the signaling by the DU includes this scenario. For example, the signaling of the RRC or PDCP layer will eventually be processed as the signaling of the PHY layer and sent to the terminal device, or it will be converted from the received signaling of the PHY layer. Under this architecture, the signaling of the RRC or PDCP layer can also be considered to be sent by the DU, or sent by the DU and the RF loader. The network architecture illustrated in Figures 1, 2 or 3 above can be applicable to communication systems of various radio access technologies (RAT), for example, it can be an LTE communication system, it can also be a 5G (or new radio (NR)) communication system, it can also be a transition system between an LTE communication system and a 5G communication system, the transition system can also be called a 4.5G communication system, and of course it can also be a future communication system. The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. It is known to those skilled in the art that with the evolution of the communication network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems. For example, the present invention can be applied to vehicle to everything (V2X) scenarios. In the following embodiments of the present application, the first device may be located in a terminal device or a network device according to the functions implemented. When the above CU-DU structure is adopted, the network device may be a CU node, a DU node, or a RAN device including a CU node and a DU node, which is not specifically limited in the present application. It should be understood that the network architecture shown in Figures 1 to 3 above is only an example of the present application and does not have any limiting effect on the embodiments of the present application. In particular, the embodiments of the present application can also be applied to other network architectures, for example, without distinguishing between base stations and core networks, that is, base stations and core networks can belong to the same network device, and the communication between the network device and the terminal device; or, the communication between terminal devices, etc. In order to better understand the embodiments of the present application, before introducing the embodiments of the present application, a brief description of the terms involved in the present application is first given. It is understood that these explanations are intended to make the embodiments of the present application easier to understand and should not be regarded as limiting the scope of protection required by the embodiments of the present application. 1. Extended reality (XR): XR can refer to various real-world and virtual environments generated by computing technology and wearable devices, as well as human-machine interactions, including virtual reality (VR), augmented reality (AR), and mixed reality (MR). In order to enhance the experience of human interaction with the virtual world, XR services have high demands on bandwidth and latency. Strict requirements. For example, during downlink transmission, the server's encoder generates data content at a fixed frequency (e.g., 60 Hz or 120 Hz, etc.) and transmits it to the XR terminal via the core network and RAN. For example, during uplink transmission, the XR terminal can collect images through the built-in camera and continuously upload images of the current scene to the server at a specific frequency (e.g., 60 Hz or 120 Hz, etc.). For example, XR services usually generate data periodically at a certain frame rate. For example, the business model for downlink XR services is roughly: AR / VR and cloud game CG. Among them, the AR / VR frame rate can be 60fps, that is, 60 frames of video images are generated per second, and one video frame appears approximately every 16.66ms. The AR / VR frame rate can also be 120fps, that is, 120 frames of video images are generated per second, and one video frame appears approximately every 8.33ms. The CG frame rate can be 60fps or 120fps, that is, 60 frames of video images are generated per second or 120 frames of video images per second. For example, the latency requirement of XR services may be 10ms, 30ms, etc. Optionally, in an actual transmission system, data jitter may occur due to data encoding delay, network transmission delay, etc. For example, jitter may be considered to obey a truncated Gaussian distribution, with the truncation range being approximately [-4, 4] ms. For example, for XR video services, images can be encoded in GOP encoding and / or slice encoding during encoding. For example, for slice encoding, a video frame may include an I slice and one or more P slices. For example, for GOP encoding, a GOP may include an I frame, or a GOP includes an I frame and one or more P frames. Optionally, a GOP may also include a B frame. Exemplarily, an I frame is an intra-coded frame (also referred to as an intra-coded frame, a key frame, an important frame, etc.), and an I frame is a reference frame for a P frame and / or a B frame, and has the characteristics of independent encoding and decoding. Exemplarily, a P frame is a forward prediction frame (also referred to as a forward prediction coded frame, a forward reference frame, a dependent frame, a non-key frame, etc.). When decoding a P frame, it is necessary to refer to the most recent I frame or P frame in front, and a P frame can be a reference frame for a subsequent P frame and / or B frame. Exemplarily, a B frame is a bi-directional interpolated prediction frame, which may also be called a dependent frame, a non-key frame, etc. When decoding a B frame, it is necessary to refer to the most recent I frame or P frame in front, as well as the most recent P frame in the back. Exemplarily, an I frame is a complete picture, and a P frame records the changes relative to the I frame. Without an I frame, the P frame cannot be decoded, so the transmission priority of the I frame must be higher than that of the P frame. If an I frame fails to be transmitted during the transmission process (for example, it has not been successfully transmitted even if its delay requirement is met), even if the subsequent video frame (for example, a P frame) that depends on the I frame is successfully transmitted, correct decoding cannot be achieved on the receiving side. Figure 4 is a schematic diagram of the structure of a GOP provided in an embodiment of the present application. As shown in Figure 4, a GOP sequence (for example, GOP#1 or GOP#2) includes an I frame and multiple P frames. Exemplarily, a data burst may also be referred to as a data burst, which is a group of PDUs generated and sent by an application in a short period of time (for example, A set of data multiple PDUs generated and sent by the application in a short period of time). Exemplarily, a PDU set may include one or more PDUs carrying the payload of one unit of information generated at the application level (e.g., a PDU Set may include one or more PDUs carrying the payload of one unit of information generated at the application level (e.g., a frame or video slice for XRM Services, as used in TR 26.926

[0027] )). For example, a PDU set includes a frame or a slice. For example, a PDU set includes a frame or a slice. For example, in some implementations, the application layer needs all PDUs in a PDU Set to use the corresponding unit of information. In other implementations, the application layer can still recover parts all or of the information unit, when some PDUs are missing. Optionally, a data burst includes at least one PDU set. For example, data burst 1 may be associated with one or more data bursts, and the one or more data bursts need to depend on data burst 1. If data burst 1 is discarded, the one or more data bursts may not be decoded. For example, PDU set 1 may be associated with one or more PDU sets, and the one or more PDU sets need to depend on PDU set 1. If PDU set 1 is discarded, the one or more PDU sets may not be decoded. 2. New radio (NR) protocol architecture: The NR protocol architecture involved in the embodiment of the present application can be divided into a user plane protocol stack and a control plane protocol stack. The above two protocol stacks will be described in detail below in conjunction with Figure 5. Figure 5 is described by taking the interaction between the terminal device and the base station as an example. (a) in Figure 5 shows the user plane protocol stack, and (b) in Figure 5 shows the control plane protocol stack. User plane protocol stack: a protocol cluster used for user data transmission. As shown in a) of FIG5 , the user plane protocol stack may include five layers: a PHY layer, a MAC layer, an RLC layer, a PDCP layer, and a SDAP layer. Control plane protocol stack architecture: that is, the protocol cluster used for the control signaling transmission of the system. As shown in b) of Figure 5, the control plane protocol stack may include non-access-stratum (NAS), RRC, PDCP, RLC, MAC, and PHY layers. For example, the PHY layer may be responsible for processing one or more of encoding and decoding, modulation and demodulation, multi-antenna mapping, and other physical layer functions. For example, the MAC layer may be responsible for one or more of hybrid automatic repeat request (HARQ), uplink scheduling, downlink scheduling, etc. For example, the RLC layer may be responsible for one or more of segmentation, reorganization, and retransmission processing. For example, the PDCP layer may be responsible for one or more of header compression / decompression, security (encryption function, integrity protection function), retransmission, and in-order delivery. For example, the RRC layer may be responsible for one or more of broadcasting, paging, RRC connection management, wireless bearer control, mobility management, terminal device measurement reporting and control. For example, the NAS layer may be responsible for one or more of identity authentication, mobility management, security control, etc. For the user plane protocol stack, the NR protocol stack has an additional SDAP layer compared to the long term evolution (LTE) protocol stack. For the control plane protocol stack, the NR protocol stack is similar to the LTE protocol stack. Optionally, in the embodiment of the present application, each layer in the protocol stack may also be replaced by an entity. For example, the PDCP layer may be replaced by a PDCP entity, and the SDAP layer may be replaced by an SDAP entity. A unified description is made here, and no further description is given later. 3. PDU and SDU (service data unit): In each protocol layer (for example, any one or more of SDAP, RRC, PDCP, RLC, and MAC), the SDU of the Nth layer corresponds to the PDU of the upper layer. In other words, the PDU of this layer is the SDU of the lower layer, and the SDU of this layer is the PDU of the upper layer. The relationship between PDU and SDU will be described in detail below by taking the interaction between a terminal device and a base station as an example in conjunction with FIG. 6 . FIG6 is a schematic diagram of the relationship between the PDU and SDU of each protocol layer provided by an embodiment of the present application. As shown in FIG6, for the transmitting end, after the RRC layer generates the signaling to be transmitted (for example, an RRC message or an RRC PDU), or after the SDAP layer obtains the data to be transmitted, it can be submitted to the corresponding PDCP layer. For the convenience of description, we will refer to the signaling as / replace it with data; for the data received from the RRC layer or the SDAP layer (for example, PDCP SDU), the PDCP layer may obtain the PDCP PDU after certain processing or without processing, and then submit the PDCP PDU to the RLC layer corresponding to the PDCP layer; for the data received from the PDCP layer (for example, RLC SDU), the RLC layer may obtain the RLC PDU after certain processing or without processing, and then submit the RLC PDU to the corresponding MAC layer; for the data received from the RLC layer (for example, MAC SDU), the MAC layer may obtain the MAC PDU after certain processing or without processing, and then submit the MAC PDU to the PHY layer; the PHY layer may obtain the MAC PDU after certain processing or without processing, and the PHY layer will perform air interface transmission. Correspondingly, for the receiving end, after the PHY layer receives the data (e.g., transport block (TB)), it will submit the data to the MAC layer; for the data received from the PHY (e.g., TB or MAC PDU), the MAC layer may obtain the MAC SDU after certain processing or without processing, and then submit the MAC SDU to the corresponding RLC layer; for the data received from the MAC layer (e.g., RLC PDU), the RLC layer may obtain the RLC SDU after certain processing or without processing, and then submit the RLC SDU to the corresponding PDCP layer; for the data received from the RLC layer (e.g., PDCP PDU), the PDCP layer may obtain the PDCP SDU after certain processing or without processing, and then submit the PDCP SDU to the RRC layer or SDAP layer; for the data received from the PDCP layer (e.g., RRC message or RRC PDU), which can also be called signaling, the RRC layer will perform RRC decoding or ASN.1 decoding to determine the meaning of the received data; or, for the data received from the PDCP layer (e.g., SDAP The SDAP layer may obtain the SDAP SDU after certain processing or without processing, and then delivers the SDAP PDU to the upper layer (for example, the application layer). For the transmission and reception of data (or signaling), the data may be encapsulated / processed accordingly in each layer, or may be transparently transmitted. For example, for the transmitting end, the data received by a certain layer from the upper layer of the layer is called SDU, and the data delivered by the layer to the lower layer is called PDU. For the layer, the data received from the upper layer and the data delivered to the lower layer may be the same (for example, transparent transmission) or different (for example, the data received from the upper layer is encapsulated / processed by the layer to obtain the data delivered to the lower layer). For example, the data received by the PDCP layer from the upper layer is called PDCP SDU, and the data sent by the PDCP layer to the lower layer is called PDCP PDU; the data received by the RLC layer from the upper layer is called RLC SDU, and the data sent by the RLC layer to the lower layer is called RLC PDU; the data received by the MAC layer from the upper layer is called MAC SDU, and the data sent by the MAC layer to the lower layer is called MAC PDU or TB. For example, for the receiving end, the data received by a layer from the lower layer of the layer is called PDU, and the data delivered to the upper layer by the layer is called SDU. For the layer, the data received from the lower layer and the data delivered to the upper layer may be the same (for example, transparent transmission) or different (for example, the data received from the lower layer is processed by the layer to obtain the data delivered to the upper layer). For example, the data received by the PDCP layer from the lower layer is called PDCP PDU, and the data sent by the PDCP layer to the upper layer is called PDCP SDU; the data received by the RLC layer from the lower layer is called RLC PDU, and the data sent by the RLC layer to the upper layer is called RLC SDU; the data received by the MAC layer from the lower layer is called MAC PDU or TB, and the data sent by the MAC layer to the upper layer is called MAC SDU. The upper layer and the lower layer involved in the embodiments of the present application are relative concepts. For example, taking the RLC layer as an example, for the RRC For the PDCP layer, the RLC layer may be the lower layer of the RRC layer, but for the MAC layer, the RLC layer may be the upper layer of the MAC layer. For another example, the lower layer of the PDCP layer may include any one or more of the following: the PHY layer, the MAC layer, and the RLC layer. For another example, the upper layer of the PDCP layer may include any one or more of the following: the RRC layer, the SDAP layer, and the application layer. FIG7 is a schematic diagram of a PDCP PDU provided in an embodiment of the present application. Among them, FIG7 (a) shows the PDCP data PDU format of a signaling radio bearer (SRB). FIG7 (b) shows the PDCP data PDU format of a 12-bit PDCP SN. FIG7 (c) shows the PDCP data PDU format of a data radio bearer (DRB) of an 18-bit PDCP SN. For the transmitting end, for the data (e.g., PDCP SDU) received from the SDAP layer or the RRC layer, the PDCP layer may undergo certain processing (e.g., any one or more of header compression, encryption, integrity protection, and adding a PDCP PDU header) or not process the data to obtain the PDCP PDU. The PDCP PDU may include at least one of the following information (or, fields): SN, reserved bit R, PDU type, data, and message authentication code for integrity (MAC-I). For example, the SN field may be used to indicate the SN information of the PDCP PDU or PDCP SDU. For example, the number of bits of the SN field (or the number of bits occupied) may be 12 bits or 18 bits. For example, the R field is a reserved bit. For example, the PDU type field may be used to indicate whether the PDCP PDU is a PDCP data PDU or a PDCP control PDU. For example, the PDU type may be represented by D / C. For example, the number of bits (or the number of bits occupied) of the PDCP type field may be 1 bit. For example, the data domain may include any one or more of the following: PDCP service data unit (SDU), compressed PDCP SDU, uncompressed PDCP SDU. For example, data may be represented by Data. For example, the data domain may be represented by the Data domain. It should be noted that the data in the data domain may be encrypted or unencrypted. For example, any one or more of the PDCP SDU, compressed PDCP SDU, and uncompressed PDCP SDU may include: user plane data, and / or control plane data. For example, the number of bits of the data domain (or, the number of bits occupied) may be variable. For example, the number of bits of the data domain (or, the number of bits occupied) may be X bytes, or 8 times Y bits, where X and / or Y may be positive integers. For example, the MAC-I field may be used for integrity protection. For example, the number of bits of the MAC-I field (or the number of bits occupied) may be 32 bits. For the PDCP layer, PDU can be divided into two categories: data PDU and control PDU. PDCP data PDU can carry control plane data and / or user plane data. PDCP control PDU mainly carries any one or more of robust header compression (ROHC) feedback, Ethernet header compression (EHC) feedback and PDCP status report. 4. PDCP operation: COUNT can be used for one or more of the following functions: integrity protection and integrity verification, encryption and decryption, header compression and header decompression, in-order delivery, and duplicate discard. For example, after the sender uses COUNT to encrypt the data packet, it sends the encrypted data packet to the receiver, and the receiver needs to decrypt the data packet according to COUNT. It should be understood that, in general, one PDCP PDU is associated with one COUNT. For example, COUNT is 32 bits. As shown in Figure 8, COUNT may include two parts: a high-order hyper frame number (HFN) and a low-order PDCP sequence number (SN). Among them, the number of bits of the PDCP SN is configured by the upper layer (for example, the RRC layer) or the network device, and the number of bits of the HFN changes with the number of bits of the PDCP SN. For example, the number of bits of the PDCP SN can be 12 bits or 18 bits, and accordingly, the number of bits of the HFN can be (32-PDCP SN size) bits, wherein the PDCP SN size is the number of bits of the PDCP SN. For example, if the PDCP SN size is 12 bits, the number of bits of the HFN is (32-12) bits, that is, 20 bits. In order to avoid air interface overhead, the PDCP PDU does not include the complete COUNT but only includes the lower bits of COUNT (ie, SN). For example, RCVD_HFN: the HFN of the received PDCP data PDU calculated by the receiving PDCP entity; For example, RCVD_SN: PDCP SN of the received PDCP data PDU, included in the PDU header; For example, RCVD_COUNT: the count value of received PDCP data PDUs COUNT = [RCVD_HFN, RCVD_SN]. For example, the reordering window may include / be replaced by: a receiving window, or a PDCP window, or a PDCP receiving window. For example, RX_DELIV is a state variable indicating the COUNT value of the first PDCP SDU that has not been delivered to the upper layer but is still waiting. For example, the initial value of RX_DELIV may be 0. For example, RX_DELIV may also be understood as the lower limit of the reordering window. For example, RX_NEXT indicates the COUNT value of the next PDCP SDU expected to be received. is 0. For example, RX_REORD indicates a COUNT value subsequent to the COUNT value associated with the PDCP data PDU that triggered t-Reordering. For example, t-Reordering: used to detect the loss of PDCP data PDU. For example, if t-Reordering is running, t-Reordering should not be started separately. It is understood that a receiving PDCP entity cannot start multiple t-Reorderings at the same time; or, at a given time, a receiving PDCP entity only runs one t-Reordering. Optionally, the duration of t-Reordering is configured by the RRC layer or the network device. 4.1. Operations after receiving a PDCP data PDU: After receiving the PDCP data PDU, the receiving end (eg, receiving PDCP entity) needs to calculate the HFN to obtain the COUNT. For example, the method for calculating the HFN by the receiving end may include any one or more of the following: For example, the reordering window size is equal to 2 (X-1) , X represents the number of bits corresponding to SN. For example, RX_DELIV indicates the COUNT of the first PDCP SDU that has not been delivered to the upper layer but is still waiting. For example, the initial value of RX_DELIV is 0. In addition, ">=" means greater than or equal to. The receiving end (eg, receiving PDCP entity) determines the COUNT of the PDCP data PDU according to the calculated PDCP HFN of the PDCP data PDU and the PDCP SN of the PDCP data PDU, which may be referred to as RCVD_COUNT. For example, after the receiving end (e.g., the receiving PDCP entity) determines the COUNT of the PDCP data PDU, any one or more of the following may be performed: If, according to the above determination, the received PDCP data PDU with COUNT value = RCVD_COUNT is not discarded, the receiving end (e.g., receiving PDCP entity) may perform one or more of the following: For example, with respect to the introduction of the above operations (1) to (5), it can be seen that in operation (1), the receiving end storing the received PDCP PDU in the buffer has an impact on the in-order delivery and / or RX_DELIV update in operation (3). 4.2. Operations when t-Reordering times out: If t-Reordering times out, the receiving end (e.g., receiving PDCP entity) may perform one or more of the following: For example, after receiving the PDCP PDU, the receiving end first determines the COUNT of the PDCP PDU, and determines whether to discard the PDCP PDU according to the COUNT of the PDCP PDU. If the receiving end determines not to discard the PDCP PDU, the receiving end further performs a reordering process according to the relationship between the COUNT of the PDCP PDU and a state variable (e.g., RX_NEXT and / or RX_DELIV). The reordering process may include updating of state variables and / or delivery of data. It should be noted that for PDCP-related content, please refer to 3GPP TS 38.323: "NR; Packet Data Convergence Protocol (PDCP) protocol specification", which will not be repeated here. From the perspective of the transmitter, in some cases, the transmitter may discard some (or certain) data. For example, if some data has not been transmitted or has not been transmitted after reaching its delay requirement, the transmitter may discard this data, that is, the transmitter will not continue to send this data. For another example, in the case of network congestion, the transmitter may discard some data. In this case, according to the technology introduced above, the PDCP window (or RX_DELIV) of the receiving end may be stuck for a period of time due to the discarded data until t-Reordering times out, and the PDCP window will not move, which may increase the delay of the PDCP layer delivering data to the upper layer. For example, the delay requirement may take into account any one or more of the following: a packet delay budget (PDB), a PDU set delay budget (PSDB), a timer associated with discarded data, and the like. When the sender discards data, the receiver may need to continue waiting for the data before the discarded data, such as in the following scenario: Scenario 1: In the case of network congestion, the sender discards data #1 (e.g., unimportant data), while the data before data #1 (e.g., data #2, e.g., important data) is not discarded and may not exceed / reach its delay requirement. The receiver needs to continue to receive (or, wait for) the data before data #1. For example, for communication between a network device and a terminal device, the situation of network congestion can be indicated by the network device to the terminal device, or can be detected and determined by the terminal device / network device itself, or the terminal device reports it to the network device, and this application does not make any specific limitations. For example, for communication between a terminal device and a terminal device, the situation of network congestion can be indicated by the terminal device to the terminal device, or can be detected and determined by the terminal device itself, or can be indicated by the network device to the terminal device, or can be reported by the terminal device to the network device, and this application does not make any specific limitations. Scenario 2: When a data packet exceeds / reaches its delay requirement, assuming that different data packets correspond to different discard timers, data #1 exceeds the delay requirement, and the sender discards data #1. The data before data #1 (for example, data #2) does not exceed the delay requirement and is not discarded. The receiver needs to continue to receive (or wait for) the data before data #1. For the above-mentioned scenarios 1 and 2, the transmitting end determines to discard the data, and the receiving end may need to continue to receive (or, wait for) the data before discarding the data. The communication method provided in the embodiment of the present application will be described in detail below in conjunction with the accompanying drawings. Among them, in the embodiment of the present application, the first device is taken as the receiving end as an example to introduce the method in the embodiment of the present application. FIG. 9 is a schematic flow chart of a communication method provided in an embodiment of the present application, as shown in FIG. 9 : 901, the first device receives information on discarding data. In a possible implementation manner, the first device may receive the information about discarding the data from the transmitting end, and the information about discarding the data may be sent to the first device via a PDCP control PDU. 902. The first device updates RX_DELIV to a first value. The first value may be equal to a maximum COUNT+1 of discarded data, or the first value may be greater than the maximum COUNT+1 of discarded data. As an example, assuming that the discarded data includes data #1, data #2, and data #3, the COUNT of data #1 is 3, the COUNT of data #2 is 4, and the COUNT of data #3 is 5. Among them, the maximum COUNT of the discarded data is 5, then the first device updates RX_DELIV to 5+1, that is, RX_DELIV is updated to 6. As another example, assuming that the discarded data only includes data #1, and the COUNT of data #1 is 9, the first device updates RX_DELIV to 9+1, that is, RX_DELIV is updated to 10. It should be understood that the first device updates RX_DELIV to the first value. Even if the first device later receives data before the first value, the first device will discard the data because the COUNT of the received data is smaller than RX_DELIV. As an example, assume that the first device updates RX_DELIV to 8 according to the information of discarding data. The first device has not received data with COUNT equal to 4 before receiving the information of discarding data. Later, the first device receives the data with COUNT equal to 4, and the first device still discards the data. As another example, as shown in FIG10 , the first device is a receiving end (RX), the second device is a transmitting end (TX), RX_DELIV of the first device corresponds to the COUNT of data #2 (e.g., 2), and RX_NEXT corresponds to the COUNT of data #4 (e.g., 4). The first device receives information about discarded data sent by the second device, and the information about discarded data includes data #4 and data #5. According to the method shown in FIG9 , the first device directly updates RX_DELIV to the COUNT of data #6 (e.g., 6). Subsequently, if the first device receives data #2, the first device will still discard the data #2. According to the method shown in FIG9 , after receiving the information of discarding data, the first device directly updates RX_DELIV to a value greater than or equal to the largest COUNT+1 in the discarded data. For the data before the smallest COUNT in the discarded data, even if the first device receives the corresponding data later, the first device will still discard the corresponding data, thereby causing the problem of data packet loss. In response to the technical problem existing in the above-mentioned FIG. 9 , an embodiment of the present application provides a communication method, which can solve the problem of data packet loss caused by the first device updating the state variable when the first device receives information about discarded data. FIG. 11 is a schematic block diagram of another communication method provided in an embodiment of the present application. 1101. A first device determines first information. Exemplarily, in the present application, determining may include / be replaced by: obtaining, or receiving. Optionally, the first information may include: information on a count value of the first data. For example, the first data includes / is: discarded data, or, data discarded by the second device. For example, the first device is a receiving end, and the second device is a transmitting end. For example, the first device may be a terminal device, and the second device may be a network device. Or, for example, the first device may be a network device, and the second device may be a terminal device. Or, for example, the first device may be a terminal device, and the second device may be a terminal device. As an example, the second device may discard the first data due to network congestion, or the second device may discard the first data because the first data exceeds / reaches its delay requirement, or the second device may discard the first data due to other reasons, which is not specifically limited in this application. Exemplarily, in the present application, the data may include / be replaced by: PDCP PDU, or PDCP data PDU, or PDCP SDU. For example, the count value of the first data may also be referred to as a first count value, or a first COUNT, or other names, which are not specifically limited in the present application. For example, the first data is associated with the first PDCP entity and / or the first RB. Optionally, before step 1101, the present application also includes: 1100, the first device obtains second information. Exemplarily, in the present application, obtaining may include / be replaced by: receiving. For example, the first device obtains the second information, which may include any one or more of the following: the PDCP layer of the first device obtains the second information; or, the PDCP layer of the first device receives / obtains the second information from a lower layer (for example, the RLC layer); or, the first device obtains the second information from the second device, and accordingly, the second device sends the second information to the first device. Optionally, the second information may include: information about the SN of the first data, or information about the first count value. Exemplarily, in the present application, SN may include / be replaced by: PDCP SN. For example, SN of the first data may include / be replaced by: PDCP SN of the first data. Optionally, the first device determines the first information, which may include: the first device determines the first count value according to any one or more of the SN of the first data, the first state variable (or the SN of the first state variable), and the first parameter. For example, the SN of the first state variable may include / be replaced by: the SN portion of the first state variable. Optionally, the first state variable is used to indicate the count value of the first data waiting to be delivered, or the count value of the first data that has not been delivered and is waiting to be delivered, or the count value of the first data waiting to be received, or the count value of the first data that has not been received and is waiting to be received, or the count value of the first data that has not been received and is waiting to be delivered. Exemplarily, the first state variable may include RX_DELIV. For example, the first state variable is RX_DELIV. For example, RX_DELIV may indicate the COUNT of the first PDCP PDU that has not been delivered to the upper layer and is waiting. For example, RX_DELIV may be understood as the lower limit of the reordering window. For example, the reordering window may also include / replace with: a receiving window, or a PDCP window, or a PDCP receiving window. Optionally, the first parameter can be the reordering window size (or 2 (X-1) ). For example, X represents the number of bits of SN. For example, the upper layer may include: an SDAP layer, or an RRC layer. For example, any one or more of the first state variable, the first parameter, and X are associated with the first PDCP entity and / or the first RB. For example, the first device determines the HFN of the first data according to any one or more of the following: (1) If the SN of the first data < (SN of the first state variable - the first parameter), the HFN of the first data = the HFN of the first state variable + 1; (2) If the SN of the first data is greater than or equal to (SN of the first state variable + first parameter), or, if the SN of the first data is greater than or equal to (SN of the first state variable - first parameter) and the SN of the first data is greater than or equal to (SN of the first state variable + first parameter), the HFN of the first data is equal to the HFN of the first state variable - 1; (3) If the SN of the first data>=(SN of the first state variable-first parameter) and / or the SN of the first data<(SN of the first state variable+first parameter), the HFN of the first data=HFN of the first state variable. For example, the first device obtains a first count value according to the SN of the first data and the HFN of the first data. For example, if the first device obtains the first count value, the first device can directly determine the first information. Optionally, the first information may include: information of a count value of at least one data. For example, the count value of at least one data may include / be replaced by one or more of the following: a start count value of at least one data, an end count value of at least one data, and a count value of one or more data included in at least one data. For example, at least one data may include / be replaced by: a first data set. For example, at least one data includes / is: discarded data, or, data discarded by the second device. For example, each data in the at least one data is discarded data. For example, at least one data may include first data. Optionally, the first data may be any one of the at least one data. For example, the first data is data with the smallest count value in the at least one data; or the first data is data with the largest count value in the at least one data; or the first data is data with an intermediate count value in the at least one data, which is not specifically limited in this application. Optionally, the count value of each data in the at least one data may be continuous or discontinuous, without limitation. For example, at least one data is associated with the first PDCP entity and / or the first RB. Optionally, the second information may include: one or more of the following information of at least one data: a starting SN, an ending SN, a starting count value, an ending count value, a first quantity, an SN of one or more included data, and a count value of one or more included data. Optionally, the starting SN of at least one data may be: the SN of the data with the smallest count value in the at least one data, or the SN of the data with the smallest SN in the at least one data. It should be noted that the starting SN of at least one data is not necessarily the SN of the data with the smallest SN in the at least one data, or the starting SN of at least one data is not necessarily less than or equal to the SN of each data in the at least one data. Optionally, the ending SN of at least one data may be: the SN of the data with the largest count value in the at least one data, or the SN of the data with the largest SN in the at least one data. It should be noted that the ending SN of at least one data is not necessarily the SN of the data with the largest SN in the at least one data, or the ending SN of at least one data is not necessarily greater than or equal to the SN of each data in the at least one data. Optionally, the starting count value of at least one data may be: the count value of the data with the smallest count value among the at least one data. Optionally, the terminal count value of at least one data may be: the count value of the data with the largest count value among the at least one data. For example, "one or more data included" may include / be replaced by: part or all of the data included. For example, the first number is the number of data in the at least one data. As an example, at least one data includes data #1, data #2, and data #3. Then the first number of at least one data is 3. Assuming that the number of bits of SN is equal to 12, the count value of data #1 is 4095, the HFN and SN of data #1 are 0 and 4095 respectively, the count value of data #2 is 4096, the HFN and SN of data #1 are 1 and 0 respectively, the count value of data #3 is 4097, and the HFN and SN of data #3 are 1 and 1 respectively, then the starting count value of at least one data is 4095, the ending count value is 4097, the starting SN of at least one data is 1, and the ending SN is 0. As an example, at least one data includes data #1, data #2, and data #3. Then the first quantity of at least one data is 3. Assuming that the count values ​​of data #1, data #2, and data #3 are 6, 8, and 9 respectively, then the starting count value of at least one data is 6, and the ending count value is 9. For example, assuming that the SNs of data #1, data #2, and data #3 are 1, 2, and 3 respectively, then the starting SN of at least one data is 1, and the ending SN is 3. In a possible implementation manner, after the first device acquires the second information, the first device may determine a count value of at least one data. Optionally, the first device determines the first information, which may include: the first device may determine the starting count value of at least one data based on the starting SN of at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. Optionally, the first device determines the first information, which may include: the first device may determine the termination count value of at least one data based on the termination SN of at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. Optionally, the first device determines the first information, which may include: the first device may determine the count value of one or more data contained in at least one data based on the SN of one or more data contained in the at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. As another example, assuming that the first device obtains the starting SN and the first quantity of at least one data, the first device can determine the starting count value of at least one data according to any one or more of the starting SN, the first state variable (or the SN of the first state variable), and the first parameter. And according to the starting count value and the first quantity of at least one data, determine the count value (for example, the ending count value) of any one or more data (or, other part or all data) in the at least one data. For example, at least one data includes data #1, data #2, and data #3. The first quantity of at least one data is 3. Assuming that the first device obtains the starting SN (e.g., 4095) and the first quantity (e.g., 3) of at least one data, assuming that the first device determines the starting count value of at least one data as 4095 according to the starting SN of at least one data (e.g., 4095), the first state variable (or the SN of the first state variable), and any one or more of the first parameters, then the first device determines the count values ​​of other data (e.g., other 2 data) as 4096 (e.g., 4095+1) and 4097 (e.g., 4095+2, or, 4096+1) according to the starting count value of at least one data (e.g., 4095) and the first quantity (e.g., 3), respectively. 1102. The first device updates a state variable according to a first count value or a count value of at least one data or a count value of one or more data in at least one data. For example, after the first device determines the first information, it updates the state variable according to the first count value or the count value of at least one data or the count value of one or more data in the at least one data included in the first information. For example, the state variable update may include / be replaced by: reordering, or, reordering procedure, or, PDCP window update. Optionally, the present application also includes: 1103, the first device regards the first data or at least one data as having been received by the first device. Optionally, “considered to have been received by the first device” may include / be replaced by: regarded to have been received by the first device and stored in the cache. For example, step 1103 may be performed before step 1102, after step 1102, or at the same time as step 1102, which is not limited in the present application. In one possible implementation, the first device determines the first information, the first device regards the first data or at least one data as having been received by the first device, and updates the state variable according to the first count value or the count value of at least one data or the count value of one or more data in the at least one data. Optionally, if the first condition is met, the first device executes step 1103. Optionally, if the first condition is met, the first device executes step 1102. For example, the first condition may include: the first state variable is less than or equal to a first count value (or a start count value of at least one data or an end count value of at least one data or any count value of at least one data). For example, any count value of at least one data may include / be replaced by: one (e.g., one of, or, any one) count value of at least one data, or, a count value of one (e.g., one of, or, any one) data of at least one data. As an example, assume that the first state variable is =3, and the count value of data #1 is =6. The first device determines that the first information includes the count value of data #1, and data #1 is discarded data. The first state variable is less than the count value of data #1: 3<6, and the first device regards data #1 as having been received by the first device. The first device updates the state variable according to the count value of data #1. As an example, assume that the first state variable is 3 and the count value of data #1 is 6. The first device determines that the first information includes the count value of data #1 and data #1 is discarded data. The first state variable is less than the count value of data #1: 3<6, and the first device updates the state variable according to the count value of data #1. Optionally, the first device updates the state variable according to the first count value or the count value of at least one data or the count value of one or more data in at least one data, which may include / be replaced by any one or more of operation A, operation B, operation C, operation D, and operation E. Operation A: If the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data) is greater than or equal to the second state variable, the first device updates the second state variable to: the sum of the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data) and 1. Or, if the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data) is greater than or equal to the second state variable, the first device updates the second state variable to: the sum of the first count value (or the starting count value of at least one data) and the first quantity. Optionally, the second state variable is used to indicate the count value of the next data expected to be received. Exemplarily, the second state variable may include RX_NEXT. For example, the second state variable is RX_NEXT. For example, RX_NEXT may indicate the COUNT indicating the next PDCP PDU expected to be received. For example, RX_NEXT may be understood as the count value of the data with the largest count value received / deemed to be received plus 1. As an example, assuming that the first count value is 6, the second state variable is 3, and the first count value is greater than the second state variable, the first device updates the second state variable to 6+1, that is, the second state variable is updated to 7. In a possible implementation, the first information includes a count value of at least one data, and if the count value of at least one data is greater than or equal to the second state variable or if the starting count value of at least one data is greater than or equal to the second state variable, the first device may update the second state variable according to the count value of each data in the at least one data. For example, if the first number is 3, the first device may perform 3 updates of the second state variable. For example, assume that the second state variable is RX_NEXT, and RX_NEXT is 2. The first information determined by the first device includes a count value of at least one data. The at least one data includes data #1 and data #2. Data #3. The COUNT of data #1 is 3, the COUNT of data #2 is 4, and the COUNT of data #3 is 5. The first device updates the second state variable according to the COUNT of each data. The COUNT of data #1 is 3, and 3>2, and RX_NEXT is updated to the COUNT of data #1+1, that is, RX_NEXT is updated to 4; the COUNT of data #2 is 4, and 4=4, and RX_NEXT is updated to the COUNT of data #2+1, that is, RX_NEXT is updated to 5; the COUNT of data #3 is 5, and 5=5, and RX_NEXT is updated to the COUNT of data #3+1, that is, RX_NEXT is updated to 6. In another possible implementation, the first information includes a count value of at least one data, and if the count value of at least one data is greater than or equal to the second state variable, or if the starting count value of at least one data is greater than or equal to the second state variable, or if the ending count value of at least one data is greater than or equal to the second state variable, the first device may update the second state variable according to the starting count value or the ending count value of the at least one data. For example, if the first number is 3, the first device may perform one update of the second state variable. For example, assume that the second state variable is RX_NEXT, and RX_NEXT is 2. The first information determined by the first device includes a count value of at least one data. The at least one data includes data #1, data #2, and data #3. The first number = 3. The COUNT of data #1 is 3, the COUNT of data #2 is 4, and the COUNT of data #3 is 5. The first device updates the second state variable according to the starting count value (for example, 3) or the ending count value (for example, 5) in at least one data. For example, if the starting count value in at least one data is 3, and 3>2, RX_NEXT is updated to the starting count value (COUNT of data #1)+3 in at least one data, or, RX_NEXT is updated to the ending count value (COUNT of data #3)+1 in at least one data, that is, RX_NEXT is updated to 6. For example, if the ending count value in at least one data is 5 and 5>2, RX_NEXT is updated to the starting count value in at least one data (COUNT of data #1) + 3, or, RX_NEXT is updated to the ending count value in at least one data (COUNT of data #3) + 1, that is, RX_NEXT is updated to 6. Optionally, the first information may also include a first quantity of information. For example, the first data is the data with the smallest count value in at least one data, and the first count value is greater than or equal to the second state variable. The first device can directly update the second state variable according to the first count value and the first quantity, without having to update the second state variable according to the COUNT of each data in at least one data. Operation B: If the first count value (or the start count value of at least one data or the end count value of at least one data or any count value of at least one data) is equal to the first state variable, the first device submits at least one third data. For example, the submitting may include / be replaced by submitting to an upper layer or an upper layer of the first device. Exemplarily, the third data may include any one or more of the following: data received by the first device or the PDCP layer of the first device, data not delivered by the first device or the PDCP layer of the first device, and data existing / stored in the receiving buffer of the first device or the PDCP layer of the first device. Exemplarily, the count value corresponding to the third data is greater than or equal to the first state variable. For example, the count values ​​of the at least one third data may be continuous. For example, the at least one third data may not include: discarded data, or data deemed to have been received by the first device. For example, the count value of the at least one third data may be continuous except for discarded data (or, data regarded as having been received by the first device). For example, the at least one third data may include any one or more of the following: data that has been received and not delivered, and whose count value is greater than or equal to the first state variable; data that exists / stored in the receive buffer of the first device or the PDCP layer of the first device, and whose count value is greater than or equal to the first state variable; data that is continuously received (or deemed to be received) / continuously stored (or deemed to be stored) after the first state variable; data received (or deemed to have been received) / stored in sequence (or deemed to have been stored); data whose count value is greater than or equal to the first state variable and which is continuously received (or deemed to have been received) / stored in sequence (or deemed to have been stored); data whose count value is greater than or equal to the first state variable and which is continuously received (or deemed to have been received) / stored in sequence (or deemed to have been stored); data whose count value is greater than or equal to the first state variable and which is continuously received (or deemed to have been received) / stored in sequence (or deemed to have been stored); data whose count value is greater than or equal to the first state variable and which is continuously received (or deemed to have been received) / stored in sequence (or deemed to have been stored) except for the discarded data (or, deemed to have been received by the first device). Starting from the first state variable, data whose count value is greater than or equal to the first state variable and which is continuously received (or deemed to have been received) / stored (or deemed to have been stored) except for the discarded data (or, deemed to have been received by the first device). It should be noted that "continuously received data" does not limit the first device to receive the data in sequence continuously when receiving, and it only means that the COUNT values ​​of the received data are continuous. Optionally, the continuously received data refers to data with continuous count values, and does not mean that the first device or the PDCP layer of the first device receives the data continuously when receiving the data. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. If the first count value is equal to the first state variable, the first device can submit data #5 and data #6 to the upper layer. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. The COUNT of the data deemed to have been received by the first device is 7. If the first count value is equal to the first state variable, the first device can submit data #5, data #6, and data #7 to the upper layer. In a possible implementation, after the first device submits at least one third data, the first device may also update the first state variable to a fourth count value. Operation E: If the first count value (or the start count value of at least one data or the end count value of at least one data or any count value of at least one data) is equal to the first state variable, the first device updates the first state variable to a fourth count value. Optionally, the fourth count value is greater than the first state variable. Optionally, data corresponding to the fourth count value is not received by the first device. Optionally, the data corresponding to the fourth count value does not include / is not: discarded data, or, data deemed to have been received by the first device. For example, the data corresponding to the fourth count value not received by the first device may include / be replaced by any one or more of the following: the data corresponding to the fourth count value has not been submitted to the upper layer, and the data corresponding to the fourth count value does not exist / is not stored in the receiving buffer of the first device or the PDCP layer of the first device. For example, the data corresponding to the fourth count value may include / be replaced by the PDCP SDU or PDCP PDU corresponding to the fourth count value. Optionally, the data corresponding to the fourth count value is the first unreceived data whose count value is greater than the first state variable. Optionally, the data corresponding to the fourth count value is the first unreceived data whose count value is greater than the first state variable except for the discarded data (or, the data deemed to have been received by the first device). For example, the first unreceived data whose count value is greater than the first state variable may include / be replaced by any one or more of the following: the first data whose count value is greater than the first state variable and has not been submitted to the upper layer, the first data whose count value is greater than the first state variable and does not exist / is not stored in the receiving buffer of the first device or the PDCP layer of the first device. For example, the first unreceived data, except the discarded data (or, data deemed to have been received by the first device), whose count value is greater than the first state variable, may include / be replaced by any one or more of the following: the first data, except the discarded data (or, data deemed to have been received by the first device), whose count value is greater than the first state variable, that has not been delivered to the upper layer, and the first data, except the discarded data (or, data deemed to have been received by the first device), whose count value is greater than the first state variable, that does not exist / is not stored in the receiving buffer of the first device or the PDCP layer of the first device, except the discarded data (or, data deemed to have been received by the first device). For example, the first device updates the first state variable to the COUNT of the first data (e.g., PDCP SDU) that has not been delivered to the upper layer, and the COUNT of the first data is greater than the first state variable. For example, the first device updates the first state variable to the first hole after the first state variable. For example, the first device updates the first state variable to the first hole after the first state variable except for the discarded data (or, the data deemed to have been received by the first device). As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. If the first count value is equal to the first state variable, the first device delivers data #5 and data #6 to the upper layer. The first device determines that the COUNT of the first PDCP SDU that is not delivered to the upper layer is 7, and the first device updates the first state variable RX_DELIV from 4 to 7. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. The COUNT of the data deemed to have been received by the first device is 7. If the first count value is equal to the first state variable, the first device submits data #5, data #6, and data #7 to the upper layer. The first device updates the first state variable RX_DELIV from 4 to 9. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 7. The COUNT of the data deemed to have been received by the first device is 8. If the first count value is equal to the first state variable, the first device submits data #5, data #6, and data #7 to the upper layer. The first device updates the first state variable RX_DELIV from 4 to 9. Operation C: When the reordering timer is running and the first state variable is greater than or equal to the third state variable, the first device stops the reordering timer. For example, when the reordering timer is running, it may be included / replaced with: if the reordering timer is running. For example, stopping may include: stopping and resetting. For example, the reordering timer is used to detect data loss. Exemplarily, the reordering timer may be t-Reordering. For example, the third state variable is used to indicate that the count value of the data triggering the reordering timer is increased by 1. Exemplarily, the third state variable may include RX_REORD. For example, the third state variable is RX_REORD. As an example, assuming that the first state variable = 4 and the third state variable = 2, it means that the first device has received the data before the first state variable or no longer needs to receive the data. The first device stops the reordering timer. In one possible implementation, the first device determines that the first state variable is greater than or equal to the third state variable, and the first device stops and resets the reordering timer. As an example, assuming that the first state variable=4, the third state variable=2, the first state variable is greater than the third state variable, and the first device stops the reordering timer. Operation D: When the reordering timer is not running and the first state variable is less than the second state variable, the first device starts the reordering timer, and / or the first device updates the third state variable to the second state variable. For example, when the reordering timer is not running, it may include / replace with: if the reordering timer is not running. As an example, when the reordering timer is not running, assuming that the first state variable = 4 and the second state variable = 7, it means that the first device has received data with a count value of 6, and the first device has not received the data before the data with a count value of 6, or it can be called a hole, and the first device starts the reordering timer. As another example, the first device starts the reordering timer based on the first state variable being less than the second state variable. The first device may also update the third state variable RX_REORD to RX_NEXT. For example, the first device updates RX_REORD to 7. It should be understood that the above lists the possible operations that the first device may implement when updating the state variable according to the first count value. The above operations A, B, C, D, and E do not limit the before-and-after relationship. The first device may perform one or more of the operations A, B, C, D, and E, and this application does not make specific limitations on this. For example, operation B precedes operation E. For example, operation E precedes operation C. For example, operation C precedes operation D. For example, operation A precedes operation D. For example, the first device updates the state variable according to the relationship between the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data), the first state variable, the second state variable, and the third state variable. For example, the at least one data includes three data, and the first device may execute step 1102 once, or the first device may execute step 1102 three times. According to the method shown in FIG. 11 above, the first device determines the count value of the first data, and updates the state variable according to the first count value. The first data is discarded data, and the first device updates the state variable according to the count value of the discarded data, providing a state update method, effectively avoiding the problem that the PDCP window (or, RX_DELIV) of the receiving end may be stuck due to the discarded data, reducing the delay of the PDCP layer submitting data to the upper layer, effectively avoiding the problem of data packet loss, and thus improving transmission reliability. FIG. 12 is a schematic block diagram of another communication method provided in an embodiment of the present application. 1201. A first device determines first information. Optionally, the first information may include information of a count value of at least one data. For example, the at least one data includes / is: discarded data, or, data discarded by the second device. For example, at least one data includes one or more data. As an example, at least one data may be discarded by the second device due to network congestion, or at least one data may be discarded by the second device due to timeout / reaching its delay requirement, or at least one data may be discarded by the second device due to other reasons, which is not specifically limited in this application. It should be understood that the content related to step 1201 can refer to the content related to the above-mentioned Figure 11 (for example, step 1101), which will not be repeated here. Optionally, before step 1201, the present application also includes: 1200, the first device obtains second information. Optionally, the second information may include: one or more of the following information of at least one data: a starting SN, an ending SN, a starting count value, an ending count value, a first quantity, an SN of one or more included data, and a count value of one or more included data. Optionally, the count value of each data in the at least one data may be continuous. It should be understood that the content related to step 1200 can refer to the content related to Figure 11 (for example, step 1101 and / or step 1100) above, and will not be repeated here. Optionally, the first device determines the first information, which may include: the first device may determine the starting count value of at least one data based on the starting SN of at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. Optionally, the first device determines the first information, which may include: the first device may determine the termination count value of at least one data based on the termination SN of at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. Optionally, the first device determines the first information, which may include: the first device may determine the count value of one or more data contained in at least one data based on the SN of one or more data contained in the at least one data, the first state variable (or the SN of the first state variable), and any one or more of the first parameters. Optionally, in step 1202, the first device updates a state variable according to a count value of at least one data, or a count value of one or more data in at least one data. For example, after the first device determines the first information, it updates the state variable according to the count value of at least one data included in the first information or the count value of one or more data in the at least one data. Optionally, if the second condition is met, the first device executes step 1202. For example, the second condition may include: the first state variable is equal to (or greater than or equal to) a first count value (or a start count value of at least one data or an end count value of at least one data or any count value of at least one data). For example, satisfying the second condition may include / be replaced by: when the first state variable is equal to (or, greater than or equal to) the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data), or, until the first state variable is equal to (or, greater than or equal to) the first count value (or the starting count value of at least one data or the ending count value of at least one data or any count value of at least one data). Optionally, the first count value is a count value of the first data. For example, the first data is data with the smallest count value among the at least one data. For example, the first count value is a starting count value of the at least one data. As an example, assume that the first state variable is =3, at least one data includes data #1, data #2, the count value of data #1 is =3, and the count value of data #2 is =4. The first device determines that the first information includes the count values ​​of data #1 and data #2, and data #1 and data #2 are discarded data. The first state variable is equal to the count value of data #1: 3=3. The first device updates the state variable according to the count value of data #1 and / or data #2. Optionally, the second data first device updates the state variable according to the count value of at least one data, or the count value of one or more data in the at least one data, and may include / replace any one or more of operation A', operation B', operation C', and operation D'. Operation A′: The first device delivers at least one data whose received count value is greater than or equal to the second count value plus 1. Optionally, the second count value is a count value of the second data. For example, the second data is data with the largest count value among the at least one data. For example, the second count value is a termination count value of the at least one data. Exemplarily, the first device submits at least one data having a received count value greater than or equal to a second count value plus 1, which may include any one or more of the following: data received by the first device or the PDCP layer of the first device, data not submitted by the first device or the PDCP layer of the first device, and data existing / stored in a receiving buffer of the first device or the PDCP layer of the first device. For example, the count values ​​of at least one data having a count value greater than or equal to the second count value plus 1 that has been received may be continuous. For example, the first device submits at least one data whose received count value is greater than or equal to the second count value plus 1, which may include / be replaced by: the first device submits at least one fourth data whose received count value is greater than or equal to the second count value plus 1. Exemplarily, the fourth data may include any one or more of the following: data received by the first device or the PDCP layer of the first device, data not delivered by the first device or the PDCP layer of the first device, and data existing / stored in the receiving buffer of the first device or the PDCP layer of the first device. Exemplarily, the count value corresponding to the fourth data is greater than or equal to the second count value plus 1. For example, the count values ​​of the at least one fourth data may be continuous. For example, at least one fourth data may include any one or more of the following: data that has been received and not delivered and whose count value is greater than or equal to the second count value plus 1; data that exists / stored in the receiving buffer of the first device or the PDCP layer of the first device and whose count value is greater than or equal to the second count value plus 1; data that is continuously received / continuously stored after the second count value is added by 1; data that is continuously received / continuously stored with a count value greater than or equal to the second count value plus 1; data that is continuously received / continuously stored starting from the second count value plus 1;. It should be noted that "continuously received data" does not limit the first device to receive the data in sequence continuously when receiving, and it only means that the COUNT values ​​of the received data are continuous. Optionally, the continuously received data refers to data with continuous count values, and does not mean that the first device or the PDCP layer of the first device receives the data continuously when receiving the data. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. If the first count value is equal to the first state variable, the first device can submit data #5 and data #6 to the upper layer. It should be understood that the above operation A' is similar to the operation B in step 1102 in FIG. 11 . For details, please refer to the description in FIG. 11 . To avoid redundancy, no further examples are given here. In a possible implementation, after the first device submits at least one data whose received count value is greater than or equal to the second count value plus 1, the first device may also update the first state variable to a third count value. Operation B′: The first device updates the first state variable to a third count value. Optionally, the third count value is greater than the first state variable. Optionally, the third count value is greater than the second count value. Optionally, the first device does not receive data corresponding to the third count value. Optionally, the data corresponding to the third count value does not include / is not: discarded data. For example, the data corresponding to the third count value not received by the first device may include / be replaced by any one or more of the following: the data corresponding to the third count value has not been submitted to the upper layer, and the data corresponding to the third count value does not exist / is not stored in the receiving buffer of the first device or the PDCP layer of the first device. For example, the data corresponding to the third count value may include / be replaced by the PDCP SDU or PDCP PDU corresponding to the third count value. Optionally, the data corresponding to the third count value is the first unreceived data whose count value is greater than the first state variable (or the second count value). Optionally, the data corresponding to the third count value is the first unreceived data whose count value is greater than the first state variable (or the second count value) except for the discarded data. For example, the first unreceived data whose count value is greater than the first state variable (or the second count value) may include / be replaced by any one or more of the following: the first data whose count value is greater than the first state variable (or the second count value) that has not been delivered to the upper layer, and the first data whose count value is greater than the first state variable (or the second count value) that does not exist / is not stored in the receiving buffer of the first device or the PDCP layer of the first device. For example, the first data that is not received except the discarded data and whose count value is greater than the first state variable (or the second count value) may include / be replaced by any one or more of the following: the first data that is not delivered to the upper layer except the discarded data and whose count value is greater than the first state variable (or the second count value), the first data that is not present / stored in the receiving buffer of the first device or the PDCP layer of the first device except the discarded data and whose count value is greater than the first state variable (or the second count value). For example, the first device updates the first state variable to the COUNT of the first data (e.g., PDCP SDU) that has not been delivered to the upper layer, and the COUNT of the first data is greater than the first state variable (or the second count value). For example, the first device updates the first state variable to the first hole after the first state variable (or the second count value). For example, the first device updates the first state variable to the first hole after the first state variable (or the second count value) except for the discarded data. As an example, assuming that the first state variable = 4, the data received and stored by the first device includes data #5, data #6, and data #7. The COUNT of data #5 is 5, the COUNT of data #6 is 6, and the COUNT of data #7 is 8. If the first count value is equal to the first state variable, the first device delivers data #5 and data #6 to the upper layer. The first device determines that the COUNT of the first PDCP SDU that is not delivered to the upper layer is 7, and the first device updates the first state variable RX_DELIV from 4 to 7. It should be understood that the above operation B' is similar to the operation E in step 1102 in FIG. 11 . For details, please refer to the description in FIG. 11 . To avoid redundancy, no further examples are given here. Operation C′: When the reordering timer is running and the first state variable is greater than or equal to the third state variable, the first device stops the reordering timer. Operation D′: When the reordering timer is not running and the first state variable is less than the second state variable, the first device starts the reordering timer, and / or the first device updates the third state variable to the second state variable. It should be understood that the above operations C' and D' are similar to the operations C and D in step 1102 shown in FIG. 11 . Please refer to the example in FIG. 11 for details. To avoid redundancy, they will not be described again here. It should be understood that the above lists specific examples of the first device being able to update the state variable when the second condition is met. The above operations A', B', C', and D' do not limit the context, and the first device can perform one or more of the operations A', B', C', and D', which are not specifically limited in this application. For example, operation A' precedes operation B'. For example, operation B' precedes operation C'. For example, operation C' precedes operation D'. It should be understood that after step 1201, the method may further include: Optionally, the present application may further include: 1203, the first device updates the second state variable to the second count value plus 1. For example, if the second count value (or the start count value of at least one data or the end count value of at least one data or any count value of at least one data) is greater than or equal to the second state variable, the first device executes step 1203. As an example, assume that the second state variable is RX_NEXT, and RX_NEXT is 3. The first device determines the count value of at least one data included in the first information. The at least one data includes data #1, data #2, and data #3. The COUNT of data #1 is 3, the COUNT of data #2 is 4, and the COUNT of data #3 is 5. The second count value of the at least one data is 5, and 5>3, the first device updates RX_NXET to the COUNT of data #3+1, that is, RX_NEXT is updated to 6. It should be understood that step 1203 and step 1202 shown in FIG. 12 above are not distinguished in terms of logical order, that is, the present application does not limit the order between step 1203 and step 1202. For example, step 1203 may be performed before step 1202, or step 1203 may be performed after step 1202, or step 1203 may be performed while step 1202 is performing state variable update. It should also be understood that the above-mentioned step 1203 may not be limited to the case where the second condition is met, and the first device may also execute step 1203, and this application does not make specific limitations on this. Optionally, only one of step 1202 and step 1203 may be performed, or both may be performed, which is not limited in this application. For example, the first device may only perform step 1202, may only perform step 1203, or may perform both step 1202 and step 1203. Optionally, after the first device determines the first information, if the third condition is met, the first device may ignore the first information. For example, the third condition may include that the first state variable is greater than the second count value (or a start count value of at least one data or an end count value of at least one data or any count value of at least one data). For example, the first device may ignore the first information, which may include / replace with: the first device may ignore the second information, and the first device does not perform step 1202 and / or step 1203. For example, when the first device determines the first information, the first information includes a count value of at least one data, and the first device determines that the second count value is less than the first state variable, the first device ignores the first information. In one possible implementation, after the first device determines the first information, if it determines that the third condition is not satisfied, the first device does not need to execute (or does not execute) the above steps 1202 and 1203, and the first device can simply ignore the first information. In one possible implementation, after the first device determines the first information, it determines that the third condition is satisfied, and the first device can / may execute the above step 1202 and / or step 1203. According to the method shown in FIG12 , the second condition is met, and the first device updates the state variable. A state update method is provided, which effectively avoids the problem that the PDCP window (or RX_DELIV) of the receiving end may be stuck due to discarded data, reduces the delay of the PDCP layer delivering data to the upper layer, effectively avoids the problem of data packet loss, and thus improves transmission reliability. The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application. In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this embodiment, unless otherwise specified, "plurality" means two or more. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products or devices. In the embodiments of the present application, the words "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the examples should not be interpreted as being more preferred or advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way for easy understanding. It should be understood that in the present application, "at least one (item)" refers to one or more. "Multiple" refers to two or more. "At least two (items)" refers to two or three and more than three. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b and (or) c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple. “When” and “if” both mean that corresponding measures will be taken under certain objective circumstances. It does not limit the time, nor does it require any judgment when it is implemented, nor does it mean that there are other limitations. It should be understood that the prior art may change with the evolution of technical solutions, and the technical solutions provided in this application are not limited to the provided prior art. It should be noted that different embodiments or some steps (for example, any one or more steps) in different embodiments in the present application can be combined with each other to form new embodiments. It should be noted that some steps or any one or more steps in different embodiments may include optional steps in a certain embodiment, mandatory steps in a certain embodiment, or optional steps and mandatory steps in a certain embodiment, and the present application does not limit this. It should be noted that, unless otherwise specified or there is no logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. It should be noted that the sequence of the steps in the embodiments of the present application is not limited by the present application. It should be noted that the order of judging different conditions in the embodiments of the present application is not limited by the present application. It should be noted that the words “after” and “when” in this application do not strictly limit the time point. It should be noted that the nouns, terms, etc. involved in this application are merely examples and may also be other names, which are not limited in this application. The above describes in detail the communication method side embodiment of the present application in conjunction with Figures 9 to 12, and the following describes in detail the communication device side embodiment of the present application in conjunction with Figures 13 and 15. It should be understood that the description of the device embodiment corresponds to the description of the method embodiment, and therefore, the part not described in detail can refer to the previous method embodiment. FIG13 is a schematic block diagram of a communication device 1300 provided in an embodiment of the present application. As shown in FIG13 , the device 1300 may include a transceiver unit 1310 and a processing unit 1320. The transceiver unit 1310 may communicate with the outside, the processing unit 1320 is used for data processing, and the transceiver unit 1310 may also be referred to as a communication interface or a transceiver unit. In one possible design, the device 1300 can implement steps or processes corresponding to those performed by the first device in the above method embodiment, wherein the processing unit 1320 is used to perform processing-related operations of the first device in the above method embodiment, and the transceiver unit 1310 is used to perform transceiver-related operations of the first device in the above method embodiment. It should be understood that the device 1300 here is embodied in the form of a functional unit. The term "unit" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a proprietary processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a merged logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art can understand that the device 1300 can be specifically the transmitting end in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the transmitting end in the above-mentioned method embodiment, or the device 1300 can be specifically the receiving end in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the receiving end in the above-mentioned method embodiment. To avoid repetition, it will not be repeated here. The device 1300 of each of the above-mentioned schemes has the function of implementing the corresponding steps performed by the sending end in the above-mentioned method, or the device 1300 of each of the above-mentioned schemes has the function of implementing the corresponding steps performed by the receiving end in the above-mentioned method. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions; for example, the transceiver unit can be replaced by a transceiver (for example, the sending unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor, respectively performing the transceiver operations and related processing operations in each method embodiment. In addition, the transceiver unit may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit. In the embodiment of the present application, the device in FIG. 13 may be the receiving end or the transmitting end in the aforementioned embodiment, or may be a chip Or a chip system, such as a system on chip (SoC). The transceiver unit may be an input / output circuit or a communication interface. The processing unit may be a processor or a microprocessor or an integrated circuit integrated on the chip. This is not limited here. FIG14 is a schematic block diagram of a communication device 2000 provided in an embodiment of the present application. As shown in FIG14, the device 2000 includes a processor 2010 and a transceiver 2020. The processor 2010 and the transceiver 2020 communicate with each other through an internal connection path, and the processor 2010 is used to execute instructions to control the transceiver 2020 to send signals and / or receive signals. Optionally, the device 2000 may further include a memory 2030, and the memory 2030 communicates with the processor 2010 and the transceiver 2020 through an internal connection path. The memory 2030 is used to store instructions, and the processor 2010 may execute the instructions stored in the memory 2030. In a possible implementation, the device 2000 is used to implement various processes and steps corresponding to the first device in the above method embodiment. It should be understood that the device 2000 can be specifically the transmitting end or the receiving end in the above embodiment, or can be a chip or a chip system. Correspondingly, the transceiver 2020 can be the transceiver circuit of the chip, which is not limited here. Specifically, the device 2000 can be used to execute the various steps and / or processes corresponding to the transmitting end or the receiving end in the above method embodiment. Optionally, the memory 2030 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory may also store information about the device type. The processor 2010 may be used to execute instructions stored in the memory, and when the processor 2010 executes instructions stored in the memory, the processor 2010 is used to execute the various steps and / or processes of the above-mentioned method embodiment corresponding to the transmitting end or the receiving end. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in a processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here. It should be noted that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. The processor in the embodiment of the present application can implement or execute the methods, steps and logic block diagrams disclosed in the embodiment of the present application. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor can be combined to perform. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware. It can be understood that the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory. FIG15 is a schematic block diagram of a chip system 3000 provided in an embodiment of the present application. As shown in FIG15 , the chip system 3000 (or also referred to as a processing system) includes a logic circuit 3010 and an input / output interface 3020 . Among them, the logic circuit 3010 can be a processing circuit in the chip system 3000. The logic circuit 3010 can be coupled to the storage unit and call the instructions in the storage unit so that the chip system 3000 can implement the methods and functions of each embodiment of the present application. The input / output interface 3020 can be an input / output circuit in the chip system 3000, outputting information processed by the chip system 3000, or inputting data or signaling information to be processed into the chip system 3000 for processing. As a solution, the chip system 3000 is used to implement the operations performed by the first device in each of the above method embodiments. For example, the logic circuit 3010 is used to implement the processing-related operations performed by the first device in the above method embodiment, such as the processing-related operations performed by the first device in the embodiment shown in Figure 11; the input / output interface 3020 is used to implement the sending and / or receiving-related operations performed by the first device in the above method embodiment, such as the sending and / or receiving-related operations performed by the first device in the embodiment shown in Figure 11. An embodiment of the present application also provides a computer-readable storage medium on which are stored computer instructions for implementing the methods executed by a terminal device or a network device in the above-mentioned method embodiments. An embodiment of the present application also provides a computer program product, comprising instructions, which, when executed by a computer, implement the methods performed by a terminal device or a network device in the above-mentioned method embodiments. An embodiment of the present application also provides a communication system, which includes the terminal device and the network device in the above embodiments. The explanation of the relevant contents and beneficial effects of any of the above-mentioned devices can be referred to the corresponding method embodiments provided above, which will not be repeated here. Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application. Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here. In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or device, etc.) to perform all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories, random access memories, magnetic disks, or optical disks. The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A communication method, It is characterized in that include: Determine first information, where the first information includes information about a count value of first data, and the first data is discarded data; The state variable is updated according to a first count value, where the first count value is a count value of the first data.

2. The method according to claim 1, It is characterized in that The first data is deemed to have been received.

3. The method according to claim 2, It is characterized in that If a first condition is met, the first data is deemed to have been received, The first condition includes that a first state variable is less than or equal to the first count value, and the first state variable is used to indicate the count value of the first data waiting to be submitted.

4. The method according to any one of claims 1 to 3, It is characterized in that The first information includes a count value of at least one data, the at least one data includes the first data, and each data in the at least one data is discarded data.

5. The method according to any one of claims 2 to 4, It is characterized in that The first data is considered to have been received and stored in the cache.

6. The method according to any one of claims 1 to 5, It is characterized in that The first information also includes information of a first quantity, where the first quantity is used to indicate the number of the discarded data.

7. The method according to any one of claims 1 to 6, It is characterized in that The updating of the state variable according to the first count value includes: If the first count value is greater than or equal to a second state variable, update the second state variable to: the sum of the first count value and the first quantity, or update the second state variable to: the sum of the first count value and 1; and / or, If the first count value is equal to the first state variable, submit at least one third data, the third data includes data received and stored in the cache, and the count value corresponding to the third data is greater than or equal to the first state variable, and / or, If the first count value is equal to the first state variable, the first state variable is updated to a fourth count value, and the fourth count value is greater than the first state variable, The first state variable is used to indicate the count value of the first data waiting to be delivered, the second state variable is used to indicate the count value of the next data expected to be received, and the first number is used to indicate the number of discarded data.

8. The method according to any one of claims 1 to 7, It is characterized in that The updating of the state variable according to the first count value further includes: If the reordering timer is running, and the first state variable is greater than or equal to the third state variable, stop the reordering timer; and / or, If the reordering timer is not running, and the first state variable is less than the second state variable, start the reordering timer, The first state variable is used to indicate the count value of the first data waiting to be delivered, the second state variable is used to indicate the count value of the next data expected to be received, and the third state variable is used to indicate the count value of the data that triggers the reordering timer plus 1.

9. The method according to any one of claims 1 to 8, It is characterized in that The method further comprises: Obtain a serial number SN of the first data or the first count value.

10. The method according to claim 9, It is characterized in that In the case of acquiring the sequence number SN of the first data, the method further includes: The first count value is determined according to the sequence number SN of the first data and a first state variable, where the first state variable is used to indicate the count value of the first data waiting to be delivered.

11. The method according to any one of claims 4 to 10, It is characterized in that In the case where the first information includes a count value of the at least one data, the method further includes: Obtain any one or more of the following information of the at least one data: The starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, the first quantity, The first number is the number of discarded data in the at least one data.

12. The method according to claim 11, It is characterized in that The method further comprises: Determine a starting count value of the at least one data according to the starting sequence number SN and the first state variable; and / or, determining a count value of at least one of the at least one data according to the starting count value of the at least one data and the first number, The first state variable is used to indicate the count value of the first data waiting to be delivered.

13. A communication method, It is characterized in that include: Determine first information, wherein the first information includes a count value of at least one data, and each data of the at least one data is discarded data; If the second condition is met, perform one or more of the following: Submitting at least one data whose received count value is greater than or equal to the second count value plus 1; Updating the first state variable to a third count value, where the third count value is greater than the second count value; If the reordering timer is running, and the first state variable is greater than or equal to the third state variable, stop the reordering timer; If the reordering timer is not running, and the first state variable is less than the second state variable, start the reordering timer, Among them, the second condition is: the first state variable is equal to the first count value, the first count value is the count value of the first data, the first data is the data with the smallest count value among the at least one data, the second count value is the count value of the second data, the second data is the data with the largest count value among the at least one data, the first state variable is used to indicate the count value of the first data waiting to be delivered, the second state variable is used to indicate the count value of the next data expected to be received, and the third state variable is used to indicate the count value of the data that triggers the reordering timer plus 1.

14. The method according to claim 13, It is characterized in that In the case where the second state variable is less than the second count value, the method further comprises: The second state variable is updated to: the second count value is increased by 1.

15. The method according to claim 13 or 14, It is characterized in that After determining the first information, the method further includes: If the third condition is met, the first information is ignored; The third condition includes: the first state variable is greater than the second count value.

16. The method according to any one of claims 13 to 15, It is characterized in that The method further comprises: Obtain any one or more of the following information of the at least one data: The starting sequence number SN, the ending sequence number SN, the starting count value, the ending count value, the first quantity, The first number is the number of discarded data in the at least one data.

17. The method according to any one of claims 13 to 16, It is characterized in that In the case of acquiring the sequence number SN of the first data, the method further includes: The first count value is determined according to the sequence number SN of the first data and a first state variable, where the first state variable is used to indicate the count value of the first data waiting to be delivered.

18. The method according to claim 16 or 17, It is characterized in that The method further comprises: Determine a starting count value of the at least one data according to the starting sequence number SN and the first state variable; and / or, Determine a termination count value of the at least one data according to the termination sequence number SN and the first state variable; and / or, determining a terminal count value of the at least one data according to the first count value and the first quantity, The first state variable is used to indicate the count value of the first data waiting to be delivered.

19. A communication device, It is characterized in that The method comprises a module or a unit for executing the method according to any one of claims 1 to 12, or comprises a module or a unit for executing the method according to any one of claims 13 to 18.

20. A communication device, It is characterized in that The device comprises a processor, wherein the processor is configured to cause the communication device to perform the method according to any one of claims 1 to 12, or configured to cause the communication device to perform the method according to any one of claims 13 to 18.

21. A computer-readable storage medium, It is characterized in that The computer-readable storage medium includes instructions, and when the instructions are executed, the computer is caused to execute the method according to any one of claims 1 to 12, or the computer is caused to execute the method according to any one of claims 13 to 18.

22. A computer program product, It is characterized in that The computer program product comprises instructions, and when the instructions are executed, the method according to any one of claims 1 to 12 is implemented, or the method according to any one of claims 13 to 18 is implemented.