[go: up one dir, main page]

WO2021218456A1 - 一种重排序定时器时长的调整方法及装置 - Google Patents

一种重排序定时器时长的调整方法及装置 Download PDF

Info

Publication number
WO2021218456A1
WO2021218456A1 PCT/CN2021/080771 CN2021080771W WO2021218456A1 WO 2021218456 A1 WO2021218456 A1 WO 2021218456A1 CN 2021080771 W CN2021080771 W CN 2021080771W WO 2021218456 A1 WO2021218456 A1 WO 2021218456A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
loss rate
duration
packet loss
reordering
Prior art date
Application number
PCT/CN2021/080771
Other languages
English (en)
French (fr)
Inventor
崔立伟
赵志华
薛静
谢刊
李重锦
季永程
刘佳
Original Assignee
荣耀终端有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 荣耀终端有限公司 filed Critical 荣耀终端有限公司
Publication of WO2021218456A1 publication Critical patent/WO2021218456A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5603—Access techniques
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/22—Traffic shaping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9057—Arrangements for supporting packet reassembly or resequencing

Definitions

  • This application relates to the field of communication technology, and in particular to a method and device for adjusting the duration of a reordering timer.
  • the Packet Data Convergence Protocol can manage the packet data packets received by the device (such as the terminal), and submit the packet data packets to the upper layer in the order of the serial number (SN) carried by it. application.
  • PDCP defines a reordering timer.
  • the device When the device is in the process of submitting packet data packets to the upper application, if it encounters a missing packet data packet to be sent, it starts a reordering timer, suspends sending and waits for the missing packet data packet.
  • the duration of the reordering timer is the duration of waiting for the missing packet.
  • the duration of the reordering timer is usually fixed, but the received amount of the packet data packet per unit time is unstable.
  • the duration of the reordering timer is long, if the received amount is too large, packet data packets will quickly flood and fill up the buffer queue of the device, resulting in packet data packets arriving subsequently being discarded at the PDCP layer.
  • the duration of the reordering timer is short, if the received amount is too small, the missing packet may arrive at the device after the reordering timer expires, and will still be discarded at the PDCP layer after it arrives, resulting in packet loss rate Elevated.
  • the present application provides a method and device for adjusting the duration of a reordering timer, which solves the problem of packet loss at the PDCP layer caused by the instability of the received volume of the packet data packet per unit time in the prior art.
  • this embodiment provides a method for adjusting the duration of a reordering timer.
  • the method includes: detecting a first packet loss rate of a packet data packet; and when the first packet loss rate is greater than a packet loss rate threshold, Adjust the duration of the reordering timer according to the first packet loss rate and the remaining size of the reordering window, or adjust the length of the reordering timer according to the link quality of the receiving link of the packet data packet Duration, wherein the reordering window is used to buffer the received packet data packet.
  • the duration of the reordering timer can be adjusted, so that the duration of the reordering timer is adapted to the received amount of packet data packets per unit time, and the packet data packet time can be reduced. Packet loss at the PDCP layer reduces the packet loss rate and improves communication quality.
  • R 1 is the packet loss rate of the packet data packet whose sequence number is less than the lower boundary sequence number of the reordering window
  • R 2 is the packet loss rate of the packet data packet whose sequence number is greater than the upper boundary sequence number of the reordering window
  • R 1 * is the threshold value of the lower boundary packet loss rate
  • R 2 * is the threshold value of the upper boundary packet loss rate
  • WinN * is the threshold value of the remaining size of the reordering window.
  • the step length by which the duration of the reordering timer is increased or decreased is Wherein, N>1, T 0 is the current duration of the reordering timer.
  • the threshold value of the lower boundary packet loss rate is an average value of the lower boundary packet loss rate in a preset time period.
  • the threshold value of the upper boundary packet loss rate is an average value of the upper boundary packet loss rate in a preset time period.
  • M>0 It is the average value of the remaining size of the reordering window in the preset time period.
  • the method for adjusting the duration of the reordering timer can adjust the reordering timer according to the lower boundary packet loss rate R 1 , the upper boundary packet loss rate R 2 and the remaining size WinN of the reordering window of the packet data packet.
  • the duration is to adapt the duration of the reordering timer to the received amount of packet data packets per unit time, reduce packet loss at the PDCP layer, reduce packet loss rate, and improve communication quality.
  • the adjusting the duration of the reordering timer according to the link quality of the receiving link of the packet data packet includes: detecting the link quality parameter of the receiving link of the packet data packet ; Determine the level corresponding to the link quality parameter; adjust the duration of the reordering timer to a preset duration corresponding to the level.
  • adjusting the duration of the reordering timer to a preset duration corresponding to the level includes: adjusting the duration of the reordering timer It is adjusted to the preset duration corresponding to the combination mode of the multiple corresponding levels of the link quality parameters respectively.
  • the method for adjusting the duration of the reordering timer can adjust the reordering according to the link quality parameters of the packet data packet receiving link, such as reference signal strength, reference signal quality, signal-to-noise ratio, and packet data packet flow.
  • the duration of the timer adapts the duration of the reordering timer to the received amount of packet data packets per unit time, reduces packet loss at the PDCP layer, reduces packet loss rate, and improves communication quality.
  • the method further includes: detecting a second packet loss rate of the packet data packet; when the second packet loss rate is greater than the first For the packet loss rate, call back the duration of the reordering timer K times according to the preset time interval, and detect the third packet loss rate after each callback, K ⁇ 1; according to the first packet loss rate, Adjust the duration of the reordering timer according to the second packet loss rate and the duration corresponding to the smallest packet loss rate among the K detected third packet loss rates.
  • the packet loss rate may increase. Calling back the duration of the reordering timer helps the device to determine the optimal duration of the reordering timer.
  • the method further includes: when the minimum packet loss rate is greater than the packet loss rate threshold, and the link quality parameter of the receiving link is less than a preset range, stopping adjusting the The duration of the reordering timer.
  • this embodiment provides an adjustment of the reordering timer duration, including:
  • the detection module is used to detect the first packet loss rate of the packet data packet
  • the adjustment module is configured to adjust the duration of the reordering timer according to the first packet loss rate and the remaining size of the reordering window when the first packet loss rate is greater than the packet loss rate threshold, or, according to the The link quality of the receiving link of the packet data packet is adjusted, and the duration of the reordering timer is adjusted, wherein the reordering window is used to buffer the received packet data packet.
  • this embodiment provides a device that includes a memory, a processor, and a computer program that is stored in the memory and can run on the processor.
  • the processor executes the computer program, the above-mentioned first The method described in one aspect.
  • this embodiment provides a computer-readable storage medium that stores a computer program, and the computer program implements the method described in the first aspect when the computer program is executed by a processor.
  • this embodiment provides a computer program product.
  • the program product includes a program.
  • the terminal device can realize the first aspect or any possible implementation of the first aspect. The method described in the way.
  • FIG. 1 is a schematic diagram of a connection structure between a terminal and a base station according to an embodiment of the application
  • FIG. 2 is a schematic diagram of grouping data packets in a data sequence provided by an embodiment of the application
  • FIG. 3 is a first schematic diagram of a reordering window provided by an embodiment of the application.
  • FIG. 4 is a second schematic diagram of a reordering window provided by an embodiment of this application.
  • FIG. 5 is a third schematic diagram of a reordering window provided by an embodiment of this application.
  • FIG. 6 is a first flowchart of a method for adjusting the duration of a reordering timer according to an embodiment of the application
  • FIG. 7 is a second schematic flowchart of a method for adjusting the duration of a reordering timer according to an embodiment of the application.
  • FIG. 8 is a third schematic flowchart of a method for adjusting the duration of a reordering timer according to an embodiment of the application.
  • FIG. 9 is a schematic structural diagram of a device for adjusting the duration of a reordering timer according to an embodiment of the application.
  • FIG. 10 is a schematic structural diagram of a device provided by an embodiment of this application.
  • the method for adjusting the duration of the reordering timer provided in the embodiment of this application is applicable to base stations, or terminals such as mobile phones, tablets, wearable devices, in-vehicle devices, notebook computers, and netbooks. There are no restrictions on the type.
  • a terminal and a base station are connected through a wireless network to transmit data to each other.
  • the terminal or base station can split it into multiple packet data packets, and send the packet data packets in order of sequence number (SN) from small to large.
  • SN sequence number
  • each packet data packet carries a uniquely determined SN, and according to the position of the packet data packet in the data sequence, the SN of the packet data packet increases continuously.
  • the data sequence A can be split into 32 packet data packets, each packet data packet is configured with an SN, and the SN is 0-31 in turn.
  • a PDCP layer is set in the terminal and base station, which is used to manage the received packet data packets through the Packet Data Convergence Protocol (PDCP), which includes deduplication, sorting, and deduplication of packet data packets according to the SN of the packet data packet. Submit to the upper application (such as call application, etc.) in order.
  • PDCP Packet Data Convergence Protocol
  • the following will take the terminal as an example to further explain the relevant content of the PDCP management packet data packet.
  • a reordering window is set in the terminal for buffering received packet data packets in the form of a circular queue in the order of SN from small to large.
  • the reordering window can buffer the maximum number of packet data packets, which is represented by the size L of the reordering window.
  • l is the length of the packet data packet SN, such as 5 bits, 12 bits, 18 bits, and so on.
  • the reordering window restricts the packet data packets that it allows to be cached.
  • Reordering window is provided on the lower boundary of the lower and upper boundaries of the sequence number SN sequence number SN.
  • SN is the SN of the packet data packet that can be buffered by the head of the reordering window, and it is also the smallest SN of the packet data packet that can be buffered in the current entire reordering window.
  • the SN is the SN of the packet data packet that can be buffered at the end of the reordering window, and it is also the largest SN of the packet data packet that can be buffered in the current reordering window.
  • SN terminal receives the packet at the packet SN ⁇ between the SN, which was buffered in the reordering position corresponding to the window.
  • a packet data packet under SN ⁇ SN is received, or a packet data packet on SN>SN is received, it is discarded.
  • the reordering window allows the buffering of packet data packets whose SN value is between 5 and 20.
  • the terminal In the process of receiving and buffering the packet data packet in the reordering window, the terminal also starts from the head of the reordering window and sends the packet data packet buffered in the reordering window to the upper application.
  • the packet data packet of the head of the line is sent to the upper application.
  • the reordering window will move backward, that is, the positions of the head and tail of the reordering window will move one bit backward along the buffering direction of the circular queue, followed by SN down and SN up. Increase by 1.
  • the packet data packets received by the terminal may be out of order, resulting in empty queue heads in the reordering window, and even along the cache direction, multiple cache positions adjacent to the queue head may be consecutive Null, which affects the continuity of the packet data packets sent by the terminal to the upper-layer application.
  • PDCP defines a reordering timer with a duration of T.
  • the reordering timer is started to wait for the packet data packet with SN ⁇ n.
  • the duration T of the reordering timer is the duration of waiting for the packet data packet with SN ⁇ n.
  • continuous packet data packets with SN ⁇ n can also be sent to upper-layer applications together with packet data packets with SN ⁇ n.
  • the terminal controls the reordering timer to start, and suspends sending packet data packets to the upper application to wait for the packet data packets with the SN value of 9-12.
  • the reordering timer expires, no matter whether the terminal receives all the packet data packets with SN values between 9 and 12, all packet data packets with SN ⁇ 13 are sent to the upper application.
  • the packet data packet whose SN value is 13-15 can also be sent to the upper application.
  • the duration T of the reordering timer is usually fixed. In other words, when encountering out-of-sequence packet data packets, the waiting time for missing packet data packets is fixed. However, the received amount of the packet data packet per unit time is unstable. When the duration of the reordering timer does not match the received amount, the packet data packet will be lost at the PDCP layer.
  • the terminal waits for missing packet data packets after encountering out-of-sequence packet data packets for only 10 ms.
  • the waiting process affected by the slower network speed, if the received amount of packet data packets per unit time is small, the missing packet data packets may not arrive all, and the terminal stops waiting. After that, when the missing packet arrives, it will be discarded by the terminal at the PDCP layer, resulting in an increase in the packet loss rate.
  • T when T is long (for example, T is 1000 ms), after encountering out-of-sequence packet data packets, the terminal waits for a missing packet data packet for as long as 1000 ms. In the waiting process, affected by the faster network speed, if the received volume of packet data packets per unit time is large, a large number of packet data packets will quickly flood into the reordering window for buffering. When the reordering window is full, a large number of newly arrived packets will be discarded by the terminal at the PDCP layer, resulting in data cutoff and increased packet loss rate.
  • this embodiment provides a method for adjusting the duration of the reordering timer to adjust the duration of the reordering timer, so that the duration of the reordering timer is adapted to the received amount of packet data packets per unit time, and the number of packets is reduced. Data packets are lost at the PDCP layer, reducing the packet loss rate and improving communication quality.
  • FIG. 6 is a schematic flowchart of a method for adjusting the duration of a reordering timer provided by this embodiment.
  • the method includes the following steps S601 to S602.
  • S601 Detect a first packet loss rate of a packet data packet.
  • the process of terminal receiving packet data packet can be detected preset period of time (e.g., 500ms, 1000ms, etc.) the received SN ⁇ under SN, SN and SN values in the SN SN ⁇ > packets on the packet SN And calculate the first packet loss rate of the packet data packet according to the detection result.
  • preset period of time e.g., 500ms, 1000ms, etc.
  • the first packet loss rate ⁇ Under SN, and SN> wherein the number, X is a preset period of time, the SN of the packet received by the terminal on the packet SN. Y is a number in the preset period of time, the terminal receives the packet of SN SN in the data packets between the SN ⁇ , or, Y is a preset period of time, the terminal receives all The number of packet data packets.
  • the packet loss rate involved in this embodiment refers to the loss of the packet data packet at the PDCP layer due to the limitation of the lower boundary sequence number and the upper boundary sequence number of the reordering window after the terminal receives the packet data packet.
  • Package rate refers to the loss of the packet data packet at the PDCP layer due to the limitation of the lower boundary sequence number and the upper boundary sequence number of the reordering window after the terminal receives the packet data packet.
  • S602 When the first packet loss rate is greater than the packet loss rate threshold, adjust the duration of the reordering timer according to the first packet loss rate and the remaining size of the reordering window, or according to the link quality of the receiving link of the packet data packet Adjust the duration of the reordering timer.
  • the specific data is not limited in this embodiment.
  • FIG. 7 is a schematic diagram of the method for adjusting the duration of the reordering timer involved in the present application, which relates to how to adjust the duration of the reordering timer according to the first packet loss rate of the packet data packet and the remaining size of the reordering window.
  • the method includes the following steps S701 to S703.
  • S701 Determine the lower boundary packet loss rate R 1 and the upper boundary packet loss rate R 2 in the first packet loss rate, and the remaining size WinN of the reordering window.
  • packet loss rate may be calculated under the boundary of the boundary R 1 and packet loss rate R 2.
  • the lower boundary packet loss rate Upper boundary packet loss rate R R 1 +R 2 .
  • X 1 is the number of packet data packets under SN ⁇ SN received by the terminal within a preset time period.
  • X 2 is the number of packet data packets on SN>SN received by the terminal in the preset time period.
  • R 1 >R 1 *It means that the terminal discarded too many packets under SN ⁇ SN.
  • R 2 0 indicates that the terminal does not discard the packet data packet on SN>SN.
  • WinN>WinN * Indicates that the remaining amount of the reordering window is large.
  • R 1 * is the threshold value of the lower boundary packet loss rate of the packet data packet
  • WinN * is the threshold value of the remaining size of the window of the reordering window.
  • the reordering window moves backward too fast.
  • the terminal stops waiting and increases the value under SN. Thereafter, even if the packet data waiting for the arrival of packets, also due to its terminal is less than the new SN SN, and discarded at the PDCP layer.
  • the duration T of the reordering timer when the duration T of the reordering timer is set to be short and the receiving amount is small, it will not cause the remaining amount of the reordering window to decrease, and it will not cause packet loss at the upper boundary of the reordering window.
  • the rate rises.
  • R 2 * is the threshold value of the upper boundary packet loss rate of the packet data packet.
  • the terminal may wait for the SN value in the range of 9 to 9 while starting the reordering timer and waiting for the packet data packet with SN ⁇ 13. 12, and the unwaited packet data packets whose SN values are between 16 and 28 have all arrived and are buffered in the reordering window.
  • the reordering window will be full, resulting in the packet data packet with the SN value between 25 and 28 that has no place to be cached and is discarded by the terminal at the PDCP layer.
  • the length of time to reduce the reordering timer helps reduce SN> number of packets on the packet loss in the SN of the PDCP layer, reducing Upper boundary packet loss rate.
  • the step size ⁇ T for each time the terminal increases or decreases the duration of the reordering timer can be a preset fixed step size (for example, 5ms, 10ms, 20ms, etc.), or a dynamic step size obtained through dynamic calculation.
  • the dynamic step size may be the duration of the current reordering timer which is Among them, N is a preset value and N>1, such as 5, 8, or 10, etc., and T 0 is the duration of the current reordering timer. It should be noted that when ⁇ T is a fixed step size, if T 0- ⁇ T ⁇ 0, the duration T of the reordering timer is set to 1 ms.
  • the lower boundary packet loss rate threshold R 1 * of the packet data packet, the upper boundary packet loss rate threshold R 2 *, and the reordering window remaining size threshold WinN * are both It may be a preset fixed value, or it may be a dynamic value determined by the terminal through calculation at a preset time interval.
  • R 1 * is configured as a dynamic value
  • the terminal determines the average value of the lower boundary packet loss rate in the preset time period as the threshold value of the lower boundary packet loss rate.
  • the network speed of the receiving link of the packet data packet is greater than 10 megabits per second (Mbps), every 10 minutes (min)
  • the terminal detects the average packet loss rate of the lower boundary of the packet data packet within 10 minutes
  • the value is 3.6%, then R 1 * is set to 3.6%.
  • R 2 * is configured as a dynamic value
  • the terminal determines the average value of the upper boundary packet loss rate in the preset time period as the upper boundary packet loss rate threshold.
  • the network speed of the receiving link of the packet data packet is greater than 10Mbps, every 10 minutes, the terminal detects that the average value of the upper boundary packet loss rate of the packet data packet within 10 minutes is 1.9%, then set R 2 * Is 1.9%.
  • WinN * When WinN * is configured as a dynamic value, the terminal determines the preset time every interval or in, Means rounding up A, that is, when A is an integer, the original value is kept unchanged; when A is a decimal, the decimal place of A is rounded off and one digit is added. Represents rounding A down, that is, when A is an integer, the original value remains unchanged; when A is a decimal, the decimal places of A are discarded.
  • the terminal detects that the average value of the remaining size of the reordering window within 10 minutes is 999, then or
  • the adjusted packet loss rate can be compared with the packet loss rate before adjustment. If the adjusted packet loss rate decreases, keep the adjusted value of R 1 * , R 2 * or WinN *. If the adjusted packet loss rate increases, adjust the value of R 1 * , R 2 * or WinN * in the opposite direction of the value of R 1 * , R 2 * or WinN * this time. For example, when R 1 * is increased from 2% to 5%, the packet loss rate of the packet data packet is increased from 5% to 8%. At this time, R 1 * is reduced, for example, to 4%, or 3 %Wait.
  • the method for adjusting the duration of the reordering timer can adjust the duration of the reordering timer according to the lower boundary packet loss rate, the upper boundary packet loss rate and the remaining size of the reordering window of the packet data packet, so that the reordering
  • the duration of the timer is adapted to the received amount of packet data packets per unit time, which reduces packet loss at the PDCP layer, reduces the packet loss rate, and improves communication quality.
  • FIG. 8 is a schematic diagram of the method for adjusting the duration of the reordering timer involved in the present application, which relates to how to adjust the duration of the reordering timer according to the link quality of the packet receiving link.
  • the method includes the following steps S801 to S803.
  • S801 Detect a link quality parameter of a receiving link of a packet data packet.
  • the link quality parameter may be reference signal strength (Reference Signal Receiving Power, RSRP), reference signal quality (Reference Signal Receiving Quality, RSRQ), and signal to noise ratio (signal to interference plus noise ratio, SINR), Packet data packet traffic, etc.
  • RSRP Reference Signal Receiving Power
  • RSRQ Reference Signal Receiving Quality
  • SINR signal to noise ratio
  • the packet data packet flow refers to the size of the packet data packet received in a unit time, such as 100 kilobits per second (Kbps), 200 Kbps, and so on.
  • the RSRP level, RSRQ level, SINR level, and flow level can be determined according to the RSRP level list, RSRQ level list, SINR level list, and flow level list.
  • the RSRP level list includes the correspondence between RSRP and RSRP levels. For example, as shown in Table 1, when the RSRP is greater than -80 meter watts (dBm), the RSRP level is "super”. When the RSRP is between -80 and -90dBm, the RSRP level is "strong”. When the RSRP is between -90 and -110dBm, the RSRP level is "medium”. When the RSRP is less than -110dBm, the RSRP level is "weak”.
  • the RSRQ level list includes the correspondence between RSRQ and RSRQ levels. For example, as shown in Table 2, when the RSRQ is between -3 and -10 decibels (dB), the RSRQ level is "good”. When the RSRQ is between -10 and -15dB, the RSRQ level is "medium”. When the RSRQ is between -15 and -19dB, the RSRQ level is "bad”.
  • the SINR level list includes the correspondence between SINR and SINR level. For example, as shown in Table 3, when the SINR is greater than 20dB, the SINR level is "good”. When the SINR is between 1 and 20 dB, the SINR level is "medium”. When the SINR is less than 1dB, the SINR level is "poor”.
  • the packet data packet flow rate list includes the correspondence between the packet data packet flow rate and the flow rate level. For example, as shown in Table 4, when the packet flow rate is below 1Kbps, the flow rate level is "L1". When the packet data packet flow is between 1 ⁇ 100Kbps, the flow level is "L2". When the packet data packet flow is 100Kbps ⁇ 1Mpbs, the flow rate is "L3”. When the packet flow rate is between 1 and 10Mbps, the flow rate is "L4". When the packet data packet traffic is above 10Mbps, the traffic level is "L5".
  • S803 Adjust the duration of the reordering timer to a preset duration corresponding to the level.
  • the duration of the reordering timer can be adjusted according to the list of correspondences between the flow level and the reordering timer duration shown in Table 5, for example. For example, when the traffic level is L2, the duration of the reordering timer is adjusted to 200ms.
  • the duration of the reordering timer is adjusted to a preset duration corresponding to multiple combination modes of the levels.
  • the link quality parameters include RSRP, RSRQ, SINR, and packet data packet flow at the same time
  • it can be adjusted according to the corresponding relationship between the RSRP level, RSRQ level, SINR level, and flow level combination mode and duration as shown in Table 6, for example.
  • the duration of the reordering timer is shown in Table 6, for example.
  • the duration of the corresponding reordering timer is 50 ms. Therefore, the duration of the reordering timer is adjusted to 50ms.
  • reordering timer duration list is not limited to the corresponding relationship between the combination mode of levels and the reordering timer duration provided in this embodiment, and may also be other corresponding relationships. No restrictions.
  • the method for adjusting the duration of the reordering timer can adjust the reordering according to the link quality parameters of the packet data packet receiving link, such as reference signal strength, reference signal quality, signal-to-noise ratio, and packet data packet flow.
  • the duration of the timer adapts the duration of the reordering timer to the received amount of packet data packets per unit time, reduces packet loss at the PDCP layer and reduces the packet loss rate.
  • the second loss of the packet data packet can be detected.
  • Packet rate that is, the packet loss rate after adjusting the reordering timer duration. If the second packet loss rate is greater than the first packet loss rate, call back the duration of the reordering timer K times according to a preset time interval (for example, 10 ms, 20 ms, etc.), and detect the third packet loss rate after each callback. Finally, determine the duration corresponding to the smallest packet loss rate among the first packet loss rate, the second packet loss rate, and the K third packet loss rates detected as the duration of the reordering timer, where K>1 and K is Integer.
  • the terminal detects that the second packet loss rate of the packet data packet is 8%, while the first packet loss rate is 5%, and the packet loss rate deteriorates.
  • the duration of the reordering timer is gradually called back from 200ms to 100ms, and the third packet loss rate after a callback is detected every time a callback is made.
  • the packet loss rate of the packet data packet is shown in Table 7.
  • the terminal readjusts the duration of the reordering timer to 160ms. Calling back the duration of the reordering timer helps the terminal determine the best reordering timer duration.
  • the packet loss rate corresponding to the current duration is still greater than the packet loss rate threshold, and the reference signal strength, reference signal quality, and signal-to-noise ratio changes are less than the preset range, stop adjusting the reordering timer.
  • the duration of the sort timer may be between 0-10%, 0-15%, etc. of the reference signal strength, reference signal quality, signal-to-noise ratio, etc., which is not limited in this embodiment.
  • FIG. 9 shows a structural block diagram of the device for adjusting the duration of the reordering timer provided in an embodiment of the present application, and each module included is used to perform step S601 ⁇ S602, steps S701 to S703, and steps S801 to S803.
  • step S601 ⁇ S602 steps S701 to S703, and steps S801 to S803.
  • the apparatus for adjusting the duration of the reordering timer provided in the embodiment of the present application includes: a detection module 901 and an adjustment module 902.
  • the detection module 901 is configured to detect the first packet loss rate of the packet data packet.
  • the adjustment module 902 is configured to adjust the duration of the reordering timer according to the first packet loss rate and the remaining size of the reordering window when the first packet loss rate is greater than the packet loss rate threshold, or according to the Regarding the link quality of the receiving link of the packet data packet, the duration of the reordering timer is adjusted, wherein the reordering window is used to buffer the received packet data packet.
  • R 1 is the packet loss rate of the packet data packet whose sequence number is less than the lower boundary sequence number of the reordering window
  • R 2 is the packet loss rate of the packet data packet whose sequence number is greater than the upper boundary sequence number of the reordering window
  • R 1 * is the threshold value of the lower boundary packet loss rate
  • R 2 * is the threshold value of the upper boundary packet loss rate
  • WinN * is the threshold value of the remaining size of the reordering window.
  • the duration of the reordering timer is increased or decreased
  • N>1 T 0 is the current duration of the reordering timer.
  • the threshold value of the lower boundary packet loss rate is an average value of the lower boundary packet loss rate in a preset time period.
  • the threshold value of the upper boundary packet loss rate is an average value of the upper boundary packet loss rate in a preset time period.
  • M>0 It is the average value of the remaining size of the reordering window in the preset time period.
  • the detection module 901 is further configured to detect the link quality parameter of the receiving link of the packet data packet.
  • the adjustment module 902 is further configured to determine the level corresponding to the link quality parameter; adjust the duration of the reordering timer to a preset duration corresponding to the level.
  • the adjustment module 902 is further configured to adjust the duration of the reordering timer to correspond to a combination mode of respective levels corresponding to the multiple link quality parameters The preset duration of.
  • the detection module 901 is further configured to detect a second packet loss rate of the packet data packet.
  • the adjustment module 902 is further configured to, when the second packet loss rate is greater than the first packet loss rate, call back the duration of the reordering timer K times at a preset time interval, and detect each callback The third packet loss rate after the following, K ⁇ 1; and, according to the first packet loss rate, the second packet loss rate, and the smallest packet loss rate among the K detected third packet loss rates Corresponding to the duration, adjust the duration of the reordering timer.
  • the adjustment module 902 is further configured to determine the smallest packet loss rate among the K detected third packet loss rates according to the first packet loss rate, the second packet loss rate, and the third packet loss rate. Corresponding to the duration, after adjusting the duration of the reordering timer, when the minimum packet loss rate is greater than the packet loss rate threshold, and the link quality parameter is less than the preset range, stop adjusting the reordering timer duration.
  • the device includes a memory 1001, a processor 1002, and a computer program 1003 that is stored in the memory and can run on the processor.
  • the processor 1002 When the computer program is executed, the method for adjusting the duration of the reordering timer provided in this embodiment is implemented.
  • the memory 1001 may be an internal storage unit of the apparatus/equipment for adjusting the duration of the reordering timer, such as a hard disk or a memory. In other embodiments, the memory 1001 may also be an external storage device of the device/equipment for adjusting the duration of the reordering timer, such as a plug-in hard disk or a smart memory card equipped on the device/equipment for adjusting the duration of the reordering timer. (Smart Media Card, SMC), Secure Digital (SD) card, Flash Card (Flash Card), etc. Further, the memory 1001 may also include not only an internal storage unit of the apparatus/equipment for adjusting the duration of the reordering timer, but also an external storage device.
  • the memory 1001 is used to store an operating system, an application program, a boot loader (Boot Loader), data, and other programs, such as the program code of the computer program.
  • the memory 1001 can also be used to temporarily store data that has been output or will be output.
  • the processor 1002 may be a central processing unit (CPU), and the processor 1002 may also be other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), and application specific integrated circuits (Application Specific Integrated Circuits). , ASIC), ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • This embodiment also provides a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, the steps in each of the foregoing method embodiments can be realized.
  • the computer-readable medium may at least include: any entity or device capable of carrying the computer program code to the photographing device/terminal device, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), and random access memory (RAM, Random Access Memory), electric carrier signal, telecommunications signal and software distribution medium.
  • ROM read-only memory
  • RAM random access memory
  • electric carrier signal telecommunications signal and software distribution medium.
  • U disk mobile hard disk, floppy disk or CD-ROM, etc.
  • computer-readable media cannot be electrical carrier signals and telecommunication signals.
  • the embodiments of the present application also provide a computer program product containing instructions.
  • the computer program product runs on a computer or a processor, the computer or the processor is caused to execute one or more steps in any of the foregoing methods.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted through the computer-readable storage medium.
  • the computer instructions can be sent from a website site, computer, server, or data center to another website site, computer, Server or data center for transmission.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the process in the above-mentioned embodiment method can be realized.
  • the process can be completed by a computer program instructing relevant hardware.
  • the program can be stored in a computer readable storage medium. , May include the processes of the above-mentioned method embodiments.
  • the aforementioned storage media include: ROM or random storage RAM and other media that can store program codes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)

Abstract

本申请适用于通信技术领域，提供了一种重排序定时器时长的调整方法及装置，用于改善由于分组数据包单位时间内的接收量不稳定，导致的分组数据包在PDCP层丢包的问题，有助于降低丢包率、提高通信质量。所述方法包括：检测分组数据包的第一丢包率；当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中所述重排序窗口用于缓存接收到的分组数据包。

Description

一种重排序定时器时长的调整方法及装置
本申请要求于2020年04月30日提交国家知识产权局、申请号为202010361397.2、申请名称为“一种重排序定时器时长的调整方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种重排序定时器时长的调整方法及装置。
背景技术
分组数据汇聚协议(Packet Data Convergence Protocol，PDCP)能够管理设备(例如终端)接收到的分组数据包，将分组数据包按照其携带的序列号(Serial Number，SN)从小到大的顺序提交给上层应用。
由于设备接收到的分组数据包可能是乱序的，为了实现按序提交，PDCP定义了一个重排序定时器。设备在向上层应用提交分组数据包的过程中，如果遇到待发送的分组数据包缺失时，则启动重排序定时器，暂停发送并等待缺失的分组数据包。其中，重排序定时器的时长即为等待缺失分组数据包的时长。
然而，在上述过程中，重排序定时器的时长通常是固定的，但分组数据包单位时间内的接收量是不稳定的。当重排序定时器的时长较长时，如果该接收量过大，分组数据包就会快速涌入并占满设备的缓存队列，导致随后到达的分组数据包在PDCP层被丢弃。当重排序定时器的时长较短时，如果该接收量过小，缺失的分组数据包可能在重排序定时器超时之后才到达设备，其到达后仍然会在PDCP层被丢弃，导致丢包率升高。
发明内容
本申请提供一种重排序定时器时长的调整方法及装置，改善了现有技术中，由于分组数据包单位时间内的接收量不稳定，导致的分组数据包在PDCP层丢包的问题。
为达到上述目的，本申请采用如下技术方案：
第一方面，本实施例提供一种重排序定时器时长的调整方法，所述方法包括：检测分组数据包的第一丢包率；当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中所述重排序窗口用于缓存接收到的所述分组数据包。
通过本实施例提供的重排序定时器时长的调整方法，能够调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率，提高通信质量。
在一些实施例中，所述根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，包括：确定所述第一丢包率中的下边界丢包率R 1和上边界丢包率R 2，以及所述重排序窗口的剩余大小WinN；当R 1＞R 1 *，且R 2＝0或者WinN＞WinN * 时，增加所述重排序定时器的时长；当R 1＝0或者WinN＝0，且R 2＞R 2 *时，减少所述重排序定时器的时长；
其中，R 1为序列号小于所述重排序窗口的下边界序列号的分组数据包的丢包率；R 2为序列号大于所述重排序窗口的上边界序列号的分组数据包的丢包率；R 1 *为所述下边界丢包率的门限值，R 2 *为所述上边界丢包率的门限值，WinN *为所述重排序窗口的剩余大小的门限值。
在本实施例中，当R 1＞R 1 *，且R 2＝0或者WinN＞WinN *时，通过增加重排序定时器的时长，有助于降低下边界丢包率。当R 1＝0或者WinN＝0，且R 2＞R 2 *时，通过减少重排序定时器的时长，有助于降低上边界丢包率。
在一些实施例中，所述重排序定时器的时长增加或者减少的步长为
Figure PCTCN2021080771-appb-000001
其中，N＞1，T 0为所述重排序定时器当前的时长。
在一些实施例中，所述下边界丢包率的门限值为预设时间段内所述下边界丢包率的平均值。
在一些实施例中，所述上边界丢包率的门限值为预设时间段内所述上边界丢包率的平均值。
在一些实施例中，
Figure PCTCN2021080771-appb-000002
或者
Figure PCTCN2021080771-appb-000003
其中，M＞0，
Figure PCTCN2021080771-appb-000004
为预设时间段内所述重排序窗口的剩余大小的平均值。
本实施例提供的重排序定时器时长的调整方法，能够根据分组数据包的下边界丢包率R 1、上边界丢包率R 2以及重排序窗口的剩余大小WinN，调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率，提高通信质量。
在一些实施例中，所述根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，包括：检测所述分组数据包的接收链路的链路质量参数；确定所述链路质量参数对应的等级；将所述重排序定时器的时长调整为与所述等级对应的预设时长。
在一些实施例中，所述链路质量参数为多个，所述将所述重排序定时器的时长调整为与所述等级对应的预设时长，包括：将所述重排序定时器的时长调整为，与多个所述链路质量参数分别对应等级的组合模式对应的预设时长。
本实施例提供的重排序定时器时长的调整方法，能够根据分组数据包接收链路的链路质量参数，例如参考信号强度、参考信号质量、信噪比和分组数据包流量等，调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率，提高通信质量。
在一些实施例中，在调整所述重排序定时器的时长之后，所述方法还包括：检测所述分组数据包的第二丢包率；当所述第二丢包率大于所述第一丢包率时，按照预设的时长间隔回调K次所述重排序定时器的时长，并检测每次回调后的第三丢包率，K≥1；根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长。
在调整所述重排序定时器的时长之后，有可能会导致丢包率增加。通过回调重排序定时器的时长，有助于设备确定最佳的重排序定时器时长。
在一些实施例中，在根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长之后，所述方法还包括：当所述最小的丢包率大于所述丢包率阈值，且所述接收链路的链路质量参数小于预设范围时，停止调整所述重排序定时器的时长。
也就是说，当分组数据包的接收链路的链路质量变化不大，且通过调整重排序定时器时长无法改善丢包率时，停止调整重排序定时器的时长，避免进行无效的调整操作。
第二方面，本实施例提供一种重排序定时器时长的调整，包括：
检测模块，用于检测分组数据包的第一丢包率；
调整模块，用于当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中，所述重排序窗口用于缓存接收到的所述分组数据包。
第三方面，本实施例提供一种设备，包括存储器、处理器以及存储在所述存储器中并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现上述第一方方面所述的方法。
第四方面，本实施例提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机程序，所述计算机程序被处理器执行时实现上述第一方面所述的方法。
第五方面，本实施例提供了一种计算机程序产品，所述程序产品包括程序，当所述程序被设备运行时，使得终端设备实现如上述第一方面或第一方面的任一可能的实现方式所述的方法。
可以理解的是，上述第二方面至第五方面的有益效果可以参见上述第一方面中的相关描述，在此不再赘述。
附图说明
图1为本申请实施例提供的一种终端和基站的连接结构示意图；
图2为本申请实施例提供的一种数据序列中分组数据包的示意图；
图3为本申请实施例提供的一种重排序窗口的示意图一；
图4为本申请实施例提供的一种重排序窗口的示意图二；
图5为本申请实施例提供的一种重排序窗口的示意图三；
图6为本申请实施例提供的一种重排序定时器时长的调整方法的流程示意图一；
图7为本申请实施例提供的一种重排序定时器时长的调整方法的流程示意图二；
图8为本申请实施例提供的一种重排序定时器时长的调整方法的流程示意图三；
图9为本申请实施例提供的一种重排序定时器时长的调整装置的结构示意图；
图10为本申请实施例提供的一种设备的结构示意图。
具体实施方式
本申请实施例提供的重排序定时器时长的调整方法，适用于基站，或者手机、平板电脑、可穿戴设备、车载设备、笔记本电脑、上网本等终端上，本申请实施例对基 站和终端的具体类型不作任何限制。
在移动通信中，参见图1，终端和基站通过无线网络连接，相互传输数据。其中，对于数据量较大，无法一次发送的数据序列，终端或者基站可以将其拆分成多个分组数据包，并将分组数据包按照序列号(SN)由小到大的顺序，依次发送给对端。
需要说明的是，每一个分组数据包均携带一个唯一确定的SN，并且按照分组数据包在数据序列中的位置，其SN依次连续增大。示例性的，如图2所示，数据序列A可以被拆分为32个分组数据包，每一个分组数据包被配置了一个SN，且SN依次为0～31。
终端和基站中设置有一个PDCP层，用于通过分组数据汇聚协议(Packet Data Convergence Protocol，PDCP)管理接收到的分组数据包，其中包括根据分组数据包的SN将分组数据包去重、排序以及按序提交给上层应用(例如通话应用等)。
下面将以终端为例，对PDCP管理分组数据包的相关内容进行进一步说明。
根据PDCP，参见图3，终端中设置有一个重排序窗口，用于以环形队列的形式，按照SN从小到大的顺序缓存接收到的分组数据包。
在本实施例中，重排序窗口可以缓存分组数据包的最大数目，用重排序窗口的大小L表示。在一个示例中，根据PDCP的规定，重排序窗口的大小L＝2 l-1。其中，l为分组数据包SN的长度，例如5比特(bit)、12bit、18bit等。例如，参见图3，当l＝5bit时，重排序窗口的大小L＝2 5-1＝16。当l＝12bit时，重排序窗口的大小L＝2 12-1＝2048。
由于重排序窗口的大小有限，通常不能同时缓存所有的分组数据包。因此，重排序窗口对其允许缓存的分组数据包进行了限制。
重排序窗口设置了下边界序列号SN 下和上边界序列号SN 上。其中，SN 下是重排序窗口队首所能缓存的分组数据包的SN，也是当前整个重排序窗口可以缓存的分组数据包的最小SN。SN 上是重排序窗口队尾所能缓存的分组数据包的SN，也是当前整个重排序窗口可以缓存的分组数据包的最大SN。当分组数据包的序列号在SN 下～SN 上之间时，为合法的分组数据包。终端在接收到SN在SN 下～SN 上之间的分组数据包后，将其缓存至重排序窗口中对应的位置。而当接收到SN＜SN 下的分组数据包时，或者接收到SN＞SN 上的分组数据包时，将其丢弃。
例如图3所示，重排序窗口的大小为16，SN 下＝5，SN 上＝20。也就是说，该重排序窗口允许缓存SN取值在5～20之间的分组数据包。当终端接收到SN取值在5～20之间的分组数据包之后，例如SN＝5、SN＝6、SN＝7、SN＝8或者SN＝13的分组数据包，将其缓存于重排序窗口中对应的位置。当终端接收到SN＜5，或者SN＞20的分组数据包之后，例如SN＝3、SN＝22或者SN＝23的分组数据包，将其丢弃。
此外，对于已缓存的分组数据包，终端如果接收到相同的分组数据包，则将其丢弃，以去除重复的分组数据包。例如，对于如图3所示的重排序窗口，其中已缓存SN＝13的分组数据包。当其再次接收到SN＝13的分组数据包之后，将其丢弃。
终端在接收并将分组数据包缓存于重排序窗口的过程中，也从重排序窗口的队首开始，向上层应用发送重排序窗口中缓存的分组数据包。
对于重排序窗口，如果其队首不为空，则将队首的分组数据包发送给上层应用。 例如，对于图3所示的重排序窗口，将队首的SN＝5的分组数据包发送给上层应用。
当队首的分组数据包发送之后，重排序窗口会向后移动，即重排序窗口队首和队尾的位置分别沿着环形队列的缓存方向向后移动一位，随之SN 下和SN 上分别增加1。例如，对于图3所示的重排序窗口，当队首的SN＝5的分组数据包发送给上层应用之后，队首的位置移动至SN＝6的缓存位置，队尾的位置移动至SN＝21的缓存位置。此时，参见图4所示，重排序窗口的SN 下＝6、SN 上＝21，其允许缓存的分组数据包的SN的范围变更为6～21之间。
然而，受网络不稳定的影响，终端接收到的分组数据包可能是乱序的，导致重排序窗口的队首为空，甚至沿着缓存方向，与队首临近的多个缓存位置也连续为空，影响终端发送给上层应用的分组数据包的连续性。例如，在图5所示的重排序窗口中，队首用于缓存SN＝9的分组数据包的位置，以及缓存SN＝10、SN＝11、SN＝12的分组数据包的位置均为空，直至SN＝13的位置才开始缓存有分组数据包。
为此，PDCP定义了重排序定时器，时长为T。在终端向上层应用发送分组数据包的过程中，当待发送的分组数据包缺失，且当前缓存的分组数据包的最小SN为n时，认为终端遇到了SN＝n的乱序分组数据包。此时，重排序定时器启动，以等待SN＜n的分组数据包。当重排序定时器超时之后，无论等待的SN＜n的分组数据包是否全部到达，均将接收到的SN＜n的分组数据包全部发送给上层应用。其中，重排序定时器的时长T即为等待SN＜n的分组数据包的时长。此外，对于SN≥n的连续的分组数据包，也可以和SN＜n的分组数据包一起发送给上层应用。
例如图5，当终端从重排序窗口向上层应用发送分组数据包的过程中，待发送的SN取值在9～12的分组数据包还没有到达终端，但SN＝13的分组数据包却已到达。也就是说，终端遇到了SN＝13的乱序分组数据包。此时，终端控制重排序定时器启动，暂停向上层应用发送分组数据包，以等待SN取值在9～12的分组数据包。当重排序定时器超时之后，无论终端是否全部接收到SN取值在9～12的分组数据包，均将SN＜13的分组数据包全部发送给上层应用。此外，也可以将SN取值在13～15的分组数据包发送给上层应用。
然而，在上述过程中，重排序定时器的时长T通常是固定的。也就是说，在遇到乱序的分组数据包时，等待缺失分组数据包的时间是固定的。但是，分组数据包单位时间内的接收量是不稳定的，当重排序定时器的时长与所述接收量不适配时，就会导致分组数据包在PDCP层丢包。
在一个示例中，当T较短(例如，T为10毫秒(ms))时，终端在遇到乱序的分组数据包后，等待缺失的分组数据包的时间仅为10ms。在等待的过程中，受网速较慢的影响，如果分组数据包单位时间内的接收量较小，则缺失的分组数据包可能还没有全部到达，终端就停止等待。此后，当缺失的分组数据包到达之后，将会被终端在PDCP层丢弃，导致丢包率增加。
在另一示例中，当T较长(例如，T为1000ms)时，终端在遇到乱序的分组数据包后，等待缺失的分组数据包的时间长达1000ms。在等待的过程中，受网速较快的影响，如果分组数据包单位时间内的接收量较大，就会有大量的分组数据包快速涌入重排序窗口进行缓存。当重排序窗口满了之后，新到达的大量的分组数据包将会被终端 在PDCP层全部丢弃，导致数据断流，丢包率增加。
为此，本实施例提供一种重排序定时器时长的调整方法，以调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率，提高通信质量。
下面将以终端为例，对本实施例提供一种重排序定时器时长的调整方法进行说明。
参见图6，图6为本实施例提供的一种重排序定时器时长的调整方法的流程示意图。该方法包括如下步骤S601～S602。
S601，检测分组数据包的第一丢包率。
终端在接收分组数据包的过程中，能够检测预设时间段内(例如500ms、1000ms等)接收到的SN＜SN 下、SN取值在SN 下～SN 上以及SN＞SN 上的分组数据包的个数，并根据检测结果计算分组数据包的第一丢包率。
在本实施例中，第一丢包率
Figure PCTCN2021080771-appb-000005
其中，X为在预设时间段内，终端接收到的SN＜SN 下，以及SN＞SN 上的分组数据包的个数。Y为在所述预设时间段内，终端接收到的SN在SN 下～SN 上之间的分组数据包的个数，或者，Y为在所述预设时间段内，终端接收到的所有分组数据包的个数。
需要说明的是，本实施例中涉及的丢包率是指终端在接收到分组数据包之后，由于重排序窗口的下边界序列号和上边界序列号的限制，分组数据包在PDCP层的丢包率。
S602，当第一丢包率大于丢包率阈值时，根据第一丢包率和重排序窗口的剩余大小调整重排序定时器的时长，或者，根据分组数据包的接收链路的链路质量调整重排序定时器的时长。
其中，丢包率阈值是预先的配置的，例如R＝0、R＝1％、R＝2％、R＝5％等，本实施例对其具体数据不进行限制。
下面分别对根据第一丢包率和重排序窗口的剩余大小调整重排序定时器的时长，以及根据分组数据包的接收链路的链路质量调整重排序定时器时长的过程进行说明。
参见图7，图7是本申请涉及的重排序定时器时长的调整方法示意图，涉及如何根据分组数据包的第一丢包率和重排序窗口的剩余大小调整重排序定时器的时长。该方法包括如下步骤S701～S703。
S701，确定第一丢包率中的下边界丢包率R 1和上边界丢包率R 2，以及重排序窗口的剩余大小WinN。
根据终端检测到的SN＜SN 下、SN取值在SN 下～SN 上以及SN＞SN 上的分组数据包的个数，可以计算下边界丢包率R 1和上边界丢包率R 2。
在本实施例中，下边界丢包率
Figure PCTCN2021080771-appb-000006
上边界丢包率
Figure PCTCN2021080771-appb-000007
R＝R 1+R 2。其中，X 1为在预设时间段内，终端接收到的SN＜SN 下的分组数据包的个数。X 2为在所述预设时间段内，终端接收到的SN＞SN 上的分组数据包的个数。
S702，当R 1＞R 1 *，且R 2＝0或者WinN＞WinN *时，增加重排序定时器的时长。
R 1＞R 1 *说明终端丢弃的SN＜SN 下的分组数据包过多。R 2＝0说明终端没有丢弃SN＞SN 上的分组数据包。WinN＞WinN *说明重排序窗口的剩余量较多。其中，R 1 *为 分组数据包的下边界丢包率的门限值，WinN *为重排序窗口的窗口剩余大小的门限值。
可以理解的是，当重排序定时器的时长T设置的较短时，重排序窗口向后移动过快。此时，如果分组数据包单位时间内的接收量较少，那么等待的分组数据包还没有到达，终端便停止等待并增加了SN 下的值。此后，即使等待的分组数据包到来，终端也会由于其SN小于新的SN 下，而将其在PDCP层丢弃。
例如，参见图5所示的重排序窗口，其中SN 下＝9，SN 上＝24。当重排序定时器的时长T设置的较短且分组数据包单位时间内的接收量较小时，终端在启动重排序定时器，等待SN＜13的分组数据包的过程中，可能等待的SN＝10分组数据包已到达，而等待的SN＝9以及SN＝12的分组数据包还未到达，终端就停止了等待。随后，终端会将SN＝10的分组数据包发送给上层应用，并将SN 下调整为13。此后，即使SN＝9以及SN＝12的分组数据包到达，终端也会由于其SN小于13而将其在PDCP层丢弃。
然而，在上述过程中，重排序定时器的时长T设置的较短且所述接收量较小时，并不会导致重排序窗口的剩余量减少，也不会引起重排序窗口的上边界丢包率升高。
因此，当R 1＞R 1 *，且R 2＝0或者WinN＞WinN *时，增加重排序定时器的时长，有助于减少SN＜SN 下的分组数据包在PDCP层的丢包数量，降低下边界丢包率。
S703，当R 1＝0或者WinN＝0，且R 2＞R 2 *时，减少重排序定时器的时长。
R 1＝0说明终端没有丢弃SN＜SN 下的分组数据包，WinN＝0说明重排序窗口已满。其中，R 2 *为分组数据包的上边界丢包率的门限值。
可以理解的是，当重排序定时器的时长T设置的较长时，重排序窗口向后移动过慢。此时，如果分组数据包单位时间内的接收量较大，就会有大量的分组数据包将重排序窗口存满(即WinN＝0)，终端新接收到的分组数据包，会由于没有空间缓存而被丢弃。
例如，参见图5所示的重排序窗口，其中SN 下＝9，SN 上＝24。如果重排序定时器的时长T设置的较长且所述接收量较大时，终端在启动重排序定时器，等待SN＜13的分组数据包的过程中，可能等待的SN取值在9～12，以及未等待的SN取值在16～28的分组数据包均已全部到达并缓存于重排序窗口中。此时，由于SN取值在9～12及SN取值在16～24会将重排序窗口存满，导致SN取值在25～28的分组数据包无处缓存而被终端在PDCP层丢弃。
然而，在上述过程中，重排序定时器的时长T设置的较长且所述接收量较大时，并不会引起重排序窗口下边界丢包率升高。
因此，当R 1＝0或者WinN＝0，且R 2＞R 2 *时，减少重排序定时器的时长，有助于减少SN＞SN 上的分组数据包在PDCP层的丢包数量，降低上边界丢包率。
在本实施例中，终端每一次增加或者减少重排序定时器时长的步长ΔT可以是预设的固定步长(例如5ms、10ms、20ms等)，也可以是通过动态计算获得的动态步长。示例性的，该动态步长可以为当前重排序定时器时长的
Figure PCTCN2021080771-appb-000008
即
Figure PCTCN2021080771-appb-000009
其中，N为预设数值且N＞1，例如5、8或者10等，T 0为当前重排序定时器的时长。需要说明的是，当ΔT为固定步长时，如果T 0-ΔT＜0，则将重排序定时器的时长T设置为1ms。
此外，在本实施例中，分组数据包的下边界丢包率的门限值R 1 *、上边界丢包率的 门限值R 2 *以及重排序窗口剩余大小门限值WinN *，既可以是预设的固定数值，也可以是每间隔预设时间，终端通过计算确定的动态数值。
当R 1 *被配置为固定数值时，示例性的，R 1 *＝2％、R 1 *＝3％或者R 1 *＝5％等。当R 1 *被配置为动态数值时，每间隔预设的时间，终端将所述预设时间段内下边界丢包率的平均值，确定为下边界丢包率的门限值。示例性的，当分组数据包的接收链路的网速大于10兆比特/秒(Mbps)时，每间隔10分钟(min)，终端检测到10min内分组数据包的下边界丢包率的平均值为3.6％，那么将R 1 *设置为3.6％。
当R 2 *被配置为固定数值时，示例性的，R 2 *＝1％、R 1 *＝2％或者R 1 *＝4％等。当R 2 *被配置为动态数值时，每间隔预设的时间，终端将所述预设时间段内上边界丢包率的平均值，确定为上边界丢包率的门限值。示例性的，当分组数据包的接收链路的网速大于10Mbps时，每间隔10min，终端检测到10min内分组数据包的上边界丢包率的平均值为1.9％，那么将R 2 *设置为1.9％。
当WinN *被配置为固定数值时，示例性的，当重排序窗口的大小为2048时，WinN *＝800、WinN *＝1000或者WinN *＝1200等。当WinN *被配置为动态数值时，每间隔预设时间，终端确定
Figure PCTCN2021080771-appb-000010
或者
Figure PCTCN2021080771-appb-000011
其中，
Figure PCTCN2021080771-appb-000012
表示对A向上取整，即当A是整数时，保持原数值不变；当A是小数时，将A的小数位舍去并给个位数加1。
Figure PCTCN2021080771-appb-000013
表示对A向下取整，即当A是整数时，保持原数值不变；当A是小数时，舍弃A的小数位。例如，当A＝5时，
Figure PCTCN2021080771-appb-000014
当A＝3.5时，
Figure PCTCN2021080771-appb-000015
M为预设数值且M＞0，例如1、2、3等，
Figure PCTCN2021080771-appb-000016
为当分组数据包的接收链路的网速大于网速阈值时，预设时间段内重排序窗口剩余大小的平均值。
示例性的，当分组数据包的接收链路的网速大于10Mbps时，每间隔10min，终端检测到10min内重排序窗口剩余大小的平均值为999，那么
Figure PCTCN2021080771-appb-000017
或者
Figure PCTCN2021080771-appb-000018
此外，作为一种可选的方式，在每一次调整R 1 *、R 2 *或者WinN *之后，可以将调整后的丢包率与调整之前的丢包率进行比较。如果调整后的丢包率降低，则保持R 1 *、R 2 *或者WinN *调整后的数值。如果调整后的丢包率升高，则沿着本次调整R 1 *、R 2 *或者WinN *数值的反方向，调整R 1 *、R 2 *或者WinN *的数值。例如，当R 1 *由2％增大为5％之后，分组数据包的丢包率由5％增加到8％，此时，将R 1 *减小，例如减小为4％，或者3％等。
本实施例提供的重排序定时器时长的调整方法，能够根据分组数据包的下边界丢包率、上边界丢包率以及重排序窗口的剩余大小，调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率，提高通信质量。
参见图8，图8是本申请涉及的重排序定时器时长的调整方法示意图，涉及如何根据分组数据包接收链路的链路质量调整重排序定时器时长。该方法包括如下步骤S801～S803。
S801，检测分组数据包的接收链路的链路质量参数。
示例性的，所述链路质量参数可以为参考信号强度(Reference Signal Receiving Power，RSRP)、参考信号质量(Reference Signal Receiving Quality，RSRQ)和信噪比(signal to interference plus noise ratio，SINR)、分组数据包流量等。
其中，分组数据包流量是指单位时间内接收的分组数据包的大小，例如100千比特/秒(Kbps)、200Kbps等。
S802，确定链路质量参数对应的等级。
示例性的，可以根据RSRP等级列表、RSRQ等级列表、SINR等级列表和流量等级列表，确定RSRP等级、RSRQ等级、SINR等级和流量等级。
其中，RSRP等级列表包括了RSRP和RSRP等级之间的对应关系。例如表1所示，当RSRP大于-80米瓦特(dBm)时，RSRP等级为“超强”。当RSRP在-80～-90dBm之间时，RSRP等级为“强”。当RSRP在-90～-110dBm之间时，RSRP等级为“中”。当RSRP小于-110dBm时，RSRP等级为“弱”。
RSRQ等级列表包括了RSRQ和RSRQ等级之间的对应关系。例如表2所示，当RSRQ在-3～-10分贝(dB)之间时，RSRQ等级为“好”。当RSRQ在-10～-15dB之间时，RSRQ等级为“中”。当RSRQ在-15～-19dB之间时，RSRQ等级为“差”。
SINR等级列表包括了SINR和SINR等级之间的对应关系。例如表3所示，当SINR大于20dB时，SINR等级为“好”。当SINR在1～20dB之间时，SINR等级为“中”。当SINR小于1dB时，SINR等级为“差”。
分组数据包流量等级列表包括了分组数据包流量和流量等级的对应关系。例如表4所示，当分组数据包流量在1Kbps以下时，流量等级为“L1”。当分组数据包流量在1～100Kbps之间时，流量等级为“L2”。当分组数据包流量在100Kbps～1Mpbs时，流量等级为“L3”。当分组数据包流量在1～10Mbps之间时，流量等级为“L4”。当分组数据包流量在10Mbps以上时，流量等级为“L5”。
表1 RSRP等级列表
Figure PCTCN2021080771-appb-000019
表2 RSRQ等级列表
Figure PCTCN2021080771-appb-000020
表3 SINR等级列表
Figure PCTCN2021080771-appb-000021
表4流量等级列表
Figure PCTCN2021080771-appb-000022
S803，将重排序定时器的时长调整为与所述等级对应的预设时长。
在一个示例中，当链路质量参数为一个时，例如为分组数据包流量，可以根据例如表5所示的流量等级与重排序定时器时长的对应关系列表，调整重排序定时器的时长。例如，当流量等级为L2时，将重排序定时器的时长调整为200ms。
表5重排序定时器时长列表一
Figure PCTCN2021080771-appb-000023
在另一示例中，当链路质量参数为多个时，将所述重排序定时器的时长调整为，与多个所述等级的组合模式对应的预设时长。
例如，当链路质量参数同时包括RSRP、RSRQ、SINR和分组数据包流量时，可以根据例如表6所示的RSRP等级、RSRQ等级、SINR等级和流量等级的组合模式与时长的对应关系，调整重排序定时器的时长。
根据表6，当RSRP等级为“强”、RSRQ等级为“中”、SINR等级为“中”、流量等级为“L4”时，对应的重排序定时器的时长为50ms。因此，将重排序定时器的时长调整为50ms。
表6重排序定时器时长列表二
Figure PCTCN2021080771-appb-000024
需要说明的是，重排序定时器时长列表并不局限于上述本实施例提供的等级的组合模式与重排序定时器时长之间的对应关系，也可以为其他的对应关系，本实施例对此不进行限制。
本实施例提供的重排序定时器时长的调整方法，能够根据分组数据包接收链路的链路质量参数，例如参考信号强度、参考信号质量、信噪比和分组数据包流量等，调整重排序定时器的时长，使重排序定时器的时长与分组数据包单位时间内的接收量相适配，减少分组数据包在PDCP层丢包，降低丢包率。
此外，基于上述本实施例中S701～S703或者S801～S803提供的重排序定时器时长的调整方法，可选的，在调整重排序定时器的时长之后，还可以检测分组数据包的第二丢包率(即重排序定时器时长调整后的丢包率)。如果第二丢包率大于第一丢包率，则按照预设的时长间隔(例如10ms、20ms等)回调K次重排序定时器的时长，并检测每一次回调后的第三丢包率。最后，将第一丢包率、第二丢包率和检测到的K个第三丢包率中最小的丢包率所对应时长，确定为重排序定时器的时长，K＞1且K为整数。
例如，终端在将重排序定时器的时长由100ms调整至200ms之后，检测到分组数据包的第二丢包率为8％，而第一丢包率为5％，丢包率恶化。此时，按照20ms的步长，将重排序定时器的时长由200ms逐渐向100ms回调，每回调一次，检测一次回调后的第三丢包率。在回调重排序定时器时长的过程中，分组数据包的丢包率如表7所示，当重排序定时器的时长为160ms时，分组数据包的丢包率最小，为1％。因此，终端将重排序定时器的时长重新调整为160ms。通过回调重排序定时器的时长，有助于终端确定最佳的重排序定时器时长。
在重新调整重排序定时器的时长之后，如果当前时长对应的丢包率仍然大于丢包率阈值，且参考信号强度、参考信号质量、信噪比的变化小于预设范围时，则停止调整重排序定时器的时长。示例性的，该预设的范围可以为参考信号强度、参考信号质量、信噪比的0～10％、0～15％之间等，本实施例不进行限制。
表7丢包率统计表
Figure PCTCN2021080771-appb-000025
也就是说，当分组数据包的接收链路的链路质量变化不大，且通过调整重排序定时器时长无法改善丢包率时，停止调整重排序定时器的时长，避免进行无效的调整操作。
应理解，上述实施例中各步骤的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
对应于上文实施例所述的重排序定时器时长的调整方法，图9示出了本申请实施例提供的重排序定时器时长的调整装置的结构框图，包括的各模块用于执行步骤S601～S602、步骤S701～S703以及步骤S801～S803。为了便于说明，仅示出了与本申请实施例相关的部分。
参见图9，本申请实施例提供的重排序定时器时长的调整装置包括：检测模块901和调整模块902。
检测模块901，用于检测分组数据包的第一丢包率。
调整模块902，用于当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中，所述重排序窗口用于缓存接收到的所述分组数据包。
所述调整模块902，还用于确定所述第一丢包率中的下边界丢包率R 1和上边界丢包率R 2，以及所述重排序窗口的剩余大小WinN；当R 1＞R 1 *，且R 2＝0或者WinN＞WinN *时，增加所述重排序定时器的时长；当R 1＝0或者WinN＝0，且R 2＞R 2 *时，减少所述重排序定时器的时长。
其中，R 1为序列号小于所述重排序窗口的下边界序列号的分组数据包的丢包率；R 2为序列号大于所述重排序窗口的上边界序列号的分组数据包的丢包率；R 1 *为所述下边界丢包率的门限值，R 2 *为所述上边界丢包率的门限值，WinN *为所述重排序窗口的剩余大小的门限值。
可选的，所述重排序定时器的时长增加或者减少的
Figure PCTCN2021080771-appb-000026
其中，N＞1，T 0为所述重排序定时器当前的时长。
可选的，所述下边界丢包率的门限值为预设时间段内所述下边界丢包率的平均值。
可选的，所述上边界丢包率的门限值为预设时间段内所述上边界丢包率的平均值。
可选的，
Figure PCTCN2021080771-appb-000027
或者
Figure PCTCN2021080771-appb-000028
其中，M＞0，
Figure PCTCN2021080771-appb-000029
为预设时间段内所述重排序窗口的剩余大小的平均值。
可选的，所述检测模块901，还用于检测所述分组数据包的接收链路的链路质量参数。所述调整模块902，还用于确定所述链路质量参数对应的等级；将所述重排序定时器的时长调整为与所述等级对应的预设时长。
可选的，所述链路质量参数为多个时，所述调整模块902，还用于将所述重排序定时器的时长调整为，与多个链路质量参数分别对应等级的组合模式对应的预设时长。
可选的，所述检测模块901，还用于检测所述分组数据包的第二丢包率。所述调整模块902，还用于当所述第二丢包率大于所述第一丢包率时，按照预设的时长间隔回调K次所述重排序定时器的时长，并检测每次回调后的第三丢包率，K≥1；以及，根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长。
可选的，所述调整模块902，还用于在根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长之后，当所述最小的丢包率大于所述丢包率阈值，且链路质量参数小于预设范围时，停止调整所述重排序定时器的时长。
需要说明的是，上述模块之间的信息交互、执行过程等内容，由于与本申请方法实施例基于同一构思，其具体功能及带来的技术效果，具体可参见方法实施例部分，此处不再赘述。
本实施例还提供了一种设备，参见图10，所述设备包括存储器1001、处理器1002以及存储在所述存储器中并可在所述处理器上运行的计算机程序1003，所述处理器1002执行所述计算机程序时实现上述本实施例提供的重排序定时器时长的调整方法。
所述存储器1001在一些实施例中可以是所述重排序定时器时长的调整装置/设备的内部存储单元，例如硬盘或内存。所述存储器1001在另一些实施例中也可以是重排序定时器时长的调整装置/设备的外部存储设备，例如重排序定时器时长的调整装置/设备上配备的插接式硬盘，智能存储卡(Smart Media Card,SMC)，安全数字(Secure Digital,SD)卡，闪存卡(Flash Card)等。进一步地，所述存储器1001还可以既包括重排序定时器时长的调整装置/设备的内部存储单元，也包括外部存储设备。所述存储器1001用于存储操作系统、应用程序、引导装载程序(Boot Loader)、数据以及其他程序等，例如所述计算机程序的程序代码等。所述存储器1001还可以用于暂时地存储已经输出或者将要输出的数据。
所述处理器1002可以是中央处理单元(Central Processing Unit，CPU)，该处理器1002还可以是其他通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field-Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
本实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质存储有计 算机程序，所述计算机程序被处理器执行时实现可实现上述各个方法实施例中的步骤。
所述计算机可读介质至少可以包括：能够将计算机程序代码携带到拍照装置/终端设备的任何实体或装置、记录介质、计算机存储器、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、电载波信号、电信信号以及软件分发介质。例如U盘、移动硬盘、磁碟或者光盘等。在某些司法管辖区，根据立法和专利实践，计算机可读介质不可以是电载波信号和电信信号。
本申请实施例还提供了一种包含指令的计算机程序产品。当该计算机程序产品在计算机或处理器上运行时，使得计算机或处理器执行上述任一个方法中的一个或多个步骤。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述或记载的部分，可以参见其它实施例的相关描述。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者通过所述计算机可读存储介质进行传输。所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线)或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，该流程可以由计算机程序来指令相关的硬件完成，该程序可存储于计算机可读取存储介质中，该程序在执行时，可包括如上述各方法实施例的流程。而前述的存储介质包括：ROM或随机存储记忆体RAM等各种可存储程序代码的介质。
最后应说明的是：以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何在本申请揭露的技术范围内的变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (13)

  1. 一种重排序定时器时长的调整方法，其特征在于，所述方法包括：
    检测分组数据包的第一丢包率；
    当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中所述重排序窗口用于缓存接收到的所述分组数据包。
  2. 根据权利要求1所述的方法，其特征在于，所述根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，包括：
    确定所述第一丢包率中的下边界丢包率R 1和上边界丢包率R 2，以及所述重排序窗口的剩余大小WinN；
    当R 1＞R 1 *，且R 2＝0或者WinN＞WinN *时，增加所述重排序定时器的时长；
    当R 1＝0或者WinN＝0，且R 2＞R 2 *时，减少所述重排序定时器的时长；
    其中，R 1为序列号小于所述重排序窗口的下边界序列号的分组数据包的丢包率；R 2为序列号大于所述重排序窗口的上边界序列号的分组数据包的丢包率；R 1 *为所述下边界丢包率的门限值，R 2 *为所述上边界丢包率的门限值，WinN *为所述重排序窗口的剩余大小的门限值。
  3. 根据权利要求2所述的方法，其特征在于，所述重排序定时器的时长增加或者减少的步长为
    Figure PCTCN2021080771-appb-100001
    其中，N＞1，T 0为所述重排序定时器当前的时长。
  4. 根据权利要求2或3所述的方法，其特征在于，所述下边界丢包率的门限值为预设时间段内所述下边界丢包率的平均值。
  5. 根据权利要求2-4任一项所述的方法，其特征在于，所述上边界丢包率的门限值为预设时间段内所述上边界丢包率的平均值。
  6. 根据权利要求2-5任一项所述的方法，其特征在于，
    Figure PCTCN2021080771-appb-100002
    或者
    Figure PCTCN2021080771-appb-100003
    其中，M＞0，
    Figure PCTCN2021080771-appb-100004
    为预设时间段内所述重排序窗口的剩余大小的平均值。
  7. 根据权利要求1所述的方法，其特征在于，所述根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，包括：
    检测所述分组数据包的接收链路的链路质量参数；
    确定所述链路质量参数对应的等级；
    将所述重排序定时器的时长调整为与所述等级对应的预设时长。
  8. 根据权利要求1所述的方法，其特征在于，所述链路质量参数为多个，所述将所述重排序定时器的时长调整为与所述等级对应的预设时长，包括：
    将所述重排序定时器的时长调整为，与多个所述链路质量参数分别对应等级的组合模式对应的预设时长。
  9. 根据权利要求1-8任一项所述的方法，其特征在于，在调整所述重排序定时器的时长之后，所述方法还包括：
    检测所述分组数据包的第二丢包率；
    当所述第二丢包率大于所述第一丢包率时，按照预设的时长间隔回调K次所述重排序定时器的时长，并检测每次回调后的第三丢包率，K≥1；
    根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长。
  10. 根据权利要求9所述的方法，其特征在于，在根据所述第一丢包率、所述第二丢包率和检测到的K个所述第三丢包率中最小的丢包率所对应时长，调整所述重排序定时器的时长之后，所述方法还包括：
    当所述最小的丢包率大于所述丢包率阈值，且所述接收链路的链路质量参数小于预设范围时，停止调整所述重排序定时器的时长。
  11. 一种重排序定时器时长的调整装置，其特征在于，包括
    检测模块，用于检测分组数据包的第一丢包率；
    调整模块，用于当所述第一丢包率大于丢包率阈值时，根据所述第一丢包率和重排序窗口的剩余大小调整所述重排序定时器的时长，或者，根据所述分组数据包的接收链路的链路质量，调整所述重排序定时器的时长，其中，所述重排序窗口用于缓存接收到的所述分组数据包。
  12. 一种设备，包括存储器、处理器以及存储在所述存储器中并可在所述处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现如权利要求1至10任一项所述的方法。
  13. 一种计算机可读存储介质，所述计算机可读存储介质存储有计算机程序，其特征在于，所述计算机程序被处理器执行时实现如权利要求1至10任一项所述的方法。
PCT/CN2021/080771 2020-04-30 2021-03-15 一种重排序定时器时长的调整方法及装置 WO2021218456A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010361397.2A CN113595929B (zh) 2020-04-30 2020-04-30 一种重排序定时器时长的调整方法及装置
CN202010361397.2 2020-04-30

Publications (1)

Publication Number Publication Date
WO2021218456A1 true WO2021218456A1 (zh) 2021-11-04

Family

ID=78236972

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/080771 WO2021218456A1 (zh) 2020-04-30 2021-03-15 一种重排序定时器时长的调整方法及装置

Country Status (2)

Country Link
CN (1) CN113595929B (zh)
WO (1) WO2021218456A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285806A (zh) * 2021-12-24 2022-04-05 上海交通大学 一种收发数据的方法及其装置
WO2023147772A1 (zh) * 2022-02-03 2023-08-10 百果园技术(新加坡)有限公司 数据重传方法、装置、设备及存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114398166B (zh) * 2022-01-27 2024-05-28 重庆大学 基于二分法的分布式计算任务调度方法及设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101547070A (zh) * 2008-03-24 2009-09-30 华为技术有限公司 一种数据包类型的判断方法及其装置
CN101662347A (zh) * 2009-09-27 2010-03-03 华为技术有限公司 数据包处理方法、装置和系统
US20130136000A1 (en) * 2011-11-29 2013-05-30 Hughes Networks Systems, Llc Method and system for controlling tcp traffic with random early detection and window size adjustments
CN109690992A (zh) * 2016-05-26 2019-04-26 高通股份有限公司 在关于dsds电话调离之后改进一个订阅数据吞吐量的方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101677266B (zh) * 2008-09-19 2012-12-26 电信科学技术研究院 控制重排序和重复消除操作的方法、系统及装置
CN104683262B (zh) * 2015-01-30 2018-02-02 大唐移动通信设备有限公司 一种数据包的处理方法和设备
US20170295516A1 (en) * 2016-04-08 2017-10-12 Qualcomm Incorporated Dynamic medium access control reception-reorder timeout in a crowded wireless local area network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101547070A (zh) * 2008-03-24 2009-09-30 华为技术有限公司 一种数据包类型的判断方法及其装置
CN101662347A (zh) * 2009-09-27 2010-03-03 华为技术有限公司 数据包处理方法、装置和系统
US20130136000A1 (en) * 2011-11-29 2013-05-30 Hughes Networks Systems, Llc Method and system for controlling tcp traffic with random early detection and window size adjustments
CN109690992A (zh) * 2016-05-26 2019-04-26 高通股份有限公司 在关于dsds电话调离之后改进一个订阅数据吞吐量的方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZTE: "Discussion on PDCP re-ordering modelling", 3GPP DRAFT; R2-142003 DISCUSSION ON PDCP REORDERING MODELLING, vol. RAN WG2, 10 May 2014 (2014-05-10), Seoul, Korea, pages 1 - 7, XP050818692 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285806A (zh) * 2021-12-24 2022-04-05 上海交通大学 一种收发数据的方法及其装置
WO2023147772A1 (zh) * 2022-02-03 2023-08-10 百果园技术(新加坡)有限公司 数据重传方法、装置、设备及存储介质

Also Published As

Publication number Publication date
CN113595929A (zh) 2021-11-02
CN113595929B (zh) 2022-07-26

Similar Documents

Publication Publication Date Title
WO2021218456A1 (zh) 一种重排序定时器时长的调整方法及装置
US9596281B2 (en) Transport accelerator implementing request manager and connection manager functionality
CN109818874B (zh) 数据传输方法、设备及计算机存储介质
CN110351201B (zh) 一种数据处理方法及装置
US11553067B2 (en) Method and device for transmitting data
US9930097B2 (en) Transport accelerator systems and methods
WO2017117968A1 (zh) 数据接口分流方法、装置、终端设备和计算机存储介质
KR20190073479A (ko) 메시지들을 송신하기 위한 방법 및 디바이스, 칩 및 단말
CN104137495B (zh) 确认包的处理方法、设备及系统
CN110933724B (zh) VoWiFi和VoLTE语音业务的切换方法和移动终端
US11832124B2 (en) Controlling performance of a wireless device in a heterogeneous network
US20210343304A1 (en) Method for Improving Voice Call Quality, Terminal, and System
CN107819853B (zh) 一种数据传输方法及装置
US20240323753A1 (en) Communication method, apparatus, and system
US20240292265A1 (en) Automatic adjustment of throughput rate to optimize wireless device battery performance
US20230048883A1 (en) Wireless communication device and data processing method
CN113747253B (zh) 网络带宽的确定方法、视频rtp接收端及存储介质
TWI388172B (zh) 設定最大接收狀態變數的方法及其通訊裝置
CN114363957A (zh) 移动终端流量控制方法、装置、设备及存储介质
WO2021013260A1 (zh) 一种网络传输控制方法及装置
CN114285800A (zh) 一种tcp数据流的拥塞调整方法及装置
CN115884258B (zh) 一种数据传输方法、装置、设备和存储介质
CN117395783B (zh) 信号质量优化方法、装置、电子设备及存储介质
WO2012149787A1 (zh) 一种流量控制的方法及设备
GB2372406A (en) Preparing for handover in a communication system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21796355

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21796355

Country of ref document: EP

Kind code of ref document: A1