WO2017206763A1 - 一种终端设备及数据处理方法、存储介质 - Google Patents

一种终端设备及数据处理方法、存储介质 Download PDF

Info

Publication number
WO2017206763A1
WO2017206763A1 PCT/CN2017/085483 CN2017085483W WO2017206763A1 WO 2017206763 A1 WO2017206763 A1 WO 2017206763A1 CN 2017085483 W CN2017085483 W CN 2017085483W WO 2017206763 A1 WO2017206763 A1 WO 2017206763A1
Authority
WO
WIPO (PCT)
Prior art keywords
data packet
expected value
data
packet
sequence identifier
Prior art date
Application number
PCT/CN2017/085483
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 WO2017206763A1 publication Critical patent/WO2017206763A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M11/00—Telephonic communication systems specially adapted for combination with other electrical systems
    • H04M11/06—Simultaneous speech and data transmission, e.g. telegraphic transmission over the same conductors
    • H04M11/062—Simultaneous speech and data transmission, e.g. telegraphic transmission over the same conductors using different frequency bands for speech and other data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames

Definitions

  • the present invention relates to the field of communications, and in particular, to a terminal device, a data processing method, and a storage medium.
  • a common method is to insert an LTE (Chang LTE) on the CPE. , long-term evolution technology) network card, etc., wirelessly expand the bandwidth of the cable; this support simultaneously carries multiple links uplink (through multiple communication links to download data streams from content providers such as operators) CPE, When multiple link uplinks work at the same time, because the channel quality and bandwidth of each link are different, packets of the same data stream of different links will appear, and the CPE will arrive in disorder, which is reduced to some extent. User experience.
  • LTE Long-term evolution technology
  • a data stream-based equalization algorithm is provided, that is, the same data stream is transmitted through the same link, so that the out-of-order condition can be avoided or reduced; however, for this data stream, Multi-link bandwidth sharing cannot be achieved, which affects download speed.
  • the embodiment of the invention provides a terminal device, a data processing method and a storage medium, so as to solve the problem that the existing equalization algorithm cannot achieve the same data stream sharing the multi-link bandwidth.
  • a data processing method for a terminal device including:
  • the data packet is processed according to the matching result.
  • the processing, by the matching result, the data packet including: sending the data packet when a sequence identifier of the data packet matches an expected value;
  • the packet is cached to the cache queue.
  • the obtaining the sequence identifier of the received data packet includes: extracting a sequence number carried by the data packet, and using the sequence number as the sequence identifier; the matching with the expected value includes: comparing the Whether the serial number of the data packet is the same as the serial number within the expected value. If they are the same, they match, otherwise they do not match.
  • the method further includes: calculating a new expected value according to the serial number of the data packet; and modifying the expected value to the new expected value.
  • the method further includes: if the buffer queue caches a data packet, using the expected value to match the data packet in the cache queue; and sending the matched data packet.
  • the method further includes: when the buffer queue caches multiple data packets, sorting according to the sequence identifier of each data packet.
  • the method further includes: when the buffer queue starts to buffer the data packet, activating a timer; and calculating a minimum value of the delay difference between the at least two communication links;
  • the timer is ended; all data packets in the buffer queue are sent.
  • the embodiment of the present invention further provides a terminal device, including: a communication module and a finishing module configured with at least two communication links, where
  • the communication module is configured to receive different data packets of the same data stream through at least two communication links;
  • the arranging module is configured to obtain a sequence identifier of the received data packet, and match the expected value to obtain a matching result; and process the data packet according to the matching result.
  • the communication module is configured to send the data packet to another user equipment through the communication module when the sequence identifier of the data packet matches the expected value; when the sequence identifier of the data packet does not match the expected value , cache the packet to the cache queue.
  • the collating module is configured to extract a serial number carried by the data packet, and use the serial number as the sequence identifier; compare whether a serial number of the data packet is a serial number within the expected value Same, if they are the same, match, otherwise they will not match.
  • the collating module is further configured to calculate a new expected value according to the serial number of the data packet; and modify the expected value to the new expected value.
  • the collating module is further configured to: if the cache queue caches a data packet, use the expected value to match the data packet in the cache queue; and send the matched data packet.
  • the collating module is further configured to perform sorting according to the sequence identifier of each data packet when the buffer queue caches multiple data packets.
  • the collating module is further configured to activate a timer when the buffer queue starts to buffer a data packet
  • an embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute the foregoing data processing method for the terminal device.
  • Embodiments of the present invention provide a terminal device, a data processing method, and a storage medium, which receive different data packets of the same data stream through at least two communication links, and sequence the received data packets.
  • the identifier matches the expected value.
  • the data packet is sent out.
  • the sequence identifier of the data packet does not match the expected value, the data packet is buffered to the cache queue, and the scheme can make
  • the CPE receives the data packet of the same data stream through multiple communication links.
  • the CPE determines the location of the data packet according to the sequence identifier of the data packet, and determines whether the data packet is needed according to the expected value.
  • the data packet sent to the user terminal if yes, the data packet is sent out, otherwise it is cached, so that the effect of sorting out the out-of-order data packets arriving at the CPE can be achieved, and the multi-link bandwidth is shared by the same data stream.
  • the order of the data packets is guaranteed to the greatest extent, and the existing equalization algorithm cannot solve the same data. Shared multi-link bandwidth issues, and enhance the user experience.
  • FIG. 1 is a flowchart of a data processing method according to a first embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a terminal device according to a second embodiment of the present invention.
  • Figure 3 is a schematic diagram of a communication system in a third embodiment of the present invention.
  • FIG. 1 is a flowchart of a data processing method according to a first embodiment of the present invention. As shown in FIG. 1, in the embodiment, the data processing method provided by the present invention includes:
  • S101 Receive different data packets of the same data stream by using at least two communication links;
  • each link needs to transmit up to 5000 data packets, and the transmission time will be much shorter than that.
  • the transmission time required for a link to transmit 10,000 data packets, that is, when the same data stream is transmitted over multiple links, the bandwidth of these links can be shared;
  • S102 Obtain a sequence identifier of the received data packet, and match the expected value to obtain a matching result.
  • the sequence identifier is used to identify the location of the data packet in the data stream. It can be identified by commonly used Arabic numerals, such as 1 to 10000, or by binary values.
  • the expected value is the sequence identifier of the data packet that the CPE wishes to receive. For example, at time T1, the CPE receives the 200th data packet (the sequence identifier of the data packet is 200), then after receiving the 200th data packet, The expected value is 201, that is, the CPE wants to receive the 201st data packet (the sequence ID of the data packet is 201).
  • the CPE receives a new data packet, obtains its sequence identifier, and compares it with the expected value. If the same, the match succeeds, otherwise the match fails.
  • the data packet is sent out; at time T1, the expected value is set to 201, and at time T2, if the CPE receives the data packet The sequence ID is 201, and the match is successful, and the data packet is directly sent out.
  • the expected value is set to 201.
  • the match fails and the packet is cached in the cache queue.
  • the data processing method is applied to the terminal device, and therefore the operations described in the foregoing steps 101, 102, and 103 are performed by the CPE.
  • the CPE can receive the data packet of the same data stream through multiple communication links.
  • the CPE determines the location of the data packet according to the sequence identifier of the data packet, and then determines the location according to the expected value. Whether the data packet is a data packet that needs to be sent to the user terminal, and if so, the data packet is sent out, otherwise it is cached, so that the effect of sorting out the out-of-order data packets arriving at the CPE can be achieved, and the same data stream is shared.
  • the order of the data packets is guaranteed to the greatest extent.
  • the obtaining the sequence identifier of the received data packet in the foregoing embodiment includes: extracting a sequence number carried by the data packet, and using the sequence number as a sequence identifier; matching the expected value includes: comparing the sequence number of the data packet Whether it is the same as the serial number in the expected value. If they are the same, they match, otherwise they do not match.
  • This embodiment provides a specific implementation manner of the sequence identifier, which can implement the sorting of the out-of-order data packets by using the serial number in the existing data packet, and does not need to modify the structure of the existing data packet, and enhances the present invention. The versatility of the invention.
  • the method in the foregoing embodiment further includes: calculating a new expected value according to the serial number of the data packet; and modifying the expected value to a new expected value.
  • the method in the above embodiment further includes: if the buffer queue caches a data packet, matching the data packet in the cache queue with an expected value: sending the matched data packet.
  • This embodiment provides a forwarding mode of the data packet in the cache queue. For example, at time T2, if the sequence identifier of the data packet received by the CPE is 202, the matching fails, and the data packet is cached in the cache queue at T3. At the moment, if the sequence identifier of the data packet received by the CPE is 201, after the packet is sent out, the expected value is updated to 202. At this time, the expected value 202 is used to match the data packet in the cache queue, and the sequence identifier is matched to 202. The packet is then sent out.
  • the method in the foregoing embodiment further includes: when the buffer queue caches multiple data packets, sorting according to the sequence identifier of each data packet.
  • This embodiment provides a sorting manner of data packets in the cache queue. For example, at time T2, if the sequence identifier of the data packet received by the CPE is 202, the matching fails, and the data packet is cached in the cache queue at time T3. If the sequence identifier of the data packet received by the CPE is 205, the matching fails, and the data packet is buffered to the buffer queue. At the time T4, if the sequence identifier of the data packet received by the CPE is 204, the matching fails, and the data packet is obtained.
  • the order of the data packets in the cache queue is: the data packet with the sequence identifier 202, the data packet with the sequence identifier 204, and the sequence identifier is 205.
  • the data packet for example, at time T5, if the sequence identifier of the data packet received by the CPE is 201, the matching is successful, the data packet is sent to the user terminal, and then the expected value is updated to 202, and the sequence identifier is matched in the cache queue.
  • the data packet of 202 is sent to the user terminal, and the expected value of the update is 203. In this case, only the data packet with the sequence identifier of 204 needs to be matched. Even if the matching fails, the data packet with the sequence identifier 205 does not need to be matched.
  • the method in the above embodiment further includes: when the buffer queue starts to buffer the data packet, activating a timer; calculating a minimum value of the delay difference between the at least two communication links; When the duration of the timer is equal to the minimum value, the timer ends; the buffer will be cached All packets in the queue are sent out.
  • the delay of each communication link is a time difference between when the terminal device sends a data packet to the other device through the link, and then receives another device to return the data packet through the link;
  • the delay difference is
  • the delay difference is the minimum of
  • RTT Real-Trip Time
  • the latency experienced, the RTT is determined by three parts: the propagation time of the link, the processing time of the end system, and the queuing and processing time in the router's cache.
  • the value of the first two parts is relatively fixed as a TCP connection, and the queuing and processing time in the cache of the router changes with the degree of congestion of the entire network, so the change of the RTT reflects the degree of network congestion to a certain extent. Variety.
  • the communication protocol specifies the RTT difference threshold.
  • this parameter is to break the LTE link back to a single DSL link when the RTT difference between the two links is greater than this threshold. Therefore, this embodiment dynamically implements the longest packet waiting time by the RTT difference threshold value, that is, the longest waiting time is guaranteed (so that the maximum number of data packets are sorted according to the serial number), The CPE will not be disconnected, and the timeliness and orderlines of the packets are guaranteed to the greatest extent.
  • the terminal device provided by the present invention includes: a communication module 21 provided with at least two communication links and a finishing Module 22, wherein
  • the communication module 21 is configured to receive different data packets of the same data stream through at least two communication links;
  • the collating module 22 is configured to obtain a sequence identifier of the received data packet, and match the expected value to obtain a matching result; and process the data packet according to the matching result.
  • the data packet when the sequence identifier of the data packet matches the expected value, the data packet is sent to the user equipment through the communication module 21; when the sequence identifier of the data packet does not match the expected value, the data packet is buffered to the cache queue.
  • the collating module 22 in the foregoing embodiment is configured to extract a serial number carried by the data packet, and use the serial number as a sequence identifier, and compare whether the serial number of the data packet is the same as the serial number in the expected value. , then match, otherwise it does not match.
  • the collating module 22 in the above embodiment after transmitting the data packet, is further configured to calculate a new expected value according to the serial number of the data packet; and modify the expected value to a new expected value.
  • the collating module 22 in the above embodiment is further configured to: if the cache queue caches a data packet, match the data packet in the cache queue with an expected value: send the matched data packet.
  • the collating module 22 in the above embodiment is further configured to perform sorting according to the sequence identifier of each data packet when the buffer queue caches multiple data packets.
  • the collating module 22 in the foregoing embodiment is further configured to: when the buffer queue starts to buffer the data packet, activate a timer; calculate a minimum value of the delay difference between the at least two communication links; When the duration of the timer is equal to the minimum value, the timer is ended; all data packets in the buffer queue are sent out.
  • the delay of each communication link is a time difference between when the terminal device sends a data packet to the other device through the link, and then receives another device to return the data packet through the link;
  • the delay of the first communication link is t1, the second communication The delay of the link is t2, and the delay difference is
  • the delay difference is
  • the embodiment of the present invention provides a communication system, including: at least one terminal device provided by the embodiment of the present invention.
  • the present embodiment provides a method for determining the queue length by using the link RTT difference threshold, and combining the Sequence Number in the data packet header to implement message order preservation, and the effect is much better.
  • Step 1 the protocol specifies that the first packet of the data is a DHCP (Dynamic Host Configuration Protocol) OFFER message.
  • the sequence number of the packet is used as the starting value.
  • the algorithm records the value as the current value and the current value. Add 1 to the expected value, representing the Sequence Number of the next packet;
  • Step 2 When the next packet is received, if the Sequence Number is the expected value, the packet can be directly sent out, not cached in the queue, and the current Sequence Number is set to the current value, and the expected value continues to be the current value. plus 1;
  • Step 3 Check the cache queue to see if the first packet in the cache queue is the expected value. If yes, the packet is sent, the Sequence Number is set to the current value, and the expected value continues to be the current value. Add 1 to the value and repeat step 3 until there are no packages in the queue.
  • Step 4 Check the cache queue to see if the first packet in the cache queue is the expected value. If not, exit the check.
  • Step 5 when the next packet is received, if the Sequence Number is not the expected value, the position placed in the queue is determined in the order of Sequence Number.
  • Step 6 When there is a first packet buffer in the queue, the RTT difference threshold is used as the timer length. After the timer expires, whether the packet in the queue is continuous or not, it must be sent once.
  • the existing technology generally has a fixed receiving queue length. When the queue is full, it is sent once; or an ordinary time timer, which receives a certain time packet and sends it out once.
  • the two schemes of determining the length of the buffer queue and the sequence number of the packet are combined to ensure the timeliness and orderlines of the packet to the greatest extent.
  • Step A The device starts working.
  • the current value of the Sequence Number is 1.
  • the link 1 receives the packet.
  • the sequence number of the received packet is 2.
  • the packet is sent directly. Continue to receive the packet whose Sequence Number is 3, or send it directly.
  • Step B Link 2 receives a packet whose sequence number is 4, or sends it directly. Steps 1 and 2 do not cause the queue to have a buffered message.
  • Step C and step D describe that the RTT difference between the two links is large and starts to be out of order, but the out-of-order is not very serious;
  • Step C The user equipment continues to work.
  • the current value of the Sequence Number is 60.
  • the link 1 receives a packet with a Sequence Number of 62. At this time, the packet needs to be cached in the queue, and the timer is the timer.
  • Link RTT difference threshold link 1 received again
  • the Sequence Number is a 63 packet that must be cached in the queue.
  • Step D Link 2 receives a packet at this time, and the Sequence Number is 61. After the device finds that the packet is received, since the current value is 60, the packet needs to be sent out immediately, and the queue is checked, and 62 and 63 are found. The message needs to be sent out immediately. At this time, the timer expires, and all the packets in the queue need to be sent out. Since there are no packages in the queue, no packets are sent.
  • Step E and step F describe that the RTT difference between the two links is large, the out-of-order condition is serious, and even some packets have been dropped. ;
  • Step E The user equipment continues to work.
  • the current value of the Sequence Number is 100.
  • the link 1 receives a packet with a Sequence Number of 102. At this time, the packet needs to be cached in the queue.
  • the timer is the timer.
  • the RTT difference threshold of the link, Link 1 receives the packets with the Sequence Number of 103 and 105, which must be cached in the queue.
  • Step F Link 2 receives a packet at this time, the Sequence Number is 104, inserts the packet between the queues 103 and 104, and continues to wait for 101. At this point, the timer expires, 101 still does not arrive, check the queue, you need to send all the packets 102, 103, 104, 105.
  • the embodiment of the present invention provides a terminal device and a data processing method, which receive different data packets of the same data stream through at least two communication links, and match the sequence identifier of the received data packet with an expected value to obtain a matching result. And processing the data packet according to the matching result.
  • the sequence identifier of the data packet matches the expected value, the data packet is sent out, and when the sequence identifier of the data packet does not match the expected value, the data packet is buffered to the buffer queue, and the scheme can make the CPE pass multiple communication links.
  • the CPE determines the location of the data packet according to the sequence identifier of the data packet, and determines whether the data packet is a data packet that needs to be sent to the user terminal according to the expected value. If Yes, the data packet is sent out, otherwise it is cached, so that the effect of sorting out the out-of-order packets arriving at the CPE can be achieved, and the same data stream is shared with the multi-link bandwidth, and the maximum guarantee is also ensured.
  • the order of the data packet solves the problem that the existing equalization algorithm cannot achieve the same data stream sharing the multi-link bandwidth, and enhances the user experience.
  • the longest waiting time is dynamically realized, that is, the longest waiting time is guaranteed (so that the maximum number of packets is guaranteed to be in sequence).
  • the sorting of the number does not cause the CPE to disconnect the link, ensuring the timeliness and orderliness of the message to the greatest extent.
  • the communication module and the arranging module in the terminal device provided in the embodiment of the present invention may be implemented by a processor, and may also be implemented by a specific logic circuit; wherein the processor may be a server located on the terminal device.
  • the processor can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA).
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • the embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores a computer program, and the computer program is used to execute the data processing method of the embodiment of the present invention.
  • the terminal device receives different data packets of the same data stream through at least two communication links; acquires the sequence identifier of the received data packet, and matches the expected value to obtain a matching result. And processing the data packet according to the matching result. In this way, the order of the data packets can be ensured to the greatest extent while ensuring that the same data stream shares the multi-link bandwidth.

Landscapes

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

Abstract

本发明实施例提供了一种终端设备及数据处理方法、存储介质，该方法包括：通过至少两个通信链路接收同一数据流的不同数据包；获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；根据所述匹配结果对所述数据包进行处理。本发明实施例可以实现对到达CPE的乱序数据包进行排序的效果，在保证同一数据流共用多链路带宽的同时，也最大程度上保证了数据包的有序性，解决了现有均衡算法不能实现同一数据流共用多链路带宽的问题，增强了用户的使用体验。

Description

一种终端设备及数据处理方法、存储介质
相关申请的交叉引用
本申请基于申请号为201610383966.7、申请日为2016年06月01日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本发明涉及通信领域，尤其涉及一种终端设备及数据处理方法、存储介质。
背景技术
为了解决CPE(Customer Premises Equipment，用户终端设备)的带宽受到DSL(Digital Subscriber Line，数字用户线)限制，也为了扩展带宽，目前有一种比较常见的方式就是在CPE上插一个LTE(Long Term Evolution，长期演进技术)网卡等，通过无线的方式扩展有线的带宽；这种支持同时承载多种链路上行(通过多个通信链路从运营商等内容提供商下载数据流)方式的CPE，在多种链路上行同时工作的时候，由于各链路的信道质量及带宽不尽相同，就会出现走不同链路的同一个数据流的数据包，乱序到达CPE，在一定程度上降低了用户的使用体验。
在现有技术中，为了解决这个乱序问题，提供了基于数据流的均衡算法，即同一数据流通过同一链路传输，这样就可以避免或降低乱序状况；但是，针对这个数据流，就不能实现多链路带宽共用，影响下载速度。
发明内容
本发明实施例提供了一种终端设备及数据处理方法、存储介质，以解决现有均衡算法不能实现同一数据流共用多链路带宽的问题。
一方面，提供了一种用于终端设备的数据处理方法，其包括：
通过至少两个通信链路接收同一数据流的不同数据包；
获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；
根据所述匹配结果对所述数据包进行处理。
上述方案中，所述根据所述匹配结果对所述数据包进行处理，包括：当数据包的顺序标识与预期值匹配时，发送所述数据包；
当数据包的顺序标识与预期值不匹配时，将数据包缓存至缓存队列。
上述方案中，所述获取接收到的数据包的顺序标识包括：提取所述数据包携带的序列号，将所述序列号作为所述顺序标识；所述与预期值进行匹配包括：比较所述数据包的序列号是否与所述预期值内的序列号相同，若相同，则匹配，否则不匹配。
上述方案中，在发送所述数据包之后，所述方法还包括：根据所述数据包的序列号计算新预期值；将所述预期值修改为所述新预期值。
上述方案中，所述方法还包括：若所述缓存队列缓存有数据包，使用所述预期值在所述缓存队列中匹配数据包；发送匹配到的数据包。
上述方案中，所述方法还包括：当所述缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。
上述方案中，所述方法还包括：在所述缓存队列开始缓存数据包时，激活计时器；计算所述至少两个通信链路之间时延差值的最小值；
在所述计时器的时长等于所述最小值时，结束计时器；发送所述缓存队列内所有的数据包。
一方面，本发明实施例还提供了一种终端设备，其包括：设置有至少两个通信链路的通信模块和整理模块，其中，
所述通信模块，配置为通过至少两个通信链路接收同一数据流的不同数据包；
所述整理模块，配置为获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；根据所述匹配结果对所述数据包进行处理。
上述方案中，所述通信模块，配置为当所述数据包的顺序标识与预期值匹配时，将数据包通过通信模块发送至另一用户设备；当数据包的顺序标识与预期值不匹配时，将数据包缓存至缓存队列。
上述方案中，所述整理模块，配置为提取所述数据包携带的序列号，将所述序列号作为所述顺序标识；比较所述数据包的序列号是否与所述预期值内的序列号相同，若相同，则匹配，否则不匹配。
上述方案中，所述整理模块，在发送所述数据包之后，还配置为根据所述数据包的序列号计算新预期值；将所述预期值修改为所述新预期值。
上述方案中，所述整理模块，还配置为若所述缓存队列缓存有数据包，使用所述预期值在所述缓存队列中匹配数据包；发送匹配到的数据包。
上述方案中，所述整理模块，还配置为当所述缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。
上述方案中，所述整理模块，还配置为在所述缓存队列开始缓存数据包时，激活计时器；
计算所述至少两个通信链路之间时延差值的最小值；
在所述计时器的时长等于所述最小值时，结束计时器；
发送所述缓存队列内所有的数据包。
另一方面，本发明实施例还提供了一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，计算机可执行指令用于执行前述的用于终端设备的数据处理方法。
本发明实施例的有益效果：本发明实施例提供了一种终端设备及数据处理方法、存储介质，通过至少两个通信链路接收同一数据流的不同数据包，将接收到的数据包的顺序标识与预期值进行匹配，当数据包的顺序标识与预期值匹配时，将数据包发送出去，当数据包的顺序标识与预期值不匹配时，将数据包缓存至缓存队列，该方案可以使得CPE通过多个通信链路接收同一数据流的数据包，CPE在接收到数据包时，根据数据包的顺序标识来确定其在数据流内的位置，进而根据预期值判断该数据包是否就是需要发送给用户终端的数据包，若是，则将数据包发送出去，否则就缓存起来，这样就可以实现对到达CPE的乱序数据包进行排序的效果，在保证同一数据流共用多链路带宽的同时，也最大程度上保证了数据包的有序性，解决了现有均衡算法不能实现同一数据流共用多链路带宽的问题，增强了用户的使用体验。
附图说明
图1为本发明第一实施例提供的数据处理方法的流程图；
图2为本发明第二实施例提供的终端设备的结构示意图；
图3是本发明第三实施例中的通信系统的示意图。
具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例只是本发明中一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的 范围。
现通过具体实施方式结合附图的方式对本发明做出进一步的诠释说明。
第一实施例：
图1为本发明第一实施例提供的数据处理方法的流程图，由图1可知，在本实施例中，本发明提供的数据处理方法包括：
S101：通过至少两个通信链路接收同一数据流的不同数据包；
如一个业务的数据流包括10000个数据包，这些数据包通过2个及以上数量的通信链路进行传输时，每个链路最多进需要传输5000个数据包，其传输时间将远远短于一个链路传输10000个数据包需要的传输时间，即同一数据流通过多个链路传输时，可以共用这些链路的带宽；
S102：获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；
顺序标识是用于标识数据包在数据流中位置的标识，可以采用常用的阿拉伯数字，如1至10000进行标识，也可以采用二进制数值等方式进行区分。
预期值是至CPE希望接收到的数据包的顺序标识，例如在T1时刻，CPE接收到第200个数据包(该数据包的顺序标识为200)，那么在接收到第200个数据包之后，预期值就是201，即CPE希望接收到第201个数据包(该数据包的顺序标识为201)。
在T2时刻，CPE接收到一个新的数据包，获取其顺序标识，并与预期值进行对比，若相同，则匹配成功，否则匹配失败。
S103：根据所述匹配结果对所述数据包进行处理；
具体地，当数据包的顺序标识与预期值匹配时，将数据包发送出去；在T1时刻，预期值被设置为201，在T2时刻，如果CPE接收到的数据包 的顺序标识为201，则匹配成功，直接将这个数据包发送出去。
在T1时刻，预期值被设置为201，在T2时刻，如果CPE接收到的数据包的顺序标识为202，则匹配失败，将这个数据包缓存到缓存队列。
本发明实施例中，所述数据处理方法应用于终端设备，因此上述步骤101、步骤102及步骤103所述的操作均由CPE执行。
本实施例可以使得CPE通过多个通信链路接收同一数据流的数据包，CPE在接收到数据包时，根据数据包的顺序标识来确定其在数据流内的位置，进而根据预期值判断该数据包是否就是需要发送给用户终端的数据包，若是，则将数据包发送出去，否则就缓存起来，这样就可以实现对到达CPE的乱序数据包进行排序的效果，在保证同一数据流共用多链路带宽的同时，也最大程度上保证了数据包的有序性。
在一些实施例中，上述实施例中的获取接收到的数据包的顺序标识包括：提取数据包携带的序列号，将序列号作为顺序标识；与预期值进行匹配包括：比较数据包的序列号是否与预期值内的序列号相同，若相同，则匹配，否则不匹配。本实施例提供一种顺序标识的具体实现方式，该方式采用现有数据包内的序列号即可实现对乱序数据包的排序，不需要对现有数据包的结构进行修改，增强了本发明的通用性。
在一些实施例中，上述实施例中的方法在将数据包发送出去之后，还包括：根据数据包的序列号计算新预期值；将预期值修改为新预期值。本实施例提供了预期值的计算方式，承接上述假设，在T2时刻，如果CPE接收到的数据包的顺序标识为201，则匹配成功，直接将这个数据包发送出去，然后计算新预期值为：201+1＝202，将原来的预期值201更新为新预期值202。
在一些实施例中，上述实施例中的方法还包括：若缓存队列缓存有数据包，使用预期值在缓存队列中匹配数据包：将匹配到的数据包发送出去。 本实施例提供了缓存队列内数据包的一种转发方式，例如，在T2时刻，如果CPE接收到的数据包的顺序标识为202，则匹配失败，将这个数据包缓存到缓存队列，在T3时刻，如果CPE接收到的数据包的顺序标识为201，则将其发送出去之后，更新预期值为202，此时使用预期值202在缓存队列中匹配数据包，将会匹配到顺序标识为202的数据包，然后将其发送出去。
在一些实施例中，上述实施例中的方法还包括：当缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。本实施例提供了缓存队列内数据包的一种排序方式，例如，在T2时刻，如果CPE接收到的数据包的顺序标识为202，匹配失败，将这个数据包缓存到缓存队列，在T3时刻，如果CPE接收到的数据包的顺序标识为205，匹配失败，将这个数据包缓存到缓存队列，在T4时刻，如果CPE接收到的数据包的顺序标识为204，匹配失败，将这个数据包缓存到缓存队列，此时需要根据各数据包的顺序标识进行排序，这样缓存队列内的数据包的顺序为：顺序标识为202的数据包、顺序标识为204的数据包、顺序标识为205的数据包；这样排序之后，若预期值与缓存队列内的第一个数据包匹配成功时，就可以快速的完成下一个数据包的匹配，因为不需要历遍缓存队列内所有的数据包，仅需要直接对匹配成功的数据包的下一个数据包进行匹配，即可完成检测缓存队列内是否存在与预期值匹配的数据包，例如，在T5时刻，如果CPE接收到的数据包的顺序标识为201，匹配成功，将数据包发送到用户终端，然后更新预期值为202，在缓存队列内匹配到顺序标识为202的数据包，发送到用户终端，更新预期值为203，此时仅需要匹配顺序标识为204的数据包，即便匹配失败，也不需要对顺序标识为205的数据包进行匹配。
在一些实施例中，上述实施例中的方法还包括：在缓存队列开始缓存数据包时，激活计时器；计算所述至少两个通信链路之间时延差值的最小值；在所述计时器的时长等于所述最小值时，结束计时器；将缓存 队列内所有的数据包发送出去。
这里，每个通信链路的时延为终端设备通过该链路发送一数据包至另一设备后，再接收到另一设备通过该链路返回该数据包之间的时间差；在所述通信链路有两条时，若所述第一通信链路的时延为t1，所述第二通信链路的时延为t2，则所述时延差值为|t1-t2|；在所述通信链路有三条时，若所述第一通信链路的时延为t1，所述第二通信链路的时延为t2，所述第二通信链路的时延为t3；则所述时延差值为|t1-t2|、|t3-t2|、|t1-t3|三者中的最小值；
RTT(Round-Trip Time，往返时延)，是一个重要的性能指标，表示从发送端发送数据开始，到发送端收到来自接收端的确认(接收端收到数据后便立即发送确认)，总共经历的时延，RTT由三个部分决定：即链路的传播时间、末端系统的处理时间以及路由器的缓存中的排队和处理时间。其中，前面两个部分的值作为一个TCP连接相对固定，路由器的缓存中的排队和处理时间会随着整个网络拥塞程度的变化而变化，所以RTT的变化在一定程度上反映了网络拥塞程度的变化。通信协议规定了RTT差值阀值这个参数，这个参数的目的是当两条链路的RTT的差值大于这个阀值，会断掉LTE链路，回到单一的DSL链路。因此本实施例通过RTT差值阀值这个时间来动态实现最长的收包等待时间，即保证了最长的等待时间(这样就可以保证最多数量的数据包是按照序列号排序的)，也不会使得CPE断开链路，最大程度的保证了报文的及时性及有序性。
第二实施例：
图2为本发明第二实施例提供的终端设备的结构示意图，由图2可知，在本实施例中，本发明提供的终端设备包括：设置有至少两个通信链路的通信模块21和整理模块22，其中，
所述通信模块21，配置为通过至少两个通信链路接收同一数据流的不同数据包；
所述整理模块22，配置为获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；根据所述匹配结果对所述数据包进行处理。
在一实施例中，当数据包的顺序标识与预期值匹配时，将数据包通过通信模块21发送至用户设备；当数据包的顺序标识与预期值不匹配时，将数据包缓存至缓存队列。
在一些实施例中，上述实施例中的整理模块22，配置为提取数据包携带的序列号，将序列号作为顺序标识，比较数据包的序列号是否与预期值内的序列号相同，若相同，则匹配，否则不匹配。
在一些实施例中，上述实施例中的整理模块22，在将数据包发送出去之后，还配置为根据数据包的序列号计算新预期值；将预期值修改为新预期值。
在一些实施例中，上述实施例中的整理模块22，还配置为若缓存队列缓存有数据包，使用预期值在缓存队列中匹配数据包：将匹配到的数据包发送出去。
在一些实施例中，上述实施例中的整理模块22，还配置为当缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。
在一些实施例中，上述实施例中的整理模块22，还配置为在缓存队列开始缓存数据包时，激活计时器；计算所述至少两个通信链路之间时延差值的最小值；在所述计时器的时长等于所述最小值时，结束计时器；将缓存队列内所有的数据包发送出去。
这里，每个通信链路的时延为终端设备通过该链路发送一数据包至另一设备后，再接收到另一设备通过该链路返回该数据包之间的时间差；在所述通信链路有两条时，若所述第一通信链路的时延为t1，所述第二通信 链路的时延为t2，则所述时延差值为|t1-t2|；在所述通信链路有三条时，若所述第一通信链路的时延为t1，所述第二通信链路的时延为t2，所述第二通信链路的时延为t3；则所述时延差值为|t1-t2|、|t3-t2|、|t1-t3|三者中的最小值；
对应的，本发明实施例提供了一种通信系统，包括：至少一个本发明实施例提供的终端设备。
第三实施例：
现结合具体应用场景对本发明做进一步的诠释说明。
支持同时承载多种链路上行(通过多个通信链路从运营商等内容提供商下载数据流)方式的CPE，在多种链路上行同时工作的时候，由于各链路的信道质量及带宽不尽相同，就会出现走不同链路的同一个数据流的数据包，乱序到达CPE，在一定程度上降低了用户的使用体验。为了解决这样问题，而本实施例提供了一种通过链路RTT差阀值来确定队列长度，同时结合数据包头里面的Sequence Number(序列号)来实现报文保序，效果会好很多。
具体的，本实施例提供的方案如下：
步骤1、协议规定了数据的第一个包是DHCP(Dynamic Host Configuration Protocol，动态主机配置协议)OFFER报文，这个包的Sequence Number作为起始值，算法里面记录这个值作为当前值，当前值加1就是预期值，代表下一个包的Sequence Number；
步骤2、当接收到第下个包的时候，如果Sequence Number是预期值，这个包就可以直接发出，不在队列中进行缓存，并且将当前的Sequence Number设置为当前值，预期值继续是当前值加1；
步骤3、检查缓存队列，看缓存队列里面的第一个包是不是预期值，如果是，就发出这个包，Sequence Number设置为当前值，预期值继续是当前 值加1，重复步骤3，至到队列里面没有包；
步骤4、检查缓存队列看缓存队列里面的第一个包是不是预期值，如果不是，退出检查
步骤5、在步骤2中，当接收到第下个包的时候，如果Sequence Number不是预期值，按照Sequence Number顺序决定放入队列中的位置。
步骤6、当队列中有第一个包缓存的时候，就用RTT差值阀值作为定时器长度，定时器到期后，无论队列里面的包是不是连续的，都要一次发出。
现有的技术，一般都是固定收包队列长度，队列满了的情况下，一次发出；或者是普通的时间定时器，收一定时间的包，一次发出去。而本实施例结合了通过时间确定缓存队列长度和包的Sequence Number快速发包两个方案，最大程度的保证了报文的及时性及有序性。
在如图3所示的系统内，以用户通过CPE上网下载过程为例，详细描述本发明的实施方式。
步骤A和步骤B两条链路RTT差值较小而且没有乱序的情况：
步骤A：设备开始工作，Sequence Number当前值为1，链路1收包，收到包的Sequence Number是2，这个包直接发走，继续收到Sequence Number是3的包，还是直接发走
步骤B：链路2收到一个Sequence Number是4的包，还是直接发走，步骤1和步骤2都没有导致队列有缓存报文的现象。
步骤C和步骤D描述两条链路RTT差值较大，开始有乱序的情况，但是乱序不是很严重；
步骤C：用户端设备继续工作，Sequence Number当前值为60，链路1收到1个Sequence Number是62的包，此时报文需要缓存在队列里面，同时起定时器，定时器时间就是两条链路的RTT差值阀值，链路1又收到 Sequence Number是63的包，都必须缓存在队列里面。
步骤D：链路2这个时候收到了一个包，Sequence Number是61，设备发现收到这个包后，由于当前值是60，需要立刻将这个包发出去，同时检查队列，发现有62和63的报文，需要立刻发出去。这个时候定时器到期了，需要将队列里面的包全部发出，由于队列中没有包，所以就没有包发出了。
步骤E和步骤F描述两条链路RTT差值较大，乱序情况较严重，甚至有一些报文已经丢包了。；
步骤E：用户端设备继续工作，Sequence Number当前值为100，链路1收到1个Sequence Number是102的包，此时报文需要缓存在队列里面，同时起定时器，定时器时间就是两条链路的RTT差值阀值，链路1又收到Sequence Number是103和105的包，都必须缓存在队列里面。
步骤F：链路2这个时候收到了一个包，Sequence Number是104，将这个包插入到队列103和104包之间，继续等待101。此时定时器到期，101还是没有到达，检查队列，需要将102,103,104,105这些包全部发出。
由此便可以实现上网等业务流量，在乱序情况的动态保序。
综上可知，通过本发明实施例的实施，至少存在以下有益效果：
本发明实施例提供了一种终端设备及数据处理方法，通过至少两个通信链路接收同一数据流的不同数据包，将接收到的数据包的顺序标识与预期值进行匹配，，得到匹配结果；根据所述匹配结果对所述数据包进行处理。当数据包的顺序标识与预期值匹配时，将数据包发送出去，当数据包的顺序标识与预期值不匹配时，将数据包缓存至缓存队列，该方案可以使得CPE通过多个通信链路接收同一数据流的数据包，CPE在接收到数据包时，根据数据包的顺序标识来确定其在数据流内的位置，进而根据预期值判断该数据包是否就是需要发送给用户终端的数据包，若 是，则将数据包发送出去，否则就缓存起来，这样就可以实现对到达CPE的乱序数据包进行排序的效果，在保证同一数据流共用多链路带宽的同时，也最大程度上保证了数据包的有序性，解决了现有均衡算法不能实现同一数据流共用多链路带宽的问题，增强了用户的使用体验。
进一步的，通过将RTT差值阀值这个时间作为缓存队列的时长，来动态实现最长的收包等待时间，即保证了最长的等待时间(这样就可以保证最多数量的数据包是按照序列号排序的)，也不会使得CPE断开链路，最大程度的保证了报文的及时性及有序性。
本发明实施例中提出的终端设备中的所述通信模块和整理模块都可以通过处理器来实现，当然也可通过具体的逻辑电路实现；其中所述处理器可以是位于终端设备上的服务器，在实际应用中，处理器可以为中央处理器(CPU)、微处理器(MPU)、数字信号处理器(DSP)或现场可编程门阵列(FPGA)等。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用硬件实施例、软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功 能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
相应地，本发明实施例还提供一种计算机存储介质，该计算机存储介质中存储有计算机程序，该计算机程序用于执行本发明实施例的上述数据处理的方法。
以上仅是本发明的具体实施方式而已，并非对本发明做任何形式上的限制，凡是依据本发明的技术实质对以上实施方式所做的任意简单修改、等同变化、结合或修饰，均仍属于本发明技术方案的保护范围。
工业实用性
本发明实施例提供的数据处理方法，所述终端设备通过至少两个通信链路接收同一数据流的不同数据包；获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；根据所述匹配结果对所述数据包进行处理。如此，能够在保证同一数据流共用多链路带宽的同时，也最大程度上保证了数据包的有序性。

Claims (15)

  1. 一种用于终端设备的数据处理方法，包括：
    通过至少两个通信链路接收同一数据流的不同数据包；
    获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；
    根据所述匹配结果对所述数据包进行处理。
  2. 如权利要求1所述的方法，其中，所述根据所述匹配结果对所述数据包进行处理，包括：
    当所述数据包的顺序标识与所述预期值匹配时，发送所述数据包；
    当所述数据包的顺序标识与所述预期值不匹配时，将所述数据包缓存至缓存队列。
  3. 如权利要求2所述的方法，其中，所述获取接收到的数据包的顺序标识包括：
    提取所述数据包携带的序列号，将所述序列号作为所述顺序标识；
    所述与预期值进行匹配包括：比较所述数据包的序列号是否与所述预期值内的序列号相同，若相同，则匹配，否则不匹配。
  4. 如权利要求2所述的方法，其中，在发送所述数据包之后，所述方法还包括：
    根据所述数据包的序列号计算新预期值；
    将所述预期值修改为所述新预期值。
  5. 如权利要求1所述的方法，其中，所述方法还包括：
    若所述缓存队列缓存有数据包，使用所述预期值在所述缓存队列中匹配数据包；
    发送匹配到的数据包。
  6. 如权利要求1所述的方法，其中，所述方法还包括：
    当所述缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。
  7. 如权利要求1至6任一项所述的方法，其中，所述方法还包括：
    在所述缓存队列开始缓存数据包时，激活计时器；
    计算所述至少两个通信链路之间时延差值的最小值；
    在所述计时器的时长等于所述最小值时，结束计时器；
    发送所述缓存队列内所有的数据包。
  8. 一种终端设备，包括：设置有至少两个通信链路的通信模块和整理模块，其中，
    所述通信模块，配置为通过所述至少两个通信链路接收同一数据流的不同数据包；
    所述整理模块，配置为获取接收到的数据包的顺序标识，并与预期值进行匹配，得到匹配结果；根据所述匹配结果对所述数据包进行处理。
  9. 如权利要求8所述的终端设备，其中，所述通信模块，
    配置为当所述数据包的顺序标识与所述预期值匹配时，发送所述数据包；当所述数据包的顺序标识与所述预期值不匹配时，将所述数据包缓存至缓存队列。
  10. 如权利要求8所述的终端设备，其中，所述整理模块，配置为提取所述数据包携带的序列号，将所述序列号作为所述顺序标识；
    比较所述数据包的序列号是否与所述预期值内的序列号相同，若相同，则匹配，否则不匹配。
  11. 如权利要求8所述的终端设备，其中，所述整理模块，在发送所述数据包之后，还配置为根据所述数据包的序列号计算新预期值；将所述预期值修改为所述新预期值。
  12. 如权利要求8所述的终端设备，其中，所述整理模块，还配置 为若所述缓存队列缓存有数据包，使用所述预期值在所述缓存队列中匹配数据包；发送匹配到的数据包。
  13. 如权利要求8所述的终端设备，其中，所述整理模块，还配置为当所述缓存队列缓存有多个数据包时，根据各数据包的顺序标识进行排序。
  14. 如权利要求8至13任一项所述的终端设备，其中，所述整理模块，还配置为在所述缓存队列开始缓存数据包时，激活计时器；
    计算所述至少两个通信链路之间时延差值的最小值；
    在所述计时器的时长等于所述最小值时，结束计时器；
    发送所述缓存队列内所有的数据包。
  15. 一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，该计算机可执行指令用于执行权利要求1至7任一项所述的数据处理方法。
PCT/CN2017/085483 2016-06-01 2017-05-23 一种终端设备及数据处理方法、存储介质 WO2017206763A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610383966.7 2016-06-01
CN201610383966.7A CN107454276B (zh) 2016-06-01 2016-06-01 一种用户终端设备及其数据转发方法、及通信系统

Publications (1)

Publication Number Publication Date
WO2017206763A1 true WO2017206763A1 (zh) 2017-12-07

Family

ID=60479649

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/085483 WO2017206763A1 (zh) 2016-06-01 2017-05-23 一种终端设备及数据处理方法、存储介质

Country Status (2)

Country Link
CN (1) CN107454276B (zh)
WO (1) WO2017206763A1 (zh)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109257509B (zh) * 2017-07-14 2020-12-22 中国移动通信集团浙江有限公司 基于虚拟号码的通信方法、系统、服务器和存储介质
CN111163019B (zh) 2018-11-07 2022-10-28 中兴通讯股份有限公司 处理数据包的方法、装置和存储介质
CN111262721B (zh) * 2018-11-30 2021-06-15 贵州白山云科技股份有限公司 虚拟内网加速方法、系统、配置方法、装置、设备、介质
CN109818884A (zh) * 2019-02-01 2019-05-28 深圳市比速智网技术有限公司 多链路数据传输方法、发送装置、接收装置及存储介质
CN109802898B (zh) * 2019-02-01 2022-08-09 深圳市比速智网技术有限公司 多链路数据传输方法、接收装置及存储介质
CN109936514B (zh) * 2019-04-29 2022-06-21 新华三信息安全技术有限公司 一种报文处理方法和装置
CN112448898A (zh) * 2019-08-28 2021-03-05 无锡江南计算技术研究所 基于序列号机制的消息保序方法
EP4024789A4 (en) * 2019-09-16 2022-12-14 Huawei Technologies Co., Ltd. METHOD FOR DETECTING AN UNORDERED MESSAGE FLOW, METHOD FOR PROCESSING MESSAGES AND ASSOCIATED DEVICE
CN113328901B (zh) * 2020-02-28 2023-04-28 华为技术有限公司 报文乱序检测方法、装置及系统
CN112422669B (zh) * 2020-11-10 2022-08-12 济中节能技术（苏州）有限公司 一种多关联设备数据实时提取方法及相关装置
CN116686270A (zh) * 2021-01-08 2023-09-01 华为技术有限公司 一种数据包排序方法及装置
CN113895486B (zh) * 2021-10-14 2024-04-12 通号城市轨道交通技术有限公司 列车信息传输方法及装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101114991A (zh) * 2006-07-27 2008-01-30 北京南山之桥微电子有限公司 一种基于以太网实现数据流高速比对的方法
WO2012044945A1 (en) * 2010-10-01 2012-04-05 Interdigital Patent Holdings, Inc. Mac and rlc architecture and procedures to enable reception from multiple transmission points
US8761147B2 (en) * 2011-01-17 2014-06-24 Texas Instruments Incorporated Selective protection based on sequence numbers in coexisting networks
WO2014138131A1 (en) * 2013-03-08 2014-09-12 Qualcomm Incorporated Systems and methods for seamless data stream transfer during band switch between wireless stations
WO2015065914A1 (en) * 2013-10-30 2015-05-07 Qualcomm Incorporated Techniques for aggregating data from wwan and wlan
WO2016007478A1 (en) * 2014-07-08 2016-01-14 Intel Corporation Devices for packet system bearer splitting

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7315900B1 (en) * 2001-06-20 2008-01-01 Juniper Networks, Inc. Multi-link routing
CN101488841B (zh) * 2009-02-18 2013-03-27 中兴通讯股份有限公司 一种无线链路协议帧重传方法
CN101720107B (zh) * 2009-03-23 2013-05-29 上海通琅信息技术有限公司 无线多媒体传输的多路联合通信系统及方法
CN101917472B (zh) * 2010-08-12 2013-05-29 北京星网锐捷网络技术有限公司 一种多链路报文的重组方法、装置及设备
WO2012126424A2 (zh) * 2012-05-18 2012-09-27 华为技术有限公司 一种数据包的转发方法和设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101114991A (zh) * 2006-07-27 2008-01-30 北京南山之桥微电子有限公司 一种基于以太网实现数据流高速比对的方法
WO2012044945A1 (en) * 2010-10-01 2012-04-05 Interdigital Patent Holdings, Inc. Mac and rlc architecture and procedures to enable reception from multiple transmission points
US8761147B2 (en) * 2011-01-17 2014-06-24 Texas Instruments Incorporated Selective protection based on sequence numbers in coexisting networks
WO2014138131A1 (en) * 2013-03-08 2014-09-12 Qualcomm Incorporated Systems and methods for seamless data stream transfer during band switch between wireless stations
WO2015065914A1 (en) * 2013-10-30 2015-05-07 Qualcomm Incorporated Techniques for aggregating data from wwan and wlan
WO2016007478A1 (en) * 2014-07-08 2016-01-14 Intel Corporation Devices for packet system bearer splitting

Also Published As

Publication number Publication date
CN107454276A (zh) 2017-12-08
CN107454276B (zh) 2021-07-27

Similar Documents

Publication Publication Date Title
WO2017206763A1 (zh) 一种终端设备及数据处理方法、存储介质
US10694005B2 (en) Hardware-based packet forwarding for the transport layer
EP3761591B1 (en) Tcp link configuration method, apparatus, and computer program product
CN110022264B (zh) 控制网络拥塞的方法、接入设备和计算机可读存储介质
WO2018086076A1 (zh) 数据传输方法及装置
CN108494676B (zh) 数据传输方法、装置、数据收发设备、系统及存储介质
WO2018113373A1 (zh) 一种数据传输方法及装置
WO2020063339A1 (zh) 一种实现数据传输的方法、装置和系统
WO2016062106A1 (zh) 报文处理方法、装置及系统
WO2018151926A1 (en) Multipath transport communications
CN104052684A (zh) 动态适配计算机网络中的最大传输单元大小的方法和系统
US10020918B2 (en) Fast coupled retransmission for multipath communications
US9125089B2 (en) Method and apparatus for packet aggregation in a network controller
US10033619B2 (en) Data processing method and apparatus for OpenFlow network
CN106330742B (zh) 一种流量控制的方法及网络控制器
WO2017161967A1 (zh) 包每秒流量监管方法、装置和计算机存储介质
US8514700B2 (en) MLPPP occupancy based round robin
US10680922B2 (en) Communication control apparatus and communication control method
WO2017045501A1 (zh) 一种报文调度方法和装置、存储介质
CN111066272B (zh) 移动无线电接入网络中的分组延迟减少
US20210112006A1 (en) Application-based queue management
JP2009239444A (ja) パケット順序制御方法、受信装置、送信装置および通信システム
US20160277943A1 (en) Network system, control method of network system, communication device, and program
CN113612698A (zh) 一种数据包发送方法及装置
Halepoto et al. Management of buffer space for the concurrent multipath transfer over dissimilar paths

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17805708

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17805708

Country of ref document: EP

Kind code of ref document: A1