WO2013178044A1 - 一种数据传输方法、装置及系统 - Google Patents

一种数据传输方法、装置及系统 Download PDF

Info

Publication number
WO2013178044A1
WO2013178044A1 PCT/CN2013/076274 CN2013076274W WO2013178044A1 WO 2013178044 A1 WO2013178044 A1 WO 2013178044A1 CN 2013076274 W CN2013076274 W CN 2013076274W WO 2013178044 A1 WO2013178044 A1 WO 2013178044A1
Authority
WO
WIPO (PCT)
Prior art keywords
window
lower limit
limit value
receiving window
size
Prior art date
Application number
PCT/CN2013/076274
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 WO2013178044A1 publication Critical patent/WO2013178044A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/27Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/34Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers

Definitions

  • the transmitting end In the existing LTE (Long Term Evolution) air interface transmission technology, there are two transmission modes in the RLC (Radio Link Control) layer, which are Acknowledged Mode (AM) and Unacknowledged Mode. (Unacknowledged Mode, UM).
  • RLC UM transmission mode the transmitting end is only responsible for transmitting the data packet to the receiving end, and the receiving end does not need to further acknowledge the feedback to the transmitting end of the data packet receiving situation. That is to say, regardless of whether the receiving end successfully receives the data packet, the transmitting end does not resend the data packet.
  • the receiving end of the RLC UM transmission mode although it is not necessary to ensure reliable reception of the data packet, it is necessary to ensure that the data packet is delivered to the receiving layer in order.
  • the so-called sequential delivery refers to the delivery of the received data packet to the receiving layer in the order of increasing the sequence number (SN) assigned by the RLC.
  • SN sequence number assigned by the RLC.
  • MAC Media Access Control
  • HARQ Hybrid Automatic Repeat request
  • the RLC layer at the receiving end senses that the data packet SN is out of order (the packet sequence number SN is not After continuous), the RLC layer at the receiving end does not know whether subsequent packets will arrive because the unreached packets may have been lost or may be waiting for retransmission. For example, after receiving the data packet with the SN of 5, the RLC layer on the receiving end does not receive the data packet with the SN being 4, indicating that the SN is discontinuous.
  • the receiving end RLC layer starts a T-reordering reordering timer for the data packet with the SN of 5, if the unreceived data packet with the SN less than 5 has not been received before the reordering timer expires, In other words, if the data packet with the SN of 4 is not received, the data packet with the SN of 4 that is not received out of order and the received data packet whose sequence number is greater than the SN are not delivered to the receiving layer, that is, Only packets with SNs of 0, 1, 2, 3 are delivered to the receiving layer.
  • the theoretical waiting timing t-reordering Timer may be a multiple of a fixed interval, for example, a fixed interval of 8 ms, t
  • the -reordering Timer is twice the fixed interval, that is, 16ms.
  • the t-reordering Timer needs to be set longer than the theoretical value in the application.
  • the t-reordering timer is configured for a longer period of time than the synchronous scheduling.
  • the RLC layer at the receiving end starts the reordering timer, it needs to wait for the t-reordering Timer to time out before submitting the data packet before the out-of-order packet to the receiving layer, that is, the SN in the above example is 0, 1, 2 , 3 packets. This results in a longer delay in the delivery of the data packet. In addition, the longer the delivery delay of the data packet, the more severe the jitter of the data packet during transmission. Summary of the invention
  • the embodiment of the invention provides a data transmission method, device and system, which achieve the purpose of reducing the delay of data packet delivery.
  • a data transmission method comprising: Adjusting a lower limit value of the original receiving window by using a preset reordering window size to obtain a lower limit value of the current receiving window; a lower limit value of the original receiving window is a packet serial number of a next data packet that the receiving end desires to receive;
  • the lower limit value is a breakpoint value; the breakpoint value is a packet sequence number of the first unreceived data packet that is not less than a lower limit value of the current receiving window;
  • a data packet whose packet sequence number is smaller than the breakpoint value is delivered to the receiving layer of the receiving end.
  • a data transmission device comprising:
  • a lower limit adjustment unit configured to adjust a lower limit value of the original receiving window by using a preset reordering window size, to obtain a lower limit value of the current receiving window; and a lower limit value of the original receiving window is expected to be received by the receiving end
  • a lower limit value comparing unit configured to compare a lower limit value of the current receiving window with a lower limit value of the original receiving window, if a lower limit value of the current receiving window is greater than a lower limit value of the original receiving window, And updating the lower limit value of the original receiving window as a breakpoint value;
  • the breakpoint value is a packet sequence number of the first unreceived data packet not smaller than a lower limit value of the current receiving window;
  • a unit configured to deliver a data packet whose packet sequence number is smaller than the breakpoint value to a receiving layer of the receiving end.
  • a data transmission system characterized in that the system comprises the above-mentioned data transmission device and a data transmitting end that transmits a data packet to the data transmission device.
  • the lower limit value of the original receiving window is first adjusted by using the size of the preset reordering window, and the current receiving window lower limit obtained by the adjustment is ensured.
  • the value is greater than the lower limit of the original receiving window, thus reducing the number of packets that are waiting to be received for reordering, that is, reducing the waiting time for receiving the packet; second, updating the lower limit of the original receiving window.
  • the value is not less than the current receiving window
  • the packet sequence number of the first packet that is not continuously received by the lower limit value which clarifies which packets need to be reordered and submitted to the receiving layer; finally, the determined packet sequence number is smaller than the breakpoint value.
  • the data packet is delivered to the receiving layer, which achieves the purpose of reducing the delay of packet delivery, and further reduces the jitter of the data packet during transmission.
  • FIG. 1 is a flowchart of an implementation manner of a data transmission method according to an embodiment of the present invention
  • FIG. 2 is a flowchart of another implementation manner of a data transmission method according to an embodiment of the present invention
  • FIG. 3 is a data transmission device according to an embodiment of the present invention
  • FIG. 4 is a schematic structural diagram of another implementation manner of a data transmission device according to an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a lower limit adjustment unit according to an embodiment of the present invention.
  • the lower limit value of the original receiving window is adjusted, so that the adjusted current receiving window lower limit value is not less than the original receiving window.
  • Limit value to reduce the waiting time for receiving the data packet then, update the lower limit value of the original receiving window as the breakpoint value, and explicitly need to reorder and submit the data packet to the receiving layer; finally, the packet sequence number is smaller than the breakpoint value.
  • the packet is delivered to the receiving layer.
  • the embodiment of the invention achieves the purpose of reducing the packet delivery delay, and further reduces the jitter of the data packet during the transmission process.
  • FIG. 1 it is a flowchart of an implementation manner of a data transmission method according to an embodiment of the present invention, including:
  • Step 101 Adjust a lower limit value VR(UR) of the original receiving window by using a preset reordering window size to obtain a lower limit value VR0JRO of the current receiving window; a lower limit value VROJR of the original receiving window is expected to be received by the receiving end.
  • the packet sequence number of the next packet is not limited to the packet sequence number of the next packet.
  • packet out-of-order may occur due to the relationship between MAC HARQ retransmission and dynamic scheduling.
  • the transmitting end sends data packets with SNs of 0, 1, 2, 3, 4, and 5 respectively, and the data packets with SNs of 0, 1, 2, 3, and 5 are successfully received by the receiving end, and the SN is 4
  • the data packet is lost;
  • the packet to receive is the packet sequence number of the packet that triggers the reordering timer to start plus 1.
  • the original receiving window is for the packet loss situation where the SN is 4
  • the lower limit of the receiving window is the SN corresponding to the next packet that the receiving end expects to receive, that is, the original receiving window is [4, 10)
  • the number of data packets is five, that is, the SN is 5, 6, 7, and 8. 9 packets.
  • the RLC layer needs to wait for the number of packets considered to be reordered to be zero. This greatly reduces the number of data packets that the receiving end is waiting to receive, which reduces the waiting time for receiving, and provides a technical basis for reducing the delay of data packet delivery.
  • Step 101 The process of adjusting the lower limit value of the original receiving window by using the preset reordering window size to obtain the lower limit value of the current receiving window may be embodied as follows:
  • a lower limit value of the current receiving window a value range of an absolute value mod packet number of a difference between an upper limit value of the original receiving window and a size of the preset reordering window;
  • the upper limit of the original receiving window is the maximum packet number of the currently received packet plus one.
  • Step 102 Compare a lower limit value of the current receiving window with a lower limit value of the original receiving window, and if the lower limit value of the current receiving window is greater than a lower limit value of the original receiving window, update the original
  • the lower limit of the receiving window is a breakpoint value; the breakpoint value is a packet sequence number of the first unreceived data packet not less than the lower limit value of the current receiving window.
  • step 101 After the original receiving window lower limit value VR(UR) is adjusted in step 101, it is further determined whether the obtained current receiving window lower limit value VR0JRO) satisfies the purpose of adjusting the lower limit value in the embodiment of the present invention, that is, the judgment is adjusted.
  • VROJRC VR(UR)
  • the number of packets between the adjusted lower limit VR0JRO) and the upper limit VR UH) and the number of packets between VR UR) and the upper limit VR UH) Equal, that is, the number of packets waiting to be received has not changed; if VR(URO)>VR(UR), the ratio of the number of packets between the adjusted lower limit value VR0JRO) and the upper limit value VR UH)
  • the number of data packets between VR UR) and the upper limit value VR (UH) is small, that is, the number of data packets waiting to be received is reduced.
  • this step also needs to update the original receiving window lower limit value VR(UR) to update it to a breakpoint value. That is to say, updating to the SN of the first packet that is not continuously received, which is not less than VR (URO), so that the RLC layer can reduce the packet sequence number to be smaller than the breakpoint value and larger than the original reception window lower limit value VR ( The data packets of UR) are assembled and submitted to the receiving layer.
  • Step 103 Submit a data packet whose packet sequence number is smaller than the breakpoint value to the receiving layer of the receiving end.
  • the embodiment of the present invention from the perspective of reducing the number of data packets considered to be received by the RLC layer, the lower limit value of the original receiving window is adjusted, and the time that the receiving end waits for receiving is reduced, thereby reducing the data packet.
  • the purpose of submitting the delay further reduces the jitter of the data packets during transmission. This is mainly because the jitter in the transmission process indicates the delay variation of the data packet during the transmission process.
  • the embodiment of the present invention can stop the waiting delay of some data packets according to the current receiving window. Therefore, the jitter of the transmission is reduced, that is, the delivery delay of the data packet is effectively reduced, and the jitter of the transmission is also reduced. As shown in FIG.
  • Step 104 If the lower limit value of the current receiving window is greater than or less than the reordering timer state variable VR(UX), controlling the running reordering timer to stop timing; if the lower limit value of the current receiving window is less than the reordering timing
  • the state variable VR UX ends the data transfer process.
  • the reordering timer state variable VR(UX) is incremented by one for the packet sequence number of the packet that triggers the reordering timer to start.
  • the reordering timer state variable VR (UX) refers to the packet sequence number of the data packet triggered by the RLC layer triggering the reordering timer plus 1, if the current receiving window lower limit
  • One method is to calculate the size of the preset reordering window by using the value range of the packet sequence number, the number of HARQ processes used for configuration, the number of transmission blocks transmitted by a single HARQ process, and the total number of transmissions of the HARQ process.
  • the specific formula is:
  • SN_in_Flight_Window Min ⁇ The total number of packet sequence numbers is /2, (the number of HARQ processes used for configuration * the number of transport blocks transmitted by a single HARQ process -1) * The total number of transmissions of the HARQ process + 1 ⁇ .
  • the other method is to use the value range of the packet sequence number, the number of HARQ processes used for configuration, the number of transport blocks transmitted by a single HARQ process, the total number of transmissions of the HARQ process, and the number of aggregated cells (each aggregated cell).
  • the embodiment of the present invention is mainly directed to the downlink direction from the base station to the receiving end. Therefore, the number of aggregated cells is equivalent to the number of downlink aggregated carriers, and each The maximum number of transmissions of the HARQ process calculates the size of the preset reordering window.
  • the specific formula is:
  • SN_in_Flight_Window Min ⁇ The total value of the packet sequence number is /2, (the number of HARQ processes used for configuration * the number of transport blocks transmitted by a single HARQ process - 1) * The total number of transmissions of the HARQ process + 1 + Sum (other carriers Number of processes * number of transport blocks per process * maximum number of transfers per HARQ process) ⁇ .
  • the number of transmission blocks transmitted in a single HARQ process reflects that the wireless network signal is synchronously transmitted and received through several antennas.
  • the number of transmission blocks that can be transmitted in a single HARQ process can be two. Or 4, for non-MIMO systems
  • the number of transport blocks transmitted by a single HARQ process at one time is 1.
  • the value range of the packet sequence number can be configured by the base station as the receiving end, which can be embodied as a bit length of 5 bits or 10 bits. For lObit, the value of the packet sequence number ranges from 0 to 1023.
  • the number of used HARQ processes can be configured from 1 to 8 by the base station; the number of transmission blocks transmitted by a single HARQ process can also be configured by the base station to be 1 to 4; the number of cells can be 1 to 5.
  • the preset reordering window set according to the above parameters may be between 1 ⁇ 2 A (snFieldLength-l).
  • the process of setting the preset reordering window size in the embodiment of the present invention is described in the following with reference to the above-mentioned parameter value range.
  • the value of the parameter is:
  • the number of aggregated cells is 2;
  • the number of HARQ processes that the first cell UE can use in the aggregated cell is 5;
  • the number of transport blocks that can be transmitted by each HARQ process in the first cell is 1; the total number of transmissions of the HARQ process in the first cell is 3;
  • the number of HARQ processes that the second cell UE can use in the aggregated cell is 4;
  • the number of transport blocks that can be transmitted by each HARQ process in the second cell is 2;
  • the total number of transmissions of the HARQ process of the second cell is 4.
  • the cell to which the UE receiving the current data belongs is the first cell, and the size of the preset reordering window is calculated according to the formula provided by the embodiment of the present invention:
  • SN_in_Flight_Window Min ⁇ The total value of the packet sequence number is /2, (the number of HARQ processes used for configuration * the number of transport blocks transmitted by a single HARQ process - 1) * The total number of transmissions of the HARQ process + 1 + Sum (other carriers The number of processes * the number of transport blocks per process * the maximum number of transmissions per HARQ process) ⁇ , then the size of the Window used by the UE can be calculated as: SN—in— Flight— Window
  • the lower limit of the original reception window is 1, and the upper limit of the original reception window is 51.
  • the lower limit value of the current receiving window the absolute value of the difference between the upper limit value of the original receiving window and the size of the preset reordering window, the value range of the mod packet number is calculated, and the current obtained by
  • mod 1024 6 is calculated.
  • the lower limit of the receive window is 6.
  • SN_in_Flight-Window may be obtained by the receiving end according to the above-mentioned parameters according to the formula, or may be directly used by the base station to be directly sent to the receiving end for use, and the embodiment of the present invention does not do this. limited.
  • a data transmission device according to an embodiment of the present invention, as shown in FIG. 3, shows a schematic structural diagram of a data processing device, where the device includes:
  • the lower limit value adjusting unit 301 is configured to adjust a lower limit value of the original receiving window by using a preset reordering window size to obtain a lower limit value of the current receiving window; and a lower limit value of the original receiving window is expected to be received by the receiving end The packet number of the next packet.
  • a lower limit value comparing unit 302 configured to compare a lower limit value of the current receiving window with a lower limit value of the original receiving window, if a lower limit value of the current receiving window is greater than a lower limit value of the original receiving window And updating the lower limit value of the original receiving window as a breakpoint value; the breakpoint value is a packet sequence number of the first unreceived data packet not smaller than a lower limit value of the current receiving window.
  • the data packet sending unit 303 is configured to deliver a data packet whose packet sequence number is smaller than the breakpoint value to the receiving layer of the receiving end.
  • the data transmission apparatus of the embodiment of the present invention reduces the number of data packets considered to be reordered that need to be received by the RLC layer by using the lower limit value adjusting unit, thereby reducing the waiting of the RLC layer at the receiving end.
  • the purpose of the data processing apparatus is as shown in FIG. 4, which is another schematic diagram of the data processing apparatus of the embodiment of the present invention.
  • the apparatus further includes:
  • the stop timing determining unit 304 is configured to control the running reordering timer to stop timing if the lower limit value of the current receiving window is greater than or equal to the reordering timer state variable, where the reordering timer state variable is triggered The packet number of the packet started by the reordering timer is incremented by one.
  • the control reordering timer stops running to reduce The terminal maintains the overhead of the reordering timer.
  • the lower limit adjustment unit specifically includes:
  • the window setting unit 401 is configured to set a size of the preset reordering window.
  • the upper limit of the original receiving window is the maximum packet number of the currently received packet plus one.
  • the first aspect of the embodiment of the present invention first presets a current receiving window size by the window setting unit, and then uses the upper limit value of the original receiving window.
  • the VR (UH) calculation obtains the lower limit value VR(URO) of the current receiving window.
  • the receiving end successfully receives the data of the SNs of 0, 1, 2, 3, 5, 6, 7, and 9. Packets, packets with SN 4, 8 are lost during transmission.
  • the receiving window is adjusted from the original receiving window [4, 10) to the current receiving window [7, 10), which needs to be submitted for re-sorting.
  • the number of data packets is reduced from 4 (packets with SNs of 5, 6, 7, and 9) to 1 (packets with SN of 9), reducing the number of packets that the receiving end needs to wait for receiving, which greatly reduces the number of packets. Wait The time to be received achieves the purpose of reducing the delay of packet delivery.
  • One method is to use the value range of the packet sequence number, the number of HARQ processes to be configured, the number of transport blocks transmitted by a single HARQ process, and the total number of transmissions of the HARQ process.
  • the specific formula is:
  • SN_in_Flight_Window Min ⁇
  • the total value of the packet sequence number is /2, (the number of HARQ processes used for configuration * the number of transport blocks transmitted by a single HARQ process -1) * The total number of transmissions of the HARQ process + 1 ⁇ .
  • the number of aggregated cells and the maximum number of transmissions per HARQ process are fully considered, and the six factors are used to set the preset reordering window size.
  • the specific formula is:
  • SN_in_Flight_Window Min ⁇ The total value of the packet sequence number is /2, (the number of HARQ processes used for configuration * the number of transport blocks transmitted by a single HARQ process - 1) * The total number of transmissions of the HARQ process + 1 + Sum (other carriers Number of processes * number of transport blocks per process * maximum number of transfers per HARQ process) ⁇ .
  • an embodiment of the present invention further provides a data transmission system, where the system includes the data transmission device according to the embodiment of the present invention and a data transmitting end that sends a data packet to the data transmission device.
  • Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another.
  • a storage medium may be any available media that can be accessed by a computer.
  • computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, Or can be used to carry or store any other medium having the desired program code in the form of an instruction or data structure and being accessible by a computer.
  • connection may suitably be a computer readable medium.
  • the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave
  • coaxial cable , fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwaves are included in the fixing of the associated media.
  • a disk and a disc include a compact disc (CD), a laser disc, a disc, a digital versatile disc (DVD), a floppy disc, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.
  • the various embodiments in the present specification are described in a progressive manner, and the same or similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments.
  • the description since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.
  • the separation unit may or may not be a physical unit, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. Those of ordinary skill in the art can understand and implement without any creative effort.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Communication Control (AREA)

Abstract

本发明提供一种数据传输方法、装置及系统,所述方法包括:利用预设重排序窗口大小调整原始接收窗口的下限值,得到当前接收窗口的下限值,原始接收窗口下限值为接收端期望接收到的下一个数据包的包序号;比较当前接收窗口的下限值与原始接收窗口的下限值,如果为大于,则更新原始接收窗口的下限值为断点值;断点值为不小于当前接收窗口的下限值的第一个未接收到的数据包的包序号,将包序号小于所述断点值的数据包递交给接收层。本发明实施例实现了降低数据包递交时延的目的,还降低了传输过程中数据包的抖动。

Description

一种数据传输方法、 装置及系统
本申请要求于 2012 年 5 月 30 日提交中国专利局、 申请号为 201210173623.X,发明名称为"一种数据传输方法、装置及系统"的中国专利 申请的优先权, 其全部内容通过引用结合在本申请中。 技术领域 本发明涉及通信技术领域, 具体涉及一种数据传输方法、 装置及系统。 背景技术
现有的 LTE (Long Term Evolution, 长期演进) 空口传输技术中, 在 RLC (Radio Link Control, 无线链路控制) 层有两种传输模式, 分別是确 认模式 ( Acknowledged Mode, AM )和非确认模式( Unacknowledged Mode, UM)。 对于 RLC UM传输模式来说, 发送端只负责将数据包发送给接收端 即可, 不需要接收端进一步对数据包接收情况向发送端进行确认反馈。 也 就是说, 不论接收端是否成功接收到数据包, 发送端都不再重新发送数据 包。
对于 RLC UM传输模式的接收端来说, 虽然不需要保证数据包的可靠 接收,但却需要保证数据包按序递交给接收层。所谓按序递交是指按照 RLC 分配的包序号 (Sequence Number, SN) 递增的顺序将接收到的数据包递交 给接收层。 然而, 在实际传输过程中, 由于存在 MAC (Media Access Control, 媒 体接入控制) HARQ (Hybrid Automatic Repeat request, 混合式自动重送请 求) 重传以及动态调度的关系, 导致数据包可能并不是按照 RLC SN递增 的顺序到达接收端的 RLC层, 出现数据包的乱序接收情况。 现有技术中, 在接收端 RLC层感知到数据包 SN乱序 (包序号 SN不 连续) 后, 接收端 RLC层并不清楚后续的数据包是否会到达, 因为未到达 的数据包可能已经丟失、 也可能正在等待重传。 例如, 接收端 RLC层接收 到 SN为 5的数据包后, 经检查发现并未接收到 SN为 4的数据包, 说明出 现了 SN不连续的情况。 此时, 接收端 RLC层就会针对 SN为 5的数据包 启动一个 T-reordering重排序定时器, 如果在重排序定时器超时之前, 还未 接收到 SN小于 5的未接收到的数据包, 也就是说未接收到 SN为 4的数据 包, 则不会将出现乱序未接收到的 SN为 4的数据包以及序号大于该 SN的 已接收到数据包递交给接收层, 也就是说, 只将 SN为 0、 1、 2、 3的数据 包递交给接收层。
对于重排序定时器的等待定时 t-reordering Timer, 如果 HARQ进程采 用固定间隔的同步调度方式重传, 则理论上等待定时 t-reordering Timer可 为固定间隔的倍数, 例如, 固定间隔为 8ms, t-reordering Timer为固定间隔 的 2倍, 即 16ms, 但是考虑到发送端和接收端的传输时延问题, 在应用中 还需要将 t-reordering Timer设置的比理论值再长一些。 而对于 HARQ进程 采用非固定间隔的异步调度方式重传时, t-reordering Timer配置的时长要比 同步调度的时间还要长。
因为在接收端 RLC层启动重排序定时器后,需要等待 t-reordering Timer 超时后, 才会向接收层递交乱序数据包之前的数据包, 也就是上例中的 SN 为 0、 1、 2、 3的数据包。 这就导致该部分数据包的递交时延较长, 另外, 数据包的递交时延越长, 传输过程中数据包的抖动情况就越严重。 发明内容
本发明实施例提供一种数据传输方法、 装置及系统, 实现降低数据包 递交时延的目的。
为此, 本发明实施例提供如下技术方案:
一种数据传输方法, 所述方法包括: 利用预设重排序窗口大小调整原始接收窗口的下限值, 得到当前接收 窗口的下限值; 所述原始接收窗口的下限值为接收端期望接收到的下一个 数据包的包序号;
比较所述当前接收窗口的下限值与所述原始接收窗口的下限值, 如果 所述当前接收窗口的下限值大于所述原始接收窗口的下限值, 则更新所述 原始接收窗口的下限值为断点值; 所述断点值为不小于所述当前接收窗口 的下限值的第一个未接收到的数据包的包序号;
将包序号小于所述断点值的数据包递交给所述接收端的接收层。
一种数据传输装置, 所述装置包括:
下限值调整单元, 用于利用预设重排序窗口大小调整原始接收窗口的 下限值, 得到当前接收窗口的下限值; 所述原始接收窗口的下限值为接收 端期望接收到的下一个数据包的包序号;
下限值比较单元, 用于比较所述当前接收窗口的下限值与所述原始接 收窗口的下限值, 如果所述当前接收窗口的下限值大于所述原始接收窗口 的下限值, 则更新所述原始接收窗口的下限值为断点值; 所述断点值为不 小于所述当前接收窗口的下限值的第一个未接收到的数据包的包序号; 数据包发送单元, 用于将包序号小于所述断点值的数据包递交给所述 接收端的接收层。
一种数据传输系统, 其特征在于, 所述系统包括上述的数据传输装置 以及向所述数据传输装置发送数据包的数据发送端。
本发明实施例数据传输方法、 装置及系统, 在接收端出现数据包乱序 之后, 首先利用预设重排序窗口的大小调整原始接收窗口的下限值, 并保 证调整获得的当前接收窗口下限值大于原始接收窗口的下限值, 这样就减 少了等待接收的被考虑重排序的数据包的个数, 也就是说减少了等待接收 数据包的时间; 其次, 还更新原始接收窗口的下限值为不小于当前接收窗 口下限值的第一个未被连续接收到的数据包的包序号, 这就明确了哪些是 需要重排序并递交给接收层的数据包; 最后, 再将确定的包序号小于断点 值的数据包递交给接收层, 实现了降低数据包递交时延的目的, 进而还降 低了传输过程中数据包的抖动。 附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案, 下面将对 实施例或现有技术描述中所需要使用的附图作简单地介绍, 显而易见地, 下面描述中的附图仅仅是本申请中记载的一些实施例, 对于本领域普通技 术人员来讲, 还可以根据这些附图获得其他的附图。
图 1是本发明实施例数据传输方法的一种实现方式的流程图; 图 2是本发明实施例数据传输方法的另一种实现方式的流程图; 图 3是本发明实施例数据传输装置的一种实现方式的构成示意图; 图 4是本发明实施例数据传输装置的另一种实现方式的构成示意图; 图 5是本发明实施例中下限值调整单元的构成示意图。 具体实施方式
为了使本技术领域的人员更好地理解本发明方案, 下面结合附图和实 施方式对本发明实施例作进一步的详细说明。
本发明实施例数据传输方法、 装置及系统, 在接收端发现数据包乱序 之后, 首先, 调整原始接收窗口的下限值, 使调整后的当前接收窗口下限 值不小于原始接收窗口的下限值, 以减少等待接收数据包的时间; 然后, 更新原始接收窗口的下限值为断点值, 明确需要重排序并递交给接收层的 数据包; 最后, 将包序号小于断点值的数据包递交给接收层。 本发明实施 例就实现了降低数据包递交时延的目的, 进而还降低了传输过程中数据包 的抖动。 如图 1所示, 是本发明实施例数据传输方法的一种实现方式的流程图, 包括:
步骤 101, 利用预设重排序窗口大小调整原始接收窗口的下限值 VR(UR),得到当前接收窗口的下限值 VR0JRO) ;所述原始接收窗口的下限 值 VROJR)为接收端期望接收到的下一个数据包的包序号。
在 RLC层采用非确认模式进行数据的发送与接收时,由于 MAC HARQ 重传以及动态调度的关系, 可能会出现数据包乱序现象。 例如, 发送端发 送 SN分別为 0、 1、 2、 3、 4、 5的数据包, 在传输过程中 SN为 0、 1、 2、 3、 5的数据包被接收端成功接收, SN为 4的数据包丟失; 接收端 RLC层 在连续接收到 SN为 0、 1、 2、 3的数据包之后, 更新期望接收到的下一个 数据包的 SN变量 VR(UR) = 3+1= 4,接收端 RLC层在接收到 SN为 5的数 据包后, 则更新变量 VR(UH)为接收到的最大 SN 的下一个 SN, 即 VR(UH)=5+1=6, 如果经 RLC层检查发现并未接收到 SN为 4的数据包, 而此时 VR(UH) > VR(UR), 则接收端判断出现了传输的乱序, 需要启动重 排序操作。 即, 接收端 RLC层针对 SN为 5的数据包启动一个重排序定时 器, 此时, SN为 5的数据包即为触发重排序定时器启动的数据包, 而重排 序定时器状态变量 VR(UX;)=6 (重排序定时器状态变量为触发重排序定时器 启动的数据包的包序号加 1 ), 也就是说 SN为 6的数据包是 RLC层完成当 前重排序后第一个想要接收的数据包。 如果 RLC层在接收到 SN为 3的数 据包之后, 继续接收到 SN为 5、 6、 7、 8、 9的数据包, 则对于 SN为 4的 数据包丟包情况来说, 原始接收窗口的上限值 VR(UH)=9+1=10 (原始接收 窗口的上限值为当前已接收到的数据包的最大包序号加 1 ), 原始接收窗口 的下限值 VR0JR)=4 (原始接收窗口的下限值为接收端期望接收到的下一个 数据包对应的 SN), 也就是说, 原始接收窗口为 [4, 10), 相应地, RLC层 需要等待递交的被考虑重排序的数据包个数为 5个, 即 SN为 5、 6、 7、 8、 9的数据包。
本步骤为了缩短等待递交的时间, 通过一个预设重排序窗口大小对原 始接收窗口进行调整, 例如预设重排序窗口大小 SN— in— Flight— Window=3, 则 调 整 后 的 当 前 接 收 窗 口 下 限 值 VR0JRO)= VR(UH)- SN— in— Flight— Window=l 0-3=7, 也就是说当前接收窗口为 [7, 10), 而由于 数据包 7、 8、 9已经被成功接收, RLC层需要等待接收的被考虑重排序的 数据包个数为 0个。 这就大大减少了接收端等待接收的数据包个数, 也就 减少了等待接收时间, 为降低数据包递交时延提供了技术基础。
步骤 101 利用预设重排序窗口大小调整原始接收窗口的下限值, 得到 当前接收窗口的下限值的过程可具体体现为:
首先, 设置所述预设重排序窗口的大小。 对于本发明实施例中设置预 设重排序窗口大小的具体方式此处暂不详述。
其次, 计算所述当前接收窗口的下限值, 当前接收窗口的下限值=原始 接收窗口的上限值与预设重排序窗口的大小之差的绝对值 mod包序号的取 值范围; 所述原始接收窗口的上限值为当前已接收到的数据包的最大包序 号加 1。
由于包序号的取值范围采用的是周期方式, 因此对于计算当前接收窗 口的下限值的过程需要考虑取模操作, 例如, Final value = [value from arithmetic operation ] modulo 2A[sn-FieldLength]。
步骤 102,比较所述当前接收窗口的下限值与所述原始接收窗口的下限 值, 如果所述当前接收窗口的下限值大于所述原始接收窗口的下限值, 则 更新所述原始接收窗口的下限值为断点值; 所述断点值为不小于所述当前 接收窗口的下限值的第一个未接收到的数据包的包序号。
经由步骤 101调整原始接收窗口下限值 VR(UR)后,还需要更进一步判 断得到的当前接收窗口下限值 VR0JRO)是否满足本发明实施例调整下限值 欲达到的目的, 即判断调整下限值后是否能减少等待接收的数据包个数, 如果 VROJRC = VR(UR) , 则说明调整后的下限值 VR0JRO)与上限值 VR UH)之间的数据包个数与 VR UR)与上限值 VR UH)之间的数据包个数 相等, 即等待接收的数据包个数未发生改变; 如果 VR(URO)>VR(UR), 则 说明调整后的下限值 VR0JRO)与上限值 VR UH)之间的数据包个数比 VR UR)与上限值 VR(UH)之间的数据包个数少, 即等待接收的数据包个数 减少。
此外, 为了明确 RLC层需要递交给接收层的数据包, 本步骤还需要对 原始接收窗口下限值 VR(UR)进行更新, 将其更新为断点值。 也就是说, 更 新到不小于 VR(URO)的第一个没有被连续接收的数据包的 SN,这样, RLC 层就可以将包序号小于断点值,且大于原始接收窗口下限值 VR(UR)的数据 包组装后递交给接收层。
对于断点值来说, 是指不小于调整后的下限值 VR0JRO)的第一个未被 连续接收到数据包的包序号,仍以上述 SN为 4的数据包出现丟包现象为例: 如果在启动重排序定时器的数据包 (SN=5), 以及已接收到的 SN最大 的数据包 (SN=9) 之间存在的所有数据包都被接收到, 即接收端接收到发 送端发送的 SN为 6、 7、 8的数据包, 则不小于 VR(URO)=7的第一个未被 连续接收到数据包的 SN=10, 则断点值 =10, 更新得到的 VR(URy=10。
如果在 SN=5以及 SN=9之间存在未接收到的数据包, 例如, 接收端接 收到发送端发送的 SN为 6和 7的数据包, 而未接收到 SN=8的数据包, 则 不小于 VR0JRO)=7的第一个未被连续接收到数据包的 SN=8,则断点值 =8, 更新得到的 VR(URy=8。
步骤 103,将包序号小于所述断点值的数据包递交给所述接收端的接收 层。
在更新原始接收窗口的下限值为 VR(URy之后, RLC层就可以重新组 装 RLC SDUs, 将包序号小于 VR(UR)'的数据包传递给接收层, 这就缩短了 数据包的递交时延。 例如, 对于数据包 4 丟失, 而数据包 5、 6、 7、 8、 9 被成功接收, 并更新 VR0JRy=10的情况而言, RLC层重新组装的是 SN为 5、 6、 7、 8、 9的数据包; 对于数据包 4、 8丟失, 而数据包 5、 6、 7被成 功接收, 并更新 VR(URy=8的情况而言, RLC层重新组装的是 SN为 5、 6、 7的数据包。
这样本发明实施例就从减少 RLC层需要等待接收的被考虑重排序的数 据包的个数的角度出发, 通过调整原始接收窗口的下限值, 降低接收端等 待接收的时间, 实现降低数据包递交时延的目的, 进而还降低了传输过程 中数据包的抖动。 这主要是因为, 传输过程中的抖动表示的是数据包在传 输过程中的时延变化, 本发明的实施例在出现乱序时, 可以依据当前接收 窗来停止部分数据包的等待时延, 因此降低了传输的抖动, 也就是说有效 降低了数据包的递交时延, 也就降低了传输的抖动。 如图 2 所示, 是本发明实施例数据传输方法的另一种实现方式的流程 图, 在将包序号小于断点值的数据包递交给接收层之后, 所述方法还包括: 步骤 104,如果所述当前接收窗口的下限值大于或小于重排序定时器状 态变量 VR(UX), 则控制正在运行的重排序定时器停止计时; 如果所述当前 接收窗口的下限值小于重排序定时器状态变量 VR UX),则结束数据传输过 程。所述重排序定时器状态变量 VR(UX)为触发重排序定时器启动的数据包 的包序号加 1。
本步骤主要是确定停止重排序定时器运行的时机, 重排序定时器状态 变量 VR(UX)是指 RLC层触发重排序定时器启动的数据包的包序号加 1, 而如果当前接收窗口下限值 VR0JRO)大于或等于 VR0JX), 则说明即使接 收端 RLC层接收到 VR(UX)=6的数据包, 那么该数据包也因为包序号小于 更新得到的 VR0JR)' (即 10 ) 而被视为无效数据, 因此, 只要经判断 VR(URO)>VR(UX), 就说明此时已没有继续維护重排序定时器的必要了, 可以控制重排序定时器停止运行, 以减少终端維护重排序定时器的开销。 需要说明的是, 与计算当前接收窗口的下限值的方法相类似, 因为包 序号的取值范围采用的是周期方式, 因此本发明实施例中所有涉及到对包 序号的操作均是取模操作。 下面对本发明实施例中设置预设重排序窗口大小的具体方式进行简单 介绍。
一种方式是, 利用包序号的取值范围、 配置使用的 HARQ进程个数、 单个 HARQ进程一次传输的传输块个数以及 HARQ进程的总传输次数计算 所述预设重排序窗口的大小。 具体公式为:
SN_in_Flight_Window= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1} 。 另一种方式是, 利用包序号的取值范围、配置使用的 HARQ进程个数、 单个 HARQ进程一次传输的传输块个数、 HARQ进程的总传输次数、 聚合 的小区个数 (每个聚合小区对应有一个上行的聚合载波和一个下行的聚合 载波, 本发明实施例主要针对的是基站到接收端的下行方向, 因此, 聚合 的小区个数也就相当于下行的聚合载波个数)、每个 HARQ进程的最大传输 次数计算所述预设重排序窗口的大小。 具体公式为:
SN_in_Flight_Window= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1+Sum (其他载波的进程个数 *每个进程的传输块个数 * 每 个 HARQ进程的最大传输次数) } 。
其中, 单个 HARQ进程一次传输的传输块个数反映的是无线网络信号 通过几重天线进行同步收发, 对于多天线配置的 MIMO 系统而言, 单个 HARQ进程一次传输的传输块个数可以是 2个或者 4个, 对于非 MIMO系 统而言, 单个 HARQ进程一次传输的传输块个数为 1。 包序号的取值范围 可由基站为接收端配置,可具体体现为 5bit或者 lObit等比特长度,对于 lObit 来说, 包序号的取值范围为 0~1023。 使用的 HARQ进程个数可由基站配置 为 1~8个;而单个 HARQ进程传输的传输块个数也可由基站配置为 1~4个; 小区的个数可为 1~5个。
按 照 上 述参数 设置 出 的 预 设 重排 序 窗 口 的 大 小 可 为 l~2A(snFieldLength-l)之间。 下面结合上述参数取值范围, 对本发明实施例中设置预设重排序窗口 大小的过程进行举例说明。
如果基站为接收端所在小区配置的参数取值为:
序号域的长度为 10, 即包序号的取值总量为 2Λ10 = 1024 ;
聚合的小区个数为 2 ;
第一小区 UE 在该聚合小区可使用的 HARQ进程个数为 5 ;
第一小区每个 HARQ进程一次调度可传输的传输块个数为 1; 第一小区 HARQ进程的总传输次数为 3 ;
第二小区 UE 在该聚合小区可使用的 HARQ进程个数为 4;
第二小区每个 HARQ进程一次调度可传输的传输块个数为 2 ;
第二小区 HARQ进程的总传输次数为 4。
接收当前数据的 UE所属小区为第一小区,依据本发明实施例提供的公 式计算预设重排序窗口的大小:
SN_in_Flight_Window= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1+Sum (其他载波的进程个数 *每个进程的传输块个数 * 每 个 HARQ进程的最大传输次数) }, 则可计算出 UE 使用的 Window 的大 小为: SN— in— Flight— Window
= Min{ (2Λ10) 12, (5*1-1)*3 +1+(4*2*4)}
= Min{512, 45}
= 45
如果 UE期望接收到的下一个数据包的 SN为 1, 当前已接收到的数据 包的最大 SN为 50, 那么, 原始接收窗口的下限值为 1, 原始接收窗口的上 限值为 51。依据当前接收窗口的下限值=原始接收窗口的上限值与预设重排 序窗口的大小之差的绝对值 mod包序号的取值范围,计算 |51-45| mod 1024 = 6得到的当前接收窗口的下限值即为 6。
另外, 需要说明的是, SN— in— Flight— Window可以是接收端根据上述参 数按照公式计算获得, 也可以是由基站计算好后直接下发给接收端利用, 本发明实施例对此不做限定。 相应地, 本发明实施例一种数据传输装置, 如图 3 所示, 示出了数据 处理装置的一种构成示意图, 所述装置包括:
下限值调整单元 301,用于利用预设重排序窗口大小调整原始接收窗口 的下限值, 得到当前接收窗口的下限值; 所述原始接收窗口的下限值为接 收端期望接收到的下一个数据包的包序号。
下限值比较单元 302,用于比较所述当前接收窗口的下限值与所述原始 接收窗口的下限值, 如果所述当前接收窗口的下限值大于所述原始接收窗 口的下限值, 则更新所述原始接收窗口的下限值为断点值; 所述断点值为 不小于所述当前接收窗口的下限值的第一个未接收到的数据包的包序号。
数据包发送单元 303,用于将包序号小于所述断点值的数据包递交给所 述接收端的接收层。
本发明实施例的数据传输装置利用下限值调整单元减少了 RLC层需要 等待接收的被考虑重排序的数据包的个数, 以此来降低接收端 RLC层等待 接收的时间, 实现了降低数据包递交时延的目的 如图 4所示, 示出了本发明实施例数据处理装置的另一种构成示意图, 所述装置还包括:
停止计时判断单元 304,用于如果所述当前接收窗口的下限值大于或等 于重排序定时器状态变量, 则控制正在运行的重排序定时器停止计时, 所 述重排序定时器状态变量为触发重排序定时器启动的数据包的包序号加 1。
在数据包发送单元将包序号小于断点值的数据包递交给接收层之后, 由停止计时判断单元确定一个合适的时机 (即 VROJRO^VROJX)时), 控 制重排序定时器停止运行, 以减少终端維护重排序定时器的开销。
优选的, 如图 5所示, 所述下限值调整单元具体包括:
窗口设置单元 401, 用于设置所述预设重排序窗口的大小。
计算单元 402, 用于计算所述当前接收窗口的下限值, 当前接收窗口的 下限值 =原始接收窗口的上限值与预设重排序窗口的大小之差的绝对值 mod 包序号的取值范围; 所述原始接收窗口的上限值为当前已接收到的数 据包的最大包序号加 1。
为了实现本发明实施例第一方面通过减少等待接收数据包个数的方式 降低数据包递交时延的目的, 先由窗口设置单元预设一个当前接收窗口大 小,再利用原始接收窗口的上限值 VR(UH)计算获得当前接收窗口的下限值 VR(URO)o 例如, 在数据传输过程中, 接收端成功接收到 SN为 0、 1、 2、 3、 5、 6、 7、 9的数据包, SN为 4、 8的数据包在传输过程中丟失, 如果预 设重排序窗口大小 SN— in— Flight— Window=3, VR(UH)=10, VR(UR)=4, 则 VR(URO)= VR(UH)- SN_in_Flight_Window=l 0-3=7,相应地,接收窗口从原 始接收窗口 [4, 10) 调整为当前接收窗口 [7, 10), 需要等待递交的被考虑 重排序的数据包个数从 4个(SN为 5、 6、 7、 9的数据包)降低为 1个(SN 为 9的数据包), 减少接收端需要等待接收的数据包个数, 就大大降低了等 待接收的时间, 实现了降低数据包递交时延的目的。
本发明实施例中提供两种设置预设重排序窗口大小的方式:
一种方式是利用包序号的取值范围、 配置使用的 HARQ进程个数、 单 个 HARQ进程一次传输的传输块个数以及 HARQ进程的总传输次数设置, 具体公式为:
SN_in_Flight_Window = Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1} 。
另一种方式是除上述四个参数之外, 还充分考虑聚合的小区个数和每 个 HARQ进程的最大传输次数, 综合利用这六个因素设置预设重排序窗口 大小, 具体公式为:
SN_in_Flight_Window= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1+Sum (其他载波的进程个数 *每个进程的传输块个数 *每个 HARQ进程的最大传输次数) } 。
相应地, 本发明实施例还提供一种数据传输系统, 所述系统包括本发 明实施例所述的数据传输装置以及向所述数据传输装置发送数据包的数据 发送端。
通过以上的实施方式的描述, 所属领域的技术人员可以清楚地了解到 本发明可以用硬件实现, 或软件实现, 或固件实现, 或它们的组合方式来 实现。 当使用软件实现时, 可以将上述功能存储在计算机可读介质中或作 为计算机可读介质上的一个或多个指令或代码进行传输。 计算机可读介质 包括计算机存储介质和通信介质, 其中通信介质包括便于从一个地方向另 一个地方传送计算机程序的任何介质。 存储介质可以是计算机能够存取的 任何可用介质。以此为例但不限于:计算机可读介质可以包括 RAM、 ROM, EEPROM、 CD-ROM或其他光盘存储、磁盘存储介质或者其他磁存储设备、 或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能 够由计算机存取的任何其他介质。 此外。 任何连接可以适当的成为计算机 可读介质。 例如, 如果软件是使用同轴电缆、 光纤光缆、 双绞线、 数字用 户线 (DSL) 或者诸如红外线、 无线电和微波之类的无线技术从网站、 服务 器或者其他远程源传输的, 那么同轴电缆、 光纤光缆、 双绞线、 DSL 或者 诸如红外线、 无线和微波之类的无线技术包括在所属介质的定影中。 如本 发明所使用的, 盘 (Disk) 和碟 (disc) 包括压缩光碟 (CD)、 激光碟、 光 碟、数字通用光碟(DVD)、 软盘和蓝光光碟, 其中盘通常磁性的复制数据, 而碟则用激光来光学的复制数据。 上面的组合也应当包括在计算机可读介 质的保护范围之内。 本说明书中的各个实施例均采用递进的方式描述, 各 个实施例之间相同相似的部分互相参见即可, 每个实施例重点说明的都是 与其他实施例的不同之处。 尤其, 对于装置实施例而言, 由于其基本相似 于方法实施例, 所以描述得比较简单, 相关之处参见方法实施例的部分说 明即可。 以上所描述的装置实施例仅仅是示意性的, 其中所述作为分离部 可以是或者也可以不是物理单元, 即可以位于一个地方, 或者也可以分布 到多个网络单元上。 可以根据实际的需要选择其中的部分或者全部模块来 实现本实施例方案的目的。 本领域普通技术人员在不付出创造性劳动的情 况下, 即可以理解并实施。
以上对本发明实施例进行了详细介绍, 本文中应用了具体实施方式对 本发明进行了阐述, 以上实施例的说明只是用于帮助理解本发明的方法及 设备; 同时, 对于本领域的一般技术人员, 依据本发明的思想, 在具体实 施方式及应用范围上均会有改变之处, 综上所述, 本说明书内容不应理解 为对本发明的限制。

Claims

权利要求
1、 一种数据传输方法, 其特征在于, 所述方法包括:
利用预设重排序窗口大小调整原始接收窗口的下限值, 得到当前接收 窗口的下限值; 所述原始接收窗口的下限值为接收端期望接收到的下一个 数据包的包序号;
比较所述当前接收窗口的下限值与所述原始接收窗口的下限值, 如果 所述当前接收窗口的下限值大于所述原始接收窗口的下限值, 则更新所述 原始接收窗口的下限值为断点值; 所述断点值为不小于所述当前接收窗口 的下限值的第一个未接收到的数据包的包序号;
将包序号小于所述断点值的数据包递交给所述接收端的接收层。
2、 根据权利要求 1所述的方法, 其特征在于, 所述方法还包括: 在所述将包序号小于所述断点值的数据包递交给所述接收端的接收层 之后,
如果所述当前接收窗口的下限值大于或等于重排序定时器状态变量, 则控制正在运行的重排序定时器停止计时, 所述重排序定时器状态变量为 触发重排序定时器启动的数据包的包序号加 1。
3、 根据权利要求 1或 2所述的方法, 其特征在于, 所述利用预设重排 序窗口大小调整原始接收窗口的下限值, 得到当前接收窗口的下限值具体 包括:
设置所述预设重排序窗口的大小;
计算所述当前接收窗口的下限值, 当前接收窗口的下限值=原始接收窗 口的上限值与预设重排序窗口的大小之差的绝对值 mod 包序号的取值范 围; 所述原始接收窗口的上限值为当前已接收到的数据包的最大包序号加 l o
4、 根据权利要求 3所述的方法, 其特征在于, 所述设置所述预设重排 序窗口的大小具体包括: 按照基站配置的接收窗口的大小设置所述预设重排序窗口的大小。
5、 根据权利要求 3所述的方法, 其特征在于, 所述设置所述预设重排 序窗口的大小具体包括:
利用包序号的取值范围、 配置使用的 HARQ进程个数、 单个 HARQ进 程一次传输的传输块个数以及 HARQ进程的总传输次数计算所述预设重排 序窗口的大小。
6、 根据权利要求 5所述的方法, 其特征在于, 所述计算所述预设重排 序窗口的大小的方式具体为:
预设重排序窗口的大小= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1} 。
7、 根据权利要求 5所述的方法, 其特征在于, 所述设置所述预设重排 序窗口的大小具体还包括:
还利用聚合的小区个数和每个 HARQ进程的最大传输次数计算所述预 设重排序窗口的大小。
8、 根据权利要求 7所述的方法, 其特征在于, 所述计算所述预设重排 序窗口的大小的方式具体为:
预设重排序窗口的大小= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1+Sum (其他载波的进程个数 *每个进程的传输块个数 *每个 HARQ进程的最大传输次数) } 。
9、 一种数据传输装置, 其特征在于, 所述装置包括:
下限值调整单元, 用于利用预设重排序窗口大小调整原始接收窗口的 下限值, 得到当前接收窗口的下限值; 所述原始接收窗口的下限值为接收 端期望接收到的下一个数据包的包序号;
下限值比较单元, 用于比较所述当前接收窗口的下限值与所述原始接 收窗口的下限值, 如果所述当前接收窗口的下限值大于所述原始接收窗口 的下限值, 则更新所述原始接收窗口的下限值为断点值; 所述断点值为不 小于所述当前接收窗口的下限值的第一个未接收到的数据包的包序号; 数据包发送单元, 用于将包序号小于所述断点值的数据包递交给所述 接收端的接收层。
10、 根据权利要求 9所述的装置, 其特征在于, 所述装置还包括: 停止计时判断单元, 用于如果所述当前接收窗口的下限值大于或等于 重排序定时器状态变量, 则控制正在运行的重排序定时器停止计时, 所述 重排序定时器状态变量为触发重排序定时器启动的数据包的包序号加 1。
11、 根据权利要求 9或 10所述的装置, 其特征在于, 所述下限值调整 单元具体包括:
窗口设置单元, 用于设置所述预设重排序窗口的大小;
计算单元, 用于计算所述当前接收窗口的下限值, 当前接收窗口的下 限值 =原始接收窗口的上限值与预设重排序窗口的大小之差的绝对值 mod 包序号的取值范围; 所述原始接收窗口的上限值为当前已接收到的数据包 的最大包序号加 1。
12、 根据权利要求 11所述的装置, 其特征在于, 所述窗口设置单元按 照以下方式设置所述预设重排序窗口的大小:
所述窗口设置单元具体按照基站配置的接收窗口的大小设置所述预设 重排序窗口的大小。
13、 根据权利要求 11所述的装置, 其特征在于, 所述窗口设置单元按 照以下公式设置所述预设重排序窗口的大小:
预设重排序窗口的大小= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1} 。
14、 根据权利要求 11所述的方法, 其特征在于, 所述窗口设置单元按 照以下公式设置所述预设重排序窗口的大小:
预设重排序窗口的大小= Min {包序号的取值总量 /2, (配置使用的 HARQ进程个数 *单个 HARQ进程一次传输的传输块个数 -1 ) *HARQ进程 的总传输次数 + 1+Sum (其他载波的进程个数 *每个进程的传输块个数 *每个 HARQ进程的最大传输次数) } 。
15、 一种数据传输系统, 其特征在于, 所述系统包括如权利要求 9 至 14 任一项所述的数据传输装置以及向所述数据传输装置发送数据包的数 据发送端。
PCT/CN2013/076274 2012-05-30 2013-05-27 一种数据传输方法、装置及系统 WO2013178044A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210173623.XA CN103457707B (zh) 2012-05-30 2012-05-30 一种数据传输方法、装置及系统
CN201210173623.X 2012-05-30

Publications (1)

Publication Number Publication Date
WO2013178044A1 true WO2013178044A1 (zh) 2013-12-05

Family

ID=49672416

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/076274 WO2013178044A1 (zh) 2012-05-30 2013-05-27 一种数据传输方法、装置及系统

Country Status (2)

Country Link
CN (1) CN103457707B (zh)
WO (1) WO2013178044A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016033948A1 (zh) * 2014-09-02 2016-03-10 中兴通讯股份有限公司 一种发送窗口流量控制方法和终端

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109644083B (zh) * 2017-06-15 2020-06-30 Oppo广东移动通信有限公司 数据传输方法及相关产品
WO2019010617A1 (zh) * 2017-07-10 2019-01-17 北京小米移动软件有限公司 数据传输方法及装置、接收端设备和发送端设备
CN110366258B (zh) * 2018-04-09 2021-08-31 华为技术有限公司 一种数据传输的方法、相关设备及通信系统
WO2020019298A1 (zh) * 2018-07-27 2020-01-30 华为技术有限公司 信号传输的方法和装置
CN111835457B (zh) * 2019-08-09 2022-04-26 维沃移动通信有限公司 一种数据传输方法、接收设备及发送设备
CN112068997B (zh) * 2020-09-09 2023-12-19 恒生电子股份有限公司 数据备份方法、装置、设备及存储介质
WO2023097180A1 (en) * 2021-11-23 2023-06-01 Qualcomm Incorporated Modifying modem timers based on jitter timing associated with an application
CN114443095A (zh) * 2022-01-21 2022-05-06 佛山市钒音科技有限公司 空调器升级方法、空调器

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1529437A (zh) * 2003-10-17 2004-09-15 中兴通讯股份有限公司 Wcdma系统无线网络控制层的流量控制方法
US20060182057A1 (en) * 2005-02-15 2006-08-17 Jakob Singvall Receive window updates in communication systems

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101000699B1 (ko) * 2004-04-19 2010-12-10 엘지전자 주식회사 무선링크 제어계층에서의 데이터 처리방법
CN101388826B (zh) * 2007-09-10 2011-02-02 鼎桥通信技术有限公司 一种发送重排缓存区信息的方法及装置

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1529437A (zh) * 2003-10-17 2004-09-15 中兴通讯股份有限公司 Wcdma系统无线网络控制层的流量控制方法
US20060182057A1 (en) * 2005-02-15 2006-08-17 Jakob Singvall Receive window updates in communication systems

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016033948A1 (zh) * 2014-09-02 2016-03-10 中兴通讯股份有限公司 一种发送窗口流量控制方法和终端

Also Published As

Publication number Publication date
CN103457707B (zh) 2016-12-14
CN103457707A (zh) 2013-12-18

Similar Documents

Publication Publication Date Title
WO2013178044A1 (zh) 一种数据传输方法、装置及系统
CN108541360B (zh) 通信系统
US8165596B2 (en) Data transmission method and data re-transmission method
US8897149B2 (en) Method and a transceiver for HARQ failure detection
EP2420014B1 (en) Method of receiving a point-to-multipoint service in a wireless communication system
US20160366008A1 (en) Data retransmission method and apparatus
CN110268657B (zh) 用于监视无线电通信的技术
US8738984B2 (en) Apparatus for processing retransmission failure in radio link control (RLC) layer
WO2010075706A1 (zh) 基于时分双工系统的混合自动重传请求的实现方法和装置
EP2016503A2 (en) Method and apparatus for reduced data block transmission in an automatic repeat request system
JP5486013B2 (ja) 通信ネットワーク内で非同期のユーザ機器へデータをダウンリンク送信するシステム及び方法
WO2015192322A1 (zh) 无线资源调度方法及装置
US20100122136A1 (en) Method and apparatus for reduced data block transmission in an automatic repeat request system
WO2018082582A1 (zh) 一种数据传输方法及装置、计算机存储介质
WO2010091602A1 (zh) 一种用于调整移动台睡眠模式的方法及装置
US11855787B2 (en) Apparatus and method for transmitting feedback information in wireless communication systems
WO2012100670A1 (zh) 一种数据包的重传方法及装置
US9037936B2 (en) Apparatus and method for generating MAC protocol data unit in wireless communication system
JP4817077B2 (ja) 無線lan通信システム
KR20100135042A (ko) 무선통신시스템에서 타이머 보상을 통한 데이터 관리방법 및 장치
KR100972166B1 (ko) 무선통신 시스템에서의 프로토콜데이터유닛 순서정렬 방법 및 이를 수행하는 단말
EP3490182B1 (en) Hybrid automatic repeat request method and system
CN107801200B (zh) 状态报告的发送方法及装置
WO2015161791A1 (zh) 一种rlc层的数据包处理方法和rlc实体
WO2012065525A1 (zh) 混合自动重传请求的传输方法和装置

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: 13796978

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: 13796978

Country of ref document: EP

Kind code of ref document: A1