WO2017219216A1 - Procédé d'émission de données, et dispositif et système associés - Google Patents

Procédé d'émission de données, et dispositif et système associés Download PDF

Info

Publication number
WO2017219216A1
WO2017219216A1 PCT/CN2016/086467 CN2016086467W WO2017219216A1 WO 2017219216 A1 WO2017219216 A1 WO 2017219216A1 CN 2016086467 W CN2016086467 W CN 2016086467W WO 2017219216 A1 WO2017219216 A1 WO 2017219216A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
coding
matrix
data packets
packet number
Prior art date
Application number
PCT/CN2016/086467
Other languages
English (en)
Chinese (zh)
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 华为技术有限公司
Priority to PCT/CN2016/086467 priority Critical patent/WO2017219216A1/fr
Publication of WO2017219216A1 publication Critical patent/WO2017219216A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a data transmission method, related device, and system.
  • MPTCP Multi-path Transport Control Protocol
  • IETF Internet Engineering Task Force
  • the receiver submits data packets to the upper layer in order.
  • the difference in delay and packet loss rate between multiple transmission paths causes the packets sent by the receiving end to arrive at the receiving party out of order, and the data packet appears. After the first move to the "out of order" phenomenon.
  • the receiver needs to reorder the received data packets and deliver them in order, which increases the waiting delay of the receiver.
  • Network Coding In order to solve the problem of packet out-of-order of the receiver and improve the transmission efficiency of MPTCP, Network Coding (NC) has become a research hotspot in recent years.
  • Network coding breaks the strong constraint relationship between packet delivery and the transmission sequence number of the data packet.
  • the core idea is to encode the original data packet in block, as shown in Figure 2.
  • each coding package (such as C1) contains information of all the original data packets of the group, each coding package is all the original in the group A linear combination of packets.
  • the receiving end When transmitting, the receiving end sends the encoded packet and the corresponding encoding coefficient to the receiving side, and after receiving the sufficient number of encoded packets, the receiving party can according to the received encoded packet and the corresponding coefficient (for example, in FIG. 2 Coding matrix), using Gaussian elimination method, Decode the original data packet.
  • the receiving party can according to the received encoded packet and the corresponding coefficient (for example, in FIG. 2 Coding matrix), using Gaussian elimination method, Decode the original data packet.
  • a redundant coding packet (for example, R1, R2) may be added after each group of the encoded packet, and the redundant encoded packet also includes information of all the original data packets of the group. Realize the use of redundant coding packets to make up for packet loss and avoid unnecessary retransmissions. For example, as shown in FIG. 2, if the encoded packets C1, C2 are lost, the recipient can successfully decode the original data packet according to C3, C4, R1, and R2.
  • network coding can avoid reordering packets at the receiving end, network coding still has the following disadvantages:
  • Disadvantage 1 The receiver waits for a large delay
  • each of the coded packets in a group contains information of all the original data packets of the group, that is, a linear combination of all the original data packets. Only after receiving a sufficient number of coded packets (or redundant coded packets) can the receiver decode all of the original packets of the set. This increases the waiting delay of the receiver.
  • the sender divides the original data packets into groups, and encodes each group of original data packets, and each code packet of each group contains all the original data packets of the group. information.
  • the receiver can successfully decode the second set of original data packets only after receiving the C3-C6 four encoded packets. The arrival of the previous C3-C5 encoding packet does not cause any original data packet to be solved.
  • Disadvantage 2 The generation of coding coefficients increases the coding delay, and the transmission of coding coefficients wastes the transmission bandwidth.
  • a coding function is generated from the finite field GF (2 8 ) using a generation function, which increases the coding delay.
  • the encoding coefficient corresponding to the encoded packet needs to be carried in the header of the encoded packet, which increases the overhead of data transmission and wastes the transmission bandwidth.
  • the embodiment of the invention provides a data transmission method, a related device and a system, which can improve the coding and decoding efficiency of data and reduce the amount of data transmitted.
  • a data transmission method for a receiver, the method comprising: the sender encoding a set of original data packets to be transmitted by using coding coefficients a ii ⁇ a jj to obtain a set of first coding packets And then transmitting, to the receiving party, the first encoded packet, and the location information of the coding coefficient corresponding to the first encoded packet in the first encoding matrix A.
  • i, j are both positive integers, and (ji) is equal to the number of data packets in the set of original data packets.
  • the coding coefficients a ii ⁇ a jj are from the first coding matrix A, and the first coding matrix A is pre-agreed by the sender and the receiver for the sender coding and the The lower triangular matrix decoded by the receiver.
  • a data transmission method which is applied to a receiver, the method comprising: receiving, by a receiver, a first encoded packet sent by a sender, and a coding coefficient corresponding to the first encoded packet in a first coding matrix Position information in A, and acquiring, according to the location information, a coding coefficient corresponding to the first coding packet from the first coding matrix A, and finally using the coding coefficient corresponding to the first coding packet by the receiver And decoding the first encoded packet with the original data packet that has been decoded in the set of original data packets.
  • the first encoded packet is encoded by the sender using a coding coefficient a ii ⁇ a jj to encode a set of original data packets.
  • i, j are both positive integers, and (ji) is equal to the number of data packets in the set of original data packets.
  • the data transmission method described in the first aspect and the second aspect is implemented, and the randomized solution of the encoded packet can be realized by adopting the coding coefficients a ii ⁇ a jj of the lower triangular structure, thereby improving the decoding efficiency of the data.
  • selecting the coding coefficient from the pre-agreed first coding matrix A can avoid the sender frequently generating the coding coefficient and improve the coding efficiency.
  • the pre-agreed first coding matrix A may also be such that the sender does not have to transmit the coding coefficient corresponding to the first coding packet to the receiver, and only needs to indicate that the coding coefficient corresponding to the first coding packet is in the first coding matrix. The position in A is sufficient, reducing the amount of data transmission.
  • the sender and the receiver may also appoint a mapping rule f(S 1 ,S n ) of the coding coefficient corresponding to the first coding packet in the first coding matrix A. , DSN).
  • S 1 represents the minimum number of the original packet in the packet group
  • S n represents the maximum number of the original packet in the packet group
  • DSN indicates the packet number of the first encoded packet.
  • the mapping rule f(S 1 , S n , DSN) may be: the minimum packet number S 1 and the maximum packet number S n may be used to indicate that the coding coefficients a ii ⁇ a jj are in the first a row and column range in an encoding matrix A, the minimum packet number S 1 and the packet number DSN of the first encoding packet may be used to indicate that the encoding coefficient corresponding to the first encoding packet is the encoding coefficient a ii ⁇ a jj vector in which a row, i.e. the row in which the coding coefficient in a ii ⁇ a jj.
  • i a fixed value start
  • j S n - S 1 + start. That is, the coding coefficients a ii ⁇ a jj are selected starting from a fixed position on the diagonal of the first coding matrix A, and the fixed position is determined by start.
  • the row and column numbers of the coding coefficients corresponding to the first coding packet in the first coding matrix A may also be directly indicated. That is, the location information of the coding coefficient corresponding to the first coding packet in the first coding matrix A may include the row and column number. In this way, the sender only needs to transmit the row and column numbers, and does not have to transmit specific coding coefficients, and can also reduce the amount of data transmitted.
  • the transmitting party may also send the first to the receiving party for the set of original data packets.
  • a second encoding packet ie, a redundant encoding packet
  • location information of the encoding coefficient corresponding to the second encoding packet in the second encoding matrix B may include information of the entire set of original data packets.
  • the second coding matrix B is a full rank matrix for the sender coding and the receiver decoding previously agreed by the sender and the receiver.
  • the sender selects the coding coefficients from the pre-agreed second coding matrix B for redundancy coding, which can avoid frequent senders. Generate coding coefficients to improve coding efficiency.
  • the pre-agreed second coding matrix B may also be such that the sender does not have to transmit the coding coefficients corresponding to the second coding packet to the receiver, and only needs to indicate that the coding coefficient corresponding to the second coding packet is in the second coding matrix. The position in B can be reduced, reducing the amount of data transmission.
  • the mapping rule f may be further expressed as f(S 1 ,S n ,DSN,flag ).
  • S 1 denotes a group of the smallest packet number of the original data packet
  • S n represents the maximum number of the original packet in the packet group
  • DSN an encoding packet (the first packet or the second encoding
  • the packet number of the encoding packet, flag is used to indicate whether the encoding packet is the first encoding packet or the second encoding packet.
  • the values of the three terms S 1 , S n , and DSN are used to indicate the position of the encoding coefficient corresponding to the first encoded packet in the first encoding matrix A. .
  • the values of the three terms S 1 , S n , and DSN are used to indicate the position of the encoding coefficient corresponding to the second encoded packet in the second encoding matrix B.
  • the location information of the coding coefficient corresponding to the second coding packet in the second coding matrix B may include three items: S 1 , S n , and DSN.
  • the column of the coding coefficient corresponding to the second coding packet in the second matrix B is determined by S 1 and S n
  • the coding coefficient corresponding to the second coding packet is in the second coding matrix B.
  • the packet number DSN of the second encoded packet is determined.
  • the mapping rule f(S 1 ,S n , DSN of the encoding coefficient corresponding to the encoded packet is agreed by the sender and the receiver. , flag), in the transmission process, the sender only needs to transmit the values of the four items S 1 , S n , DSN, flag to the receiver, which saves the header overhead of the encoded packet and reduces the amount of data transmitted.
  • the location information of the coding coefficient corresponding to the second coding packet in the second coding matrix B may also include: the coding coefficient corresponding to the second coding packet is in the second coding matrix B. Row number.
  • the sender may further calculate the number N of the first coded packets by using an algorithm according to a real-time condition of the network:
  • the set S represents a set of multiple transmission paths
  • BW i is the bandwidth of the path i
  • the MSS i is the maximum segment size that can be transmitted on the path i
  • the BW i /MSS i is the data that the path i can transmit in a unit time.
  • the number of packets, RTT max is the longest round trip time of the plurality of transmission paths
  • RTT i is the round trip time of path i.
  • the sender may further calculate the number R of the second encoded packets by using an algorithm according to a real-time condition of the network:
  • the set S represents a set of multiple transmission paths
  • PL i is the packet loss rate of the path i
  • ⁇ i is the mean square error of the packet loss rate
  • N i is the number of the first encoded packets transmitted on the path i.
  • a data transmission apparatus comprising means for performing the method of the first aspect or the possible implementation of the first aspect.
  • a data transmission apparatus comprising means for performing the method of the second aspect or the possible implementation of the second aspect.
  • a data transmission apparatus comprising: a memory and a processor, a transmitter and a receiver coupled to the memory, wherein: the transmitter is for transmitting data to the outside, and the receiver is for receiving Externally transmitted data for storing implementation code of the method described in the first aspect, the processor for executing program code stored in the memory, ie performing a first aspect or a possible implementation of the first aspect The method described.
  • a data transmission apparatus comprising: a memory and a processor, a transmitter, and a receiver coupled to the memory, wherein: the transmitter is configured to transmit data to the outside, and the receiver is configured to receive Externally transmitted data for storing implementation code of the method described in the second aspect, the processor for executing program code stored in the memory, ie performing a second aspect or a possible implementation of the second aspect The method described.
  • the seventh aspect provides a data transmission system, including: a sender and a receiver, where: the sender may be the data transmission device described in the foregoing third aspect, and the receiver may be the foregoing fourth aspect The data transmission device described in the content.
  • the sender may also be the data transmission device described in the foregoing fifth aspect, and the receiver may also be the data transmission described in the foregoing sixth aspect. Device.
  • a storage medium for storing implementation code of the method of the first aspect or the possible implementation of the first aspect.
  • a storage medium for storing an implementation code of the method of the second aspect or the possible implementation of the second aspect.
  • the sender selects the coding coefficient of the lower triangular structure from the first coding matrix A pre-agreed by the sender and the receiver, and encodes a set of original data packets by using the selected coding coefficient to obtain the first An encoding packet, and then sequentially transmitting, to the receiving side, the first encoding packet and the location information of the encoding coefficient corresponding to the first encoding packet in the first encoding matrix A.
  • the above scheme can improve the coding and decoding efficiency of data and reduce the amount of data transmitted.
  • FIG. 1 is a schematic diagram of an MPTCP protocol stack according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of a principle of network coding according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of a codec process of network coding according to an embodiment of the present invention.
  • FIG. 4A is a schematic diagram of an application scenario according to an embodiment of the present invention.
  • 4B is a schematic diagram of a system architecture according to an embodiment of the present invention.
  • FIG. 5 is a schematic flowchart of a data transmission method according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of an encoding matrix of a lower triangular structure according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a code decoding process according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of another encoding and decoding process according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a redundant coding matrix according to an embodiment of the present invention.
  • FIG. 10A is a schematic structural diagram of a packet header of an encoding packet according to an embodiment of the present disclosure
  • FIG. 10B is a schematic structural diagram of a packet header of an encoded packet in a conventional network coding technology
  • FIG. 11 is a schematic structural diagram of a data transmission apparatus according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of another data transmission apparatus according to an embodiment of the present disclosure.
  • FIG. 13 is a schematic structural diagram of still another data transmission apparatus according to an embodiment of the present invention.
  • FIG. 4A is a schematic diagram of an application scenario according to an embodiment of the present invention.
  • both parties e.g., the illustrated file server and car
  • the illustrated file server can provide vehicles with a variety of security applications (such as accident warning, traffic management) and non-security applications (such as traffic indication, Internet access and multimedia data transmission).
  • the in-vehicle network shown in FIG. 4A is only a typical application scenario of the present invention.
  • the application scenario of the present invention is not limited thereto, and the solution of the present invention can be applied as long as the network coding is based on end-to-end communication.
  • FIG. 4B shows a system architecture of the MPTCP according to an embodiment of the present invention.
  • the sender's network encoder performs network coding on the original data packet delivered by the upper layer application, and is transmitted in parallel by the sender's data distributor to the receiver through multiple transmission paths.
  • the receiver's network decoder decodes the received encoded packet to obtain the original data packet, and the original data packet is integrated by the receiver's data collector, and then transmitted to the upper application of the receiver.
  • the sender and the receiver can respectively set the network encoder and the network decoder at the transport layer.
  • the sender and receiver in the MPTCP system are devices that support the MPTCP communication protocol.
  • the file server and the in-vehicle device (car) in FIG. 4A can be either the sender in the MPTCP system or the receiver in the MPTCP system.
  • the sender and the receiver may be network elements supporting a MPTCP communication protocol in a Data Center Network (DCN), such as a proxy server, a relay server, a switching device, and the like.
  • DCN Data Center Network
  • the sender and the receiver may also be terminal-side devices that support the MPTCP communication protocol, such as a mobile phone, a wearable device, a user agent or a user device, and a Personal Digital Assistant (PDA).
  • PDA Personal Digital Assistant
  • the sender and the receiver may also be network side devices supporting the MPTCP communication protocol, such as a base station (Base Transceiver Station, BTS) in a GSM system or a CDMA system, and a base station in a WCDMA system (NodeB). ) an evolved base station (Evolutional Node B, eNB or eNodeB) in an LTE system, And base station equipment, small base station equipment, etc. in the future 5G network.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • Evolutional Node B, eNB or eNodeB evolved base station
  • LTE Long Term Evolution
  • eNB evolved Node B
  • FIG. 4B is only an example of the MPTCP system architecture involved in the embodiment of the present invention.
  • the sender and the receiver in the MPTCP system can also adjust the architecture according to specific requirements, which is not limited herein.
  • the present invention provides a data transmission method, related device, and system.
  • the embodiment of the present invention adopts the coding coefficient of the lower triangular structure, so that each time the receiver receives an encoded packet, the encoded packet can be decoded immediately, and the receiver is reduced. Waiting for delay, improving decoding efficiency.
  • the coding coefficients of the lower triangular structure are from the lower triangular coding matrix pre-agreed by the sender and the receiver, which avoids frequent generation of coding coefficients on the sender, reduces coding delay, and improves coding efficiency; It is possible to avoid transmitting specific coding coefficients and reducing the amount of data transmitted.
  • FIG. 5 is a schematic flowchart of a data transmission method according to an embodiment of the present invention. As shown in FIG. 5, the method includes:
  • S101 Send a set of original data packets to be transmitted, and select, from the first coding matrix A, coding coefficients a ii ⁇ a jj corresponding to the set of original data packets.
  • i, j are both positive integers, and (ji) is equal to the number of data packets in the set of original data packets.
  • the coding coefficients for encoding the four original data packets may be: a 11 to a 44 .
  • the examples are merely illustrative of the embodiments of the invention and should not be construed as limiting.
  • the sender encodes the set of original data packets by using the selected coding coefficients a ii ⁇ a jj to obtain a set of first coding packets.
  • the sender sends the first encoded packet in sequence, and location information of the coding coefficient corresponding to the first encoded packet in the first coding matrix A.
  • the location information is used to indicate a location of the coding coefficient of the first encoded packet in the first coding matrix A.
  • the receiver receives the first encoded packet sent by the sender, and the location information of the coding coefficient corresponding to the first encoded packet in the first encoding matrix A. And, the receiver may acquire, according to the location information, a coding coefficient corresponding to the first coding packet from the first coding matrix A.
  • the receiver uses the coding coefficient corresponding to the first coding packet and the set of original data packets.
  • the original data packet that has been decoded out, and the first encoded packet is decoded.
  • the first coding matrix A is a lower triangular matrix, as shown in FIG. 6.
  • the rectangular dotted line frame in Fig. 6 is used to explain the range indicated by a 11 to a 33 . Accordingly, it can be understood that the encoding coefficients a ii ⁇ a jj mentioned in the embodiments of the present invention include: elements of the first encoding matrix A in which the ith column to the jth column intersect the ith row to the jth row.
  • the coding coefficients a ii ⁇ a jj are also of a lower triangular structure.
  • the encoded packet obtained by using the encoding coefficients a ii ⁇ a jj becomes the first encoded packet to distinguish the second encoded packet mentioned later.
  • the second encoding package and related content please refer to the related content of the subsequent redundant encoding.
  • the receiver can implement the random solution of the encoded packet, reduce the waiting delay of the receiver, and improve the decoding efficiency. . That is to say, each time the receiver receives an encoded packet, it can immediately decode an original data packet.
  • the first group of original data packets are: P1 to P2, and the coding coefficients for the first group of original data packets are:
  • the process of encoding the packet generated by using the coding coefficient is as follows:
  • the first coding matrix A is a lower triangular matrix for the sender coding and the receiver decoding agreed by the sender and the receiver in advance.
  • a coding matrix of a lower triangular structure is generated from the finite field GF(2 8 ) at the initial moment when the sender and the receiver establish a connection, and then the sender and the receiver agree that the coding matrix is within the lifetime of the connection.
  • the example is only an implementation manner of the embodiment of the present invention. In an actual application, the sender and the receiver may also use other methods to generate and agree on the first coding matrix A, and should not be limited.
  • the coding coefficients a ii ⁇ a jj are selected from the pre-agreed first coding matrix A to avoid frequent generation of coding coefficients by the sender and improve coding efficiency.
  • the pre-agreed first coding matrix A may also be such that the sender does not have to transmit the coding coefficient corresponding to the first coding packet to the receiver, and only needs to indicate that the coding coefficient corresponding to the first coding packet is in the first coding matrix. The position in A is sufficient, reducing the amount of data transmission.
  • the sender and the receiver may also agree on the mapping rule f(S 1 , S n , DSN) of the coding coefficient corresponding to the first coding packet in the first coding matrix A.
  • S 1 represents the minimum number of the original packet in the packet group
  • S n represents the maximum number of the original packet in the packet group
  • DSN indicates the packet number of the first encoded packet.
  • the mapping rule f(S 1 , S n , DSN) may be: the minimum packet number S 1 and the maximum packet number S n may be used to indicate that the coding coefficients a ii ⁇ a jj are in the first a row and column range in an encoding matrix A, the minimum packet number S 1 and the packet number DSN of the first encoding packet may be used to indicate that the encoding coefficient corresponding to the first encoding packet is the encoding coefficient a ii ⁇ a jj vector in which a row, i.e. the row in which the coding coefficient in a ii ⁇ a jj.
  • the location information of the coding coefficient corresponding to the first coding element in the first coding matrix A may be included on the premise that the sender and the receiver agree on the mapping rule f(S 1 , S n , DSN).
  • mapping rules f(S 1 , S n , DSN) are described below.
  • the coding coefficients for the second set of original data packets (P3 to P6) in FIG. 7 are: a 33 to a 66 .
  • the examples are merely illustrative of the embodiments of the invention and should not be construed as limiting.
  • i a fixed value start
  • j S n - S 1 + start. That is, the coding coefficients a ii ⁇ a jj are selected starting from a fixed position on the diagonal of the first coding matrix A, and the fixed position is determined by start.
  • the examples are merely illustrative of the embodiments of the invention and should not be construed as limiting.
  • start in the foregoing second mapping rule may also be dynamic.
  • n is a positive integer and delta is a dynamic step.
  • the start may also be dynamically reduced, and should not be limited.
  • the sender and the receiver agreeing on the mapping rules f(S 1 , S n , DSN) of the coding coefficients corresponding to the first coding packet, the sender only needs to transmit S 1 , S to the receiver during transmission. n , DSN these three values can be. In a specific implementation, the values of the three items can usually be carried in the header of the encoded packet.
  • the receiver can learn the coding coefficients a ii ⁇ a jj corresponding to a set of original data packets transmitted by the sender according to S 1 and S n .
  • the receiving party can And the packet number DSN of the first encoded packet transmitted by the sender knows which one of the encoding coefficients a ii to a jj the encoding coefficient corresponding to the first encoded packet.
  • the receiver can decode the first encoded packet according to the row vector and the original data packet that has been decoded in the set of original data packets.
  • the receiver can determine that a set of original data packets currently transmitted is P3 to P6, and the corresponding coding coefficients are a 33 to a 66 . Furthermore, the receiver can further determine that the coding coefficient corresponding to the first coded packet C5 is the third line of the coding coefficients a 33 to a 66 , that is, [a 53 a 54 1 0].
  • the examples are merely illustrative of the embodiments of the invention and should not be construed as limiting.
  • the row and column numbers of the coding coefficients corresponding to the first coding packet in the first coding matrix A may also be directly indicated. That is, the location information of the coding coefficient corresponding to the first coding packet in the first coding matrix A may include the row and column number. In this way, the sender only needs to transmit the row and column numbers, and does not have to transmit specific coding coefficients, thereby reducing the amount of data transmitted.
  • the receiving unit can acquire the encoding coefficient corresponding to the first encoding packet from the agreed first encoding matrix A according to the row and column number, and decode the first encoded packet.
  • the first coded packet is the first coded packet C5 in FIG. 7, then the coded coefficient corresponding to the first coded packet C5 is first.
  • the row and column numbers in the coding matrix A can be expressed as: (L5, C3 to C6), that is, the intersection of the third column to the sixth column and the fifth row. Where L represents a row and C represents a column.
  • the location of the coding coefficient corresponding to the first coded packet in the first coding matrix A may be indicated by other means, which is not limited herein.
  • the embodiment of the present invention may adopt other manners from the first coding matrix.
  • the coding coefficients a ii ⁇ a jj are selected in A, as long as the selected coding coefficients a ii ⁇ a jj are the lower triangular structure, and are not limited herein.
  • the first encoded packet may be lost during transmission.
  • the implementation of the solution of the present invention in this application scenario will be described below.
  • the transmitting party may also send a redundant encoded packet for the set of original data packets to the receiving party. And location information of the coding coefficient corresponding to the redundant coding packet in the second coding matrix B.
  • the coding coefficient corresponding to the redundant coding packet is from the second coding matrix B.
  • the embodiment of the present invention refers to the redundant encoding packet as the second encoding packet.
  • a second encoded packet can contain information for all of the original packets of the set.
  • the second encoded packets R1, R2 can compensate for the loss of the first encoded packets C3, C4, so that the receiving party can successfully decode the second after receiving the first encoded packets C5, C6 and the second encoded packets R1, R2.
  • Group raw data packets P3 to P6.
  • the second coding matrix B is used to provide redundant coding coefficients, and the second coding matrix B is a full rank matrix (ie, the row vectors are linearly independent), as shown in FIG. 9.
  • each of the row vectors in the second encoding matrix B may not contain zero elements.
  • the second coding matrix B is a full rank matrix for the sender coding and the receiver decoding previously agreed by the sender and the receiver.
  • the coding coefficients are selected from the pre-agreed second coding matrix B for redundancy coding, which can avoid the frequent generation of coding coefficients by the sender and improve the coding efficiency.
  • the pre-agreed second coding matrix B may also be such that the sender does not have to transmit the coding coefficients corresponding to the second coding packet to the receiver, and only needs to indicate that the coding coefficient corresponding to the second coding packet is in the second coding matrix. The position in B can be reduced, reducing the amount of data transmission.
  • the receiver needs to know whether the received encoded packet is the first encoded packet or the second encoded packet, and The coding coefficient corresponding to the received coded packet.
  • the mapping rule f may be further represented as f(S 1 , S n , DSN, flag).
  • S 1 denotes a group of the smallest packet number of the original data packet
  • S n represents the maximum number of the original packet in the packet group
  • DSN an encoding packet (the first packet or the second encoding
  • the packet number of the encoding packet, flag is used to indicate whether the encoding packet is the first encoding packet or the second encoding packet.
  • the values of the three terms S 1 , S n , and DSN are used to indicate the position of the encoding coefficient corresponding to the first encoded packet in the first encoding matrix A. Specifically, how the values of the three items S 1 , S n , and DSN indicate that the position of the coding coefficient corresponding to the first coded packet in the first coding matrix A can refer to the related content in the foregoing method embodiment of FIG. 5, I won't go into details here.
  • the values of the three terms S 1 , S n , and DSN are used to indicate the position of the encoding coefficient corresponding to the second encoded packet in the second encoding matrix B.
  • the location information of the coding coefficient corresponding to the second coding packet in the second coding matrix B may include: S 1 , S n , DSN.
  • the column of the coding coefficient corresponding to the second coding packet in the second matrix B is determined by S 1 and S n
  • the coding coefficient corresponding to the second coding packet is in the second coding matrix B.
  • the packet number DSN of the second encoded packet is determined.
  • the columns at the column are: Columns 3 through 6, as shown by the rectangular dashed box in Figure 9.
  • the examples are merely illustrative of the embodiments of the invention and should not be construed as limiting.
  • the sender and the receiver agree on the mapping rules f(S 1 , S n , DSN, flag) of the coding coefficients corresponding to the coded packets, the sender only needs to transmit S 1 , S to the receiver during transmission. n , DSN, flag these four values can be.
  • the values of the four items may be carried in the header of the encoded packet.
  • the code shown in FIG. 10A no longer includes a specific coding coefficient, and only needs to carry the values of the four items S 1 , S n , DSN, and flag. That is, the header overhead of the encoded packet is saved, and the amount of data transmitted is reduced.
  • the receiver can determine whether the coding coefficient corresponding to one coding packet is from the first coding matrix A or the second coding matrix B, and then the targeted from The coding coefficients corresponding to the coded packet are obtained in the first coding matrix A or the second coding matrix B. Finally, the receiver can decode the received encoded packet under the condition that the encoded packet is solvable.
  • the receiving party may after receiving enough coding packets (the sum of the first encoded packet and the second encoded packet)
  • the set of original data packets is decoded using a Gaussian elimination method.
  • “sufficiently” means that the number of encoded packets is greater than or equal to the number of original data packets in the set of original data packets.
  • the receiver needs to decode the second set of original data packets P3 P P6 according to at least C5, C6, R1, and R2. That is to say, before the second encoded packet R2 arrives at the receiving side, the receiving party cannot decode the second set of original data packets P3 to P6 according to the already received C5, C6 and R1.
  • the location information of the coding coefficient corresponding to the second coding packet in the second coding matrix B may further include: the row and column number of the coding coefficient corresponding to the second coding packet in the second coding matrix B.
  • the sender only needs to transmit the row and column numbers, and does not have to transmit specific coding coefficients. Reduce the amount of data transferred.
  • the receiving unit can acquire the encoding coefficient corresponding to the second encoding packet from the agreed second encoding matrix B according to the row and column number.
  • the sender may also dynamically determine the number N of the first coded packets included in a set of transmissions according to the real-time condition of the network.
  • the number N of the first encoded packets may be calculated by the following algorithm:
  • the set S represents a set of multiple transmission paths
  • BW i is the bandwidth of the path i
  • the MSS i is the maximum segment size that can be transmitted on the path i
  • the BW i /MSS i is the data that the path i can transmit in a unit time.
  • the number of packets, RTT max is the longest round trip time of the plurality of transmission paths
  • RTT i is the round trip time of path i.
  • the sender may also dynamically determine the number R of the second coded packets included in a set of transmissions according to the real-time condition of the network.
  • the number R of the second encoded packets may be calculated by the following algorithm:
  • the set S represents a set of multiple transmission paths
  • PL i is the packet loss rate of the path i
  • ⁇ i is the mean square error of the packet loss rate
  • N i is the number of the first encoded packets transmitted on the path i.
  • a group of transmissions refers to a group of data packets, for example, the second group of transmissions in FIG. 8 are: the first coded packets C3 to C6, and the second coded packets R1 and R2.
  • the sender selects the coding coefficient of the lower triangular structure from the first coding matrix A pre-agreed by the sender and the receiver, and encodes a set of original data packets by using the selected coding coefficient to obtain the first An encoding packet, and then sequentially transmitting, to the receiving side, the first encoding packet and the location information of the encoding coefficient corresponding to the first encoding packet in the first encoding matrix A.
  • the above scheme can improve the coding and decoding efficiency of data and reduce the amount of data transmitted.
  • an embodiment of the present invention further provides a device (shown in FIG. 11) for implementing the method described in the foregoing FIG. 5 embodiment.
  • the apparatus 100 includes a transmitter 1003, a receiver 1004, a memory 1002, and a processor 1001 coupled to the memory 1002 (the number of the processors 1001 may be one or more, and one processor in FIG. 11 is example).
  • the transmitter 1003, the receiver 1004, the memory 1002, and the processor 1001 may be connected by a bus or other means (in FIG. 11 as an example by a bus connection).
  • the transmitter 1003 is for transmitting data to the outside
  • the receiver 1004 is for receiving data from the outside.
  • the memory 1002 is for storing program code
  • the processor 1001 is for calling and running the program code stored in the memory 1002.
  • the program code stored in the memory 1002 is specifically used to implement the function of the sender in the embodiment of FIG. 5.
  • the processor 1001 is configured to call the program code stored in the memory 1002, and perform the following steps: encoding a set of original data packets by using the coding coefficients a ii ⁇ a jj to obtain a set of first encoded packets, and then using the transmission
  • the device 1003 sequentially sends the first encoded packet to the receiver, and the location information of the encoding coefficient corresponding to the first encoded packet in the first encoding matrix A.
  • i, j are both positive integers
  • (ji) is equal to the number of data packets in the set of original data packets.
  • the coding coefficients a ii ⁇ a jj are from a first coding matrix A, and the first coding matrix A is pre-agreed by the sender and the receiver for the sender coding and the receiver decoding.
  • the sender and the receiver may also appoint a mapping rule f(S 1 , S n , DSN) of the coding coefficient corresponding to the first coding packet in the first coding matrix A.
  • S 1 represents the minimum number of the original packet in the packet group
  • S n represents the maximum number of the original packet in the packet group
  • DSN indicates the packet number of the first encoded packet. That is, the location information may include three items: S 1 , S n , and DSN.
  • the processor 1001 only needs to use the transmitter 1003 to transmit the values of the three items to the receiver, which is Reduce the amount of data transferred.
  • the processor 1001 may be further configured to: use the transmitter 1003 to send, to the receiving party, the original data for the set of original data.
  • a second encoded packet of the packet ie, a redundantly encoded packet
  • location information of the encoded coefficient corresponding to the second encoded packet in the second encoding matrix B may include information of the entire set of original data packets.
  • the second coding matrix B is a full rank matrix for the sender coding and the receiver decoding previously agreed by the sender and the receiver.
  • the processor 1001 selects the coding coefficients from the pre-agreed second coding matrix B for redundancy coding, which can prevent the processor 1001 from frequently generating coding coefficients and improve coding efficiency.
  • the pre-agreed second coding matrix B may further enable the processor 1001 to transmit the coding coefficients corresponding to the second coding packet to the receiver by using the transmitter 1003, and only need to indicate the coding coefficient corresponding to the second coding packet. The position in the second coding matrix B is sufficient, and the amount of data transmission is reduced.
  • the mapping rule f may be further expressed as f(S 1 , S n , DSN, flag).
  • S 1 denotes a group of the smallest packet number of the original data packet
  • S n represents the maximum number of the original packet in the packet group
  • DSN an encoding packet (the first packet or the second encoding
  • the packet number of the encoding packet, flag is used to indicate whether the encoding packet is the first encoding packet or the second encoding packet.
  • mapping rule f(S 1 , S n , DSN, flag) please refer to the related content in the method embodiment of FIG. 5 , and details are not described herein again.
  • the mapping rule f(S 1 ,S n , DSN of the encoding coefficient corresponding to the encoded packet is agreed by the sender and the receiver. , flag)
  • the processor 1001 only needs to use the transmitter 1003 to transmit the values of the four items S 1 , S n , DSN, and flag to the receiver, thereby saving the header overhead of the encoded packet and reducing the transmission. The amount of data.
  • the execution steps of the processor 1001 and other technical features involved in the processor 1001 may refer to the related content of the sender in the method embodiment of FIG. 5, and details are not described herein again.
  • the program code stored in the memory 1002 is specifically used to implement the function of the receiving party in the embodiment of FIG. 5.
  • the processor 1001 is configured to call the program code stored in the memory 1002, and perform the following steps:
  • the positional information of the coding coefficient in the first coding matrix A, and the coding coefficient corresponding to the first coding packet is obtained from the first coding matrix A according to the location information, and finally the receiver uses the location
  • the first encoded packet is decoded by encoding a coding coefficient corresponding to the first encoded packet and an original data packet that has been decoded in the set of original data packets.
  • the first encoded packet is obtained by the sender by using a coding coefficient a ii ⁇ a jj to encode a set of original data packets, where i, j are both positive integers, and (ji) is equal to the set of originals.
  • the number of packets in the packet are from a first coding matrix A, and the first coding matrix A is a lower triangle pre-agreed by the sender and the receiver for the sender coding and the receiver decoding. matrix.
  • the processor 1001 is further configured to: receive, by the receiver 1004, a second encoded packet sent by the sender for the set of original data packets, and the coding coefficient corresponding to the second encoded packet is in the second encoding matrix B.
  • Location information The second encoded packet includes information of all data packets in the set of original data packets.
  • the coding coefficient corresponding to the second coding packet is from the second coding matrix B, and the second coding matrix B is pre-agreed by the sender and the receiver for the sender coding and the reception.
  • the second encoded packet can compensate for the first encoded packet that may be lost, such that the first encoded packet arriving at the recipient is still solvable.
  • the execution steps of the processor 1001 and other technical features involved in the processor 1001 may refer to the related content of the receiver in the method embodiment of FIG. 5, and details are not described herein again.
  • an embodiment of the present invention further provides a data transmission device 120 (shown in FIG. 12) applied to a transmitting end and a data transmission device 130 (shown in FIG. 13) applied to a receiving end for performing the foregoing figure.
  • a data transmission method described in the embodiment is described in the embodiment.
  • the data transmission device 120 applied to the transmitting end may include an encoding module 1201 and a transmitting module 1203.
  • the encoding module 1201 encodes a set of original data packets using the coding coefficients a ii ⁇ a jj to obtain a set of first encoded packets.
  • the sending module 1203 sequentially sends the first encoded packet encoded by the encoding module 1201 to the receiver, and the location information of the encoding coefficient corresponding to the first encoded packet in the first encoding matrix A.
  • i, j are both positive integers, and (ji) is equal to the number of data packets in the set of original data packets.
  • the coding coefficients a ii ⁇ a jj are from the first coding matrix A, and the first coding matrix A is pre-agreed by the sender and the receiver for the sender code and the receiver.
  • the coding coefficients a ii ⁇ a jj are also of a lower triangular structure.
  • the coding coefficients by using an encoding module 1201 a ii ⁇ a jj a set of the original data packet is coded can be realized pick codec packet on the receiving side, the receiving side reducing the waiting delay, improve decoding efficiency.
  • the encoding module 1201 selects the coding coefficients a ii ⁇ a jj from the pre-agreed first coding matrix A, so as to avoid frequent generation of coding coefficients at the transmitting end and improve coding efficiency.
  • the pre-agreed first coding matrix A may further enable the sending module 1203 not to transmit the coding coefficients corresponding to the first coding packet to the receiver, and only need to transmit the coding coefficients corresponding to the first coding packet in the first coding matrix A.
  • the location can be, without having to transmit specific coding coefficients, reducing the amount of data transmission.
  • the sender and the receiver may also agree on the mapping rule f(S 1 , S n , DSN) of the coding coefficient corresponding to the first coding packet in the first coding matrix A.
  • S 1 represents the minimum number of the original packet in the packet group
  • S n represents the maximum number of the original packet in the packet group
  • DSN indicates the packet number of the first encoded packet. That is, the location information includes values of three items S 1 , S n , and DSN.
  • mapping rule f(S 1 , S n , DSN) For a specific implementation manner of the mapping rule f(S 1 , S n , DSN), refer to the foregoing method embodiment of FIG. 5, and details are not described herein again.
  • the first encoded packet sent by the sending module 1203 may be lost during transmission.
  • encoding module 1201 may redundantly encode the set of original data packets using encoding coefficients from second encoding matrix B to obtain a second encoded packet.
  • the sending module 1203 may further send, to the receiver, a second encoded packet that is encoded by the encoding module 1201, and location information of the encoding coefficient corresponding to the second encoded packet in the second encoding matrix B.
  • the second encoded packet may include information of all data packets in the set of original data packets.
  • the second coding matrix B may be a full rank matrix for the sender coding and the receiver decoding agreed in advance by the sender and the receiver.
  • the coding module 1201 selects the coding coefficients from the pre-agreed second coding matrix B for redundancy coding, which can avoid frequent generation of coding coefficients and improve coding efficiency.
  • the pre-agreed second coding matrix B may further enable the transmitting module 1203 not to transmit the coding coefficients corresponding to the second coding packet to the receiver, and only need to transmit the coding coefficients corresponding to the second coding packet in the second coding matrix. The position in B can be reduced, reducing the amount of data transmission.
  • the mapping rule f may be further expressed as f(S 1 , S n , DSN, flag).
  • S 1 denotes a group of the smallest packet number of the original data packet
  • S n represents the maximum number of the original packet in the packet group
  • DSN an encoding packet (the first packet or the second encoding
  • the packet number of the encoding packet, flag is used to indicate whether the encoding packet is the first encoding packet or the second encoding packet.
  • the f(S 1 , S n , DSN, flag) refer to the content of the method embodiment in FIG. 5, and details are not described herein again.
  • the transmitting module 1203 only needs to carry S 1 , S n , DSN when transmitting both the first encoded packet and the second encoded packet by using the agreed mapping rule f(S 1 , S n , DSN, flag).
  • the value of the four values of flag can save the header overhead of the encoded packet and reduce the amount of data transmitted.
  • the data transmission device 130 may include: a receiving module 1301, an obtaining module 1303, and a decoding module 1305.
  • the receiving module 1301 receives the first encoded packet sent by the sender, and the location information of the encoding coefficient corresponding to the first encoded packet in the first encoding matrix A.
  • the obtaining module 1303 acquires the coding coefficient corresponding to the first coding packet from the first coding matrix A according to the location information received by the receiving module 1301.
  • the decoding module 1305 decodes the first encoded packet by using the encoding coefficient corresponding to the first encoding packet acquired by the obtaining module 1303 and the original data packet that has been decoded in the set of original data packets.
  • the first encoded packet is obtained by the sender by using a coding coefficient a ii ⁇ a jj to encode a set of original data packets.
  • i, j are both positive integers, and (ji) is equal to the number of data packets in the set of original data packets.
  • the coding coefficients a ii ⁇ a jj are from the first coding matrix A, and the first coding matrix A is pre-agreed by the sender and the receiver for the sender code and the receiver.
  • the decoded lower triangular matrix is obtained by the sender by using a coding coefficient a ii ⁇ a jj to encode a set of original data packets.
  • the decoding module 1305 can decode the first encoded packet without relying on the first encoded packet that arrives later. That is, the receiver does not need to wait, and can successfully decode the currently arrived coded packet by using the currently arrived coded packet and the original data packet that has been decoded, so that the randomized solution of the coded packet can be realized, and the decoding efficiency is improved.
  • the coding efficiency can be improved by arranging the first coding matrix A.
  • the sender and the receiver may also agree on the mapping rule f(S 1 , S n , DSN) of the coding coefficient corresponding to the first coding packet in the first coding matrix A.
  • S 1 represents the minimum number of the original packet in the packet group
  • S n represents the maximum number of the original packet in the packet group
  • DSN indicates the packet number of the first encoded packet. That is, the location information includes three values of S 1 , S n , and DSN.
  • the mapping rule f(S 1 , S n , DSN) refer to the foregoing method embodiment of FIG. 5, and details are not described herein again.
  • the obtaining module 1303 can obtain the encoded packet corresponding to the first encoding matrix A according to the three values of S 1 , S n , and DSN received by the receiving module 1301.
  • the coding coefficients are then decoded by decoding module 1305. In this way, the sender does not have to transmit specific coding coefficients, which reduces the amount of data transmission.
  • the first encoded packet may be lost during transmission.
  • the sender also transmits the second encoded packet in order to compensate for the lost first encoded packet.
  • the second encoding packet please refer to the method embodiment in FIG. 5, and details are not described herein again.
  • the receiving module 1301 may further receive the second encoded packet sent by the sender, and the location information of the encoding coefficient corresponding to the second encoded packet in the second encoding matrix B. Then, the obtaining module 1303 acquires the coding coefficients corresponding to the second coding packet from the second coding matrix B according to the location information of the coding coefficients corresponding to the second coding packet in the second coding matrix B. Finally, after the receiving module 1301 receives a sufficient number of encoded packets (including the first encoded packet and the second encoded packet), the decoding module 1305 can decode all the received encoded packets.
  • the second coding matrix B is a full rank matrix used by the sender and the receiver for the sender coding and the receiver decoding.
  • the redundancy coding efficiency can be improved by arranging the second coding matrix B.
  • the mapping rule f may be further expressed as f(S 1 , S n , DSN, flag).
  • S 1 denotes a group of the smallest packet number of the original data packet
  • S n represents the maximum number of the original packet in the packet group
  • DSN an encoding packet (the first packet or the second encoding
  • the packet number of the encoding packet, flag is used to indicate whether the encoding packet is the first encoding packet or the second encoding packet. That is, the location information may include values of four items S 1 , S n , DSN, and flag.
  • the f(S 1 , S n , DSN, flag) refer to the content of the method embodiment in FIG. 5, and details are not described herein again.
  • the obtaining module 1303 may receive the four values of S 1 , S n , DSN, flag received from the receiving module 1301 from the first encoding matrix A or The coding coefficients corresponding to the coding packets are obtained in the second coding matrix B, and then decoded by the decoding module 1305. In this way, the sender does not have to transmit specific coding coefficients, which reduces the amount of data transmission.
  • an embodiment of the present invention further provides a data transmission system, where the data transmission system includes: a sender and a receiver.
  • the functions corresponding to the sender and the receiver may be specifically referred to the details of the sender and the receiver in the method embodiment of FIG. 5, and details are not described herein.
  • the architecture of the data transmission system can be set with reference to FIG. 4B.
  • the sender may be a device that is applied to the sender and is represented by the device shown in FIG. 11, or may be a data transmission device 120 that is characterized by the device shown in FIG.
  • the receiving party may be a device applied to the receiving end characterized by the device shown in FIG. 11, and the receiving party may also be the data transmitting device 130 shown in FIG.
  • the sender selects the coding coefficient of the lower triangular structure from the first coding matrix A pre-agreed by the sender and the receiver, and encodes a set of original data packets by using the selected coding coefficient to obtain the first An encoding packet, and then sequentially transmitting, to the receiving side, the first encoding packet and the location information of the encoding coefficient corresponding to the first encoding packet in the first encoding matrix A.
  • the above scheme can improve the coding and decoding efficiency of data and reduce the amount of data transmitted.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the present invention may employ computer-usable storage media (including but not limited to disk storage and storage) in one or more of the computer-usable program code embodied therein. The form of a computer program product implemented on an optical memory or the like.
  • 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.

Landscapes

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

Abstract

La présente invention concerne un procédé d'émission de données, ainsi qu'un dispositif et un système associés. Le procédé comprend les étapes suivantes : pour un groupe de paquets de données originaux à émettre, un expéditeur sélectionne des coefficients de codage aii-ajj servant à coder le groupe de paquets de données originaux dans une première matrice A ; l'expéditeur utilise les coefficients de codage sélectionnés aii-ajj pour coder le groupe de paquets de données originaux afin d'obtenir un groupe de premiers paquets codés ; et l'expéditeur envoie à un récepteur, en séquence, les premiers paquets codés et des informations de position concernant les coefficients de codage correspondant aux premiers paquets codés dans la première matrice de codage A, et indique la position au récepteur, la première matrice A étant une matrice triangulaire inférieure prédéterminée par l'expéditeur et le récepteur, i et j étant tous deux des nombres entiers positifs, et (j-i) étant égal au nombre de paquets de données présents dans le groupe de paquets de données originaux. Le schéma permet d'améliorer l'efficacité du codage et du décodage des données et de réduire la quantité de données émises.
PCT/CN2016/086467 2016-06-20 2016-06-20 Procédé d'émission de données, et dispositif et système associés WO2017219216A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/086467 WO2017219216A1 (fr) 2016-06-20 2016-06-20 Procédé d'émission de données, et dispositif et système associés

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/086467 WO2017219216A1 (fr) 2016-06-20 2016-06-20 Procédé d'émission de données, et dispositif et système associés

Publications (1)

Publication Number Publication Date
WO2017219216A1 true WO2017219216A1 (fr) 2017-12-28

Family

ID=60783644

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/086467 WO2017219216A1 (fr) 2016-06-20 2016-06-20 Procédé d'émission de données, et dispositif et système associés

Country Status (1)

Country Link
WO (1) WO2017219216A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112290952A (zh) * 2020-10-10 2021-01-29 中科驭数（北京）科技有限公司 一种并行数据编码装置及方法
WO2021159478A1 (fr) * 2020-02-14 2021-08-19 华为技术有限公司 Procédé et appareil de conservation de l'ordre de messages
CN113497669A (zh) * 2020-03-20 2021-10-12 华为技术有限公司 编码数据包的传输方法、装置、电子设备和存储介质
WO2023246557A1 (fr) * 2022-06-21 2023-12-28 华为技术有限公司 Procédé et appareil de communication

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110142141A1 (en) * 2007-07-03 2011-06-16 Huawei Technologies Co., Ltd. Method, apparatus and system for random linear network coding
WO2011124167A2 (fr) * 2011-05-11 2011-10-13 华为技术有限公司 Procédé et dispositif de codage, procédé et dispositif de décodage, système de codage et de décodage
CN103200192A (zh) * 2013-03-28 2013-07-10 中国科学院声学研究所 网络编码层对数据包的编解码方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110142141A1 (en) * 2007-07-03 2011-06-16 Huawei Technologies Co., Ltd. Method, apparatus and system for random linear network coding
WO2011124167A2 (fr) * 2011-05-11 2011-10-13 华为技术有限公司 Procédé et dispositif de codage, procédé et dispositif de décodage, système de codage et de décodage
CN103200192A (zh) * 2013-03-28 2013-07-10 中国科学院声学研究所 网络编码层对数据包的编解码方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021159478A1 (fr) * 2020-02-14 2021-08-19 华为技术有限公司 Procédé et appareil de conservation de l'ordre de messages
CN113497669A (zh) * 2020-03-20 2021-10-12 华为技术有限公司 编码数据包的传输方法、装置、电子设备和存储介质
CN112290952A (zh) * 2020-10-10 2021-01-29 中科驭数（北京）科技有限公司 一种并行数据编码装置及方法
CN112290952B (zh) * 2020-10-10 2023-07-18 中科驭数（北京）科技有限公司 一种并行数据编码装置及方法
WO2023246557A1 (fr) * 2022-06-21 2023-12-28 华为技术有限公司 Procédé et appareil de communication

Similar Documents

Publication Publication Date Title
CN107508655B (zh) 一种自适应端到端网络编码传输方法
KR102051504B1 (ko) 무선 통신 시스템에서 데이터 패킷 송수신 방법 및 장치
JP5280465B2 (ja) 拡張されたブロック確認応答
EP3576329B1 (fr) Procédé et dispositif de communication
US8306062B1 (en) Method and apparatus of adaptive large receive offload
CN107547436B (zh) 基于网络编码的传输控制协议的编译码方法
WO2016045332A1 (fr) Procédé et dispositif pour un ajustement de paramètre de codage et un traitement d'informations de rétroaction
WO2017219216A1 (fr) Procédé d'émission de données, et dispositif et système associés
CN110506403B (zh) 用于无线设备的流控制的方法及装置
JP2010536264A (ja) 無線通信システムにおけるハンドオーバー中の順序正しいデータ配信
WO2009022877A2 (fr) Procédé permettant la transmission et le traitement d'un bloc de données d'une couche de protocole spécifique dans un système de communication sans fil
KR20210006884A (ko) 비-지상 네트워크용 하이브리드 자동 반복 요청(harq) 기술
CN110944358B (zh) 数据传输方法和设备
US8761605B2 (en) Communication data transmission equipment, a communication data transmission system, a communication data transmission method and a communication data transmission program
US11683128B2 (en) Receiver, transmitter, communication network, data signal and method improving a retransmission process in a communication network
WO2020078448A1 (fr) Procédé et appareil de traitement de messages
CN102404077A (zh) 基于喷泉码的多径tcp协议
CN113055285A (zh) 基于mptcp与网络编码的自适应数据传输方法
CN111131179B (zh) 业务处理方法、装置、网络设备及存储介质
CN112615701B (zh) 一种数据处理方法及装置
Saif et al. A reliable A-MSDU frame aggregation scheme in 802.11 n wireless networks
US10523790B2 (en) System and method of header compression for online network codes
WO2021179864A1 (fr) Procédé de rétroaction de livre de codes, dispositif de réseau, dispositif terminal et support de stockage informatique
JP2017092692A (ja) データ伝送制御システム及び方法、並びに、データ伝送制御プログラム
Saif et al. An optimized A-MSDU frame aggregation with subframe retransmission in IEEE 802.11 n wireless networks

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

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

Country of ref document: EP

Kind code of ref document: A1