CN116112119A - Method and device for processing data - Google Patents

Abstract

The embodiment of the application provides a method and a device for processing data. The method comprises the following steps: the first node divides first data into K data groups, K is an integer greater than 1, the first data is data sent to the second node, the K data groups are encoded by using a first coding scheme to obtain second data, the second data comprises M1 first code words, the first code words are generated by encoding part of data selected from each data group of the K data groups by using the first coding scheme, M1 is an integer greater than 1, and the second data is sent to the second node. By the method and the device provided by the embodiment of the application, the problem of packet loss in the data exchange process can be effectively avoided, so that the data exchange efficiency is improved.

Description

Method and device for processing data

technical field

The embodiments of the present application relate to the communication field, and, more specifically, to a method and an apparatus for processing data.

Background technique

In the current data center networks (data center networks, DCN) and some other switching networks, most of them adopt a multi-layer switching architecture. Under this architecture, the "header + payload" method is generally used for data exchange, such as the Ethernet protocol. Wherein, the payload is the data to be transmitted, and the header includes routing information and control information, and the header can make the data in the payload smoothly pass through each switching node in the middle and finally be transmitted to the destination node.

During the data exchange process, the intermediate switching node stores and forwards the received data packets according to the routing information and control information in the header, and configures the cache to avoid port congestion, such as the situation that multiple data packets need to be sent from the same port at the same time.

However, the cache resource at the switching node is limited, and when the buffer usage reaches the upper limit, the switching node will discard extra data packets, resulting in packet loss. After the receiving node finds that the data packet is lost, it will notify the sending node to resend the lost data packet, that is, the retransmission mechanism. Retransmission will cause a millisecond-level exchange delay and affect the data exchange efficiency.

Contents of the invention

Embodiments of the present application provide a data processing method and device, which can effectively avoid packet loss during data exchange, thereby improving data exchange efficiency.

In a first aspect, a method for processing data is provided, and the method is applied to a data exchange network. The method includes:

The first node divides the first data into K data groups, K is an integer greater than 1, the first data is the data sent to the second node, and the first node encodes the K data groups using the first coding scheme to obtain The second data, the second data includes M1 first codewords, the first codewords are codewords generated by encoding partial data selected from each of the K data groups using a first coding scheme, M1 is an integer greater than 1, and the first node sends the second data to the second node.

Based on the above scheme, in the process of generating the first codeword, the data in each data group is selected, so at the receiving end of the second data, if the data group belonging to the second data is lost, the first codeword can be used to Decoding retrieves lost data groups, thereby improving the efficiency of data exchange.

With reference to the first aspect, in some implementations of the first aspect, the M1 first codewords include N data groups, and the first data group in the N data groups includes position information, and the position information indicates the first The position of the data group in the N data groups, the first data group is any data group in the N data groups, and N is an integer greater than K.

Based on the above scheme, adding position information to the data group encoded using the first coding scheme can make the receiving end of the second data recover the data encoded using the first coding scheme according to the received position information in each data group. The arrangement of the data groups, so as to determine the first codeword for recovering the lost data groups.

With reference to the first aspect, in some implementation manners of the first aspect, the N data groups have the same length.

With reference to the first aspect, in some implementations of the first aspect, when the first codeword is generated by encoding using the first encoding scheme, the number of symbols carrying data selected in each of the K data groups same.

With reference to the first aspect, in some implementations of the first aspect, when the first codeword is generated by encoding using the first encoding scheme, the position of the symbol carrying the data selected in each of the K data groups same.

With reference to the first aspect, in some implementations of the first aspect, the M1 first codewords include N data groups, where N is an integer greater than K, and the first node uses the second encoding scheme for the N data groups Encoding to generate third data, the third data includes M2 second codewords, the second codewords are codewords generated by encoding all the data of U data groups using the second coding scheme, and the U data groups Select the N data groups, 1≤U≤N, 1≤M2≤N, and send the third data to the second node.

Based on the above scheme, on the basis of using the first encoding scheme, use the second encoding scheme to encode the N data groups again, so that each data group can be transmitted accurately, and avoid garbled characters and errors during the exchange of data groups. code.

With reference to the first aspect, in some implementation manners of the first aspect, each of the N data groups includes an identifier representing the second data.

Based on the above solution, after the second node receives the data group, it can distinguish the data group belonging to the second data through the identifier, so as to more accurately judge whether there is a missing data group in the process of data exchange of the second data.

With reference to the first aspect, in some implementation manners of the first aspect, the first coding scheme includes forward error correction coding (FEC).

With reference to the first aspect, in some implementation manners of the first aspect, the second coding scheme includes forward error correction coding (FEC).

In a second aspect, a method for processing data is provided, and the method is applied to a data exchange network. The method includes: the second node receives a data group belonging to the second data from the first node, the second data includes M1 first codewords, and the first codeword is for each data group from the K data groups Part of the data selected in is encoded using the first encoding scheme to generate codewords, and K and M1 are integers greater than 1.

Based on the above scheme, since the first node selects the data in each data group during the process of generating the first codeword, the second node can, in the case of losing the data group of the second data, update the first codeword Word decoding retrieves lost data groups, thereby improving the efficiency of data exchange.

With reference to the second aspect, in some implementations of the second aspect, the M1 first codewords include N data groups, where N is an integer greater than K, and the second node receives the first The data group begins to start the timer. If the number of data groups belonging to the second data received by the second node is less than N before the timer ends, it is determined that the second data has a missing data group. If the number of data groups belonging to the second data received by the second node is equal to N, it is determined that the second data does not have a missing data group.

Based on the above solution, a time period can be set artificially, and whether there is a packet loss problem in the data can be judged within the time period, so as to avoid judgment delay.

With reference to the second aspect, in some implementations of the second aspect, the second node caches the received data group, and when it is determined that the second data has a missing data group, the second node according to the received The data set of the second data restores the lost data set.

With reference to the second aspect, in some implementations of the second aspect, the first data group in the N data groups includes location information, the first data group is any data group in the N data groups, and the second node Determining M1 first codewords according to the received data groups belonging to the second data and the position information in the data groups, and using the first decoding to recover the lost data groups for the M1 first codewords.

Based on the above scheme, the second node restores the arrangement of the data group encoded by the first node using the first coding scheme through the position information added by the first node in the data group encoded using the first coding scheme, so as to determine that the lost The first codeword of the data group.

With reference to the second aspect, in some implementation manners of the second aspect, the cached data group of the second data is cleared.

Based on the foregoing solution, the cache capacity at the second node is increased by clearing the cache.

With reference to the second aspect, in some implementation manners of the second aspect, the N data groups have the same length.

With reference to the second aspect, in some implementations of the second aspect, the first codeword uses the first encoding scheme for the data on the same number of symbols selected from each of the K data groups Encode the generated codeword.

With reference to the second aspect, in some implementation manners of the second aspect, the above symbols of the same number have the same position in each of the K data groups.

With reference to the second aspect, in some implementation manners of the second aspect, each of the N data groups includes an identifier representing the second data.

Based on the above scheme, after receiving the data group, the second node can use the identifier to distinguish the data group belonging to the second data, so as to more accurately judge whether there is a missing data group in the second data.

With reference to the second aspect, in some implementations of the second aspect, the M1 first codewords include N data groups, and the second node receives third data from the first node, and the third data includes M2 The second codeword, the second codeword is a codeword generated by encoding all the data of the U data groups using the second encoding scheme, 1≤U≤N, 1≤M2≤N, and the U data groups are selected from For the N data groups, the second node uses the second decoding for the M2 second codewords to generate second data.

Based on the above scheme, because the second data has been encoded twice, the second node can accurately receive each data group through the second decoding (if any data group has an error during transmission, the second node can pass the second Decoding performs error correction on the data group), and the lost data group can be recovered through the first decoding.

With reference to the second aspect, in some implementation manners of the second aspect, the first decoding includes decoding corresponding to a forward error correction code (FEC).

With reference to the second aspect, in some implementation manners of the second aspect, the second decoding includes decoding corresponding to a forward error correction code (FEC).

In a third aspect, a device for processing data is provided, and the device is a device in a data exchange network. The device includes: a processing unit and a transceiver unit, the processing unit is used to divide the first data into K data groups, K is an integer greater than 1, the first data is data sent to the second node, and the processing unit also uses Encoding the K data groups using the first encoding scheme to obtain second data, the second data includes M1 first codewords, and the first codewords are for each data group from the K data groups The selected part of the data is encoded using the first encoding scheme to generate a codeword, M1 is an integer greater than 1; the transceiver unit is used to send the second data to the second node.

Based on the above scheme, in the process of generating the first codeword, the data in each data group is selected, so at the receiving end (second node) of the second data, if the data group belonging to the second data is lost, it can be The lost data group is retrieved according to the decoding of the first codeword, thereby improving the efficiency of data exchange.

With reference to the third aspect, in some implementations of the third aspect, the M1 first codewords include N data groups, and the first data group in the N data groups includes position information, and the position information indicates that the first data group The position of a data group in the N data groups, the first data group is any data group in the N data groups, and N is an integer greater than K.

Based on the above scheme, adding position information to the data group encoded using the first coding scheme can make the receiving end of the second data recover the data encoded using the first coding scheme according to the received position information in each data group. The arrangement of the data groups, so as to determine the first codeword for recovering the lost data groups.

With reference to the third aspect, in some implementation manners of the third aspect, the N data groups have the same length.

With reference to the third aspect, in some implementation manners of the third aspect, when the processing unit encodes and generates the first codeword using the first coding scheme, the data carrying data selected in each of the K data groups The number of symbols is the same.

With reference to the third aspect, in some implementation manners of the third aspect, when the processing unit encodes and generates the first codeword using the first coding scheme, the data carrying data selected in each of the K data groups The positions of the symbols are the same.

With reference to the third aspect, in some implementations of the third aspect, the M1 first codewords include N data groups, where N is an integer greater than K, and the processing unit is further configured to use the first codeword for the N data groups The second encoding scheme is encoded to generate the third data, the third data includes M2 second codewords, the second codewords are codewords generated by using the second encoding scheme to encode all the data of the U data groups, the U The data group is selected from the N data groups, 1≤U≤N, 1≤M2≤N, and the transceiver unit is used to send the third data to the second node.

Based on the above scheme, on the basis of using the first encoding, the second encoding is used to encode the N data groups again, so that each data group can be transmitted accurately, and garbled and wrong codes during the transmission of the data groups can be avoided.

With reference to the third aspect, in some implementation manners of the third aspect, each of the N data groups includes an identifier representing the second data.

Based on the above solution, after the second node receives the data group, it can use the identifier to distinguish the data group belonging to the second data, so as to more accurately judge whether there is a missing data group in the second data during the data exchange process.

With reference to the third aspect, in some implementation manners of the third aspect, the first coding scheme includes forward error correction coding (FEC).

With reference to the third aspect, in some implementation manners of the third aspect, the second coding scheme includes forward error correction coding (FEC).

In a fourth aspect, a device for processing data is provided, and the device is a device in a data exchange network. The device includes: a transceiver unit and a processing unit, the transceiver unit is used to receive a data group belonging to the second data from the first node, the second data includes M1 first codewords, and the first codeword is for the slave K Part of the data selected in each data group of the three data groups is encoded using the first coding scheme to generate codewords, and K and M1 are integers greater than 1.

Based on the above scheme, since the first node selects the data in each data group during the process of generating the first codeword, the second node can, in the case of losing the data group of the second data, update the first codeword Word decoding retrieves lost data groups, thereby improving the efficiency of data exchange.

With reference to the fourth aspect, in some implementations of the fourth aspect, the M1 first codewords include N data groups, where N is an integer greater than K, and the processing unit is used to, when the transceiver unit receives the second The first data group of the data begins to start the timer, if before the end of the timer, the number of data groups belonging to the second data received by the transceiver unit is less than N, then it is determined that the second data has a missing data group. Before the timer expires, if the number of data groups belonging to the second data received by the transceiver unit is equal to N, it is determined that the second data has no missing data groups.

Based on the above solution, a time period can be set artificially, and whether there is a packet loss problem in the data can be judged within the time period, so as to avoid judgment delay.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the device further includes a storage unit: the storage unit is configured to cache the received data group, and the processing unit is also configured to determine that the second data is lost In the case of a data group, the lost data group is recovered according to the data group received by the transceiver unit belonging to the second data.

With reference to the fourth aspect, in some implementations of the fourth aspect, the second data includes N data groups, the first data group in the N data groups includes location information, and the first data group is the N data groups For any data group in the data group, the processing unit is further configured to determine the first code word according to the data group received by the transceiver unit belonging to the second data and the position information in the data group, and the first code word word using the first decoding to recover the lost data set.

Based on the above scheme, the second node restores the arrangement of the data group encoded by the first node using the first coding scheme through the position information added by the first node in the data group encoded using the first coding scheme, so as to determine that the lost The first codeword of the data group.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the processing unit is further configured to clear the data group of the second data cached in the storage unit.

Based on the foregoing solution, the cache capacity at the second node is increased by clearing the cache.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the N data groups have the same length.

With reference to the fourth aspect, in some implementations of the fourth aspect, the first codeword is to encode the data on the same number of symbols selected from each of the K data groups using the first coding scheme Generated codewords.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the symbols of the same number have the same position in each of the K data groups.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, each of the N data groups includes an identifier representing the second data.

Based on the above scheme, after receiving the data group, the second node can use the identifier to distinguish the data group belonging to the second data, so as to more accurately judge whether there is a missing data group in the second data.

With reference to the fourth aspect, in some implementations of the fourth aspect, the M1 first codewords include N data groups, and the transceiver unit is configured to receive third data from the first node, the third data includes M2 second codewords, the second codewords are codewords generated by encoding all the data of the U data groups using the second coding scheme, 1≤U≤N, 1≤M2≤N, the U data groups Selected from the N data groups, the processing unit is further configured to use second decoding on the M2 second codewords to generate second data.

Based on the above scheme, because the second data has been encoded twice, the second node can accurately receive each data group through the second decoding (if any data group has an error during transmission, the second node can pass the second Decoding performs error correction on the data group), and the lost data group can be recovered through the first decoding.

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the first decoding includes decoding corresponding to a forward error correction code (FEC).

With reference to the fourth aspect, in some implementation manners of the fourth aspect, the second decoding includes decoding corresponding to a forward error correction code (FEC).

In the fifth aspect, there is provided a device for processing data, the device includes a processor, the processor is coupled with the memory, and can be used to execute instructions in the memory, so as to realize the above first aspect or any possible realization of the first aspect methods in methods. Optionally, the device further includes a memory, and the memory and the processor may be deployed separately or in a centralized manner. Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

In one implementation, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the device is a device in a data exchange network. When the device can be a chip, the communication interface can be an input/output interface, an interface circuit, an output circuit, or an input circuit on the chip or chip system. , pins or related circuits, etc. The processor may also be embodied as a processing circuit or logic circuit.

Optionally, the transceiver may be a transceiver circuit. Optionally, the input/output interface may be an input/output circuit.

In the specific implementation process, the above-mentioned processor can be one or more chips, the input circuit can be an input pin, the output circuit can be an output pin, and the processing circuit can be a transistor, a gate circuit, a flip-flop and various logic circuits, etc. . The input signal received by the input circuit may be received and input by the receiver, but the signal output by the output circuit may be but not limited to be output to the transmitter and transmitted by the transmitter, and the input circuit and the output circuit may be The same circuit, which is used as an input circuit and an output circuit at different times. The embodiment of the present application does not limit the specific implementation manners of the processor and various circuits.

In the sixth aspect, there is provided a device for processing data, the device includes a processor, the processor is coupled with the memory, and can be used to execute instructions in the memory, so as to realize the above second aspect, or any possible realization of the second aspect methods in methods. Optionally, the device further includes a memory, and the memory and the processor may be deployed separately or in a centralized manner. Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

In one implementation, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the device is a device in a data exchange network. When the device can be a chip, the communication interface can be an input/output interface, an interface circuit, an output circuit, or an input circuit on the chip or chip system. , pins or related circuits, etc. The processor may also be embodied as a processing circuit or logic circuit.

Optionally, the transceiver may be a transceiver circuit. Optionally, the input/output interface may be an input/output circuit.

In the specific implementation process, the above-mentioned processor can be one or more chips, the input circuit can be an input pin, the output circuit can be an output pin, and the processing circuit can be a transistor, a gate circuit, a flip-flop and various logic circuits, etc. . The input signal received by the input circuit may be received and input by the receiver, but the signal output by the output circuit may be but not limited to be output to the transmitter and transmitted by the transmitter, and the input circuit and the output circuit may be The same circuit, which is used as an input circuit and an output circuit at different times. The embodiment of the present application does not limit the specific implementation manners of the processor and various circuits.

In a seventh aspect, there is provided a device for processing data, the device includes a logic circuit, the logic circuit is used to couple with an input/output interface, and transmit data through the input/output interface, so as to perform the above-mentioned first aspect to the second aspect any aspect, and the method in any possible implementation manner of the first aspect to the second aspect.

In an eighth aspect, a computer-readable storage medium is provided, and the computer-readable storage medium stores a computer program (also referred to as code, or an instruction) which, when running on a computer, causes the computer to perform the above-mentioned first to Any aspect in the second aspect, and the method in any possible implementation manner in the first aspect to the second aspect.

In a ninth aspect, a computer program product is provided, and the computer program product includes: a computer program (also referred to as code, or an instruction), which, when the computer program is executed, causes the computer to perform the above-mentioned first aspect to the second aspect any one of the aspects, and the method in any one of the possible implementations of the first aspect to the second aspect.

For the beneficial effects brought about by the above-mentioned fifth aspect to the ninth aspect, reference may be made to the description of the beneficial effects in the first aspect to the second aspect, and details are not repeated here.

Description of drawings

FIG. 1 is a schematic diagram of a data exchange architecture provided by an embodiment of the present application.

Figure 2 shows a method of processing data at an intermediate switching node.

FIG. 3 is a flowchart of a method for processing data by a sending node provided in an embodiment of the present application.

FIG. 4 is a schematic flow chart of processing data at a physical layer provided by an embodiment of the present application.

FIG. 5 is a schematic diagram of a data group before encoding using a first encoding scheme provided by an embodiment of the present application.

FIG. 6 is a schematic diagram of a data group encoded using a first encoding scheme provided by an embodiment of the present application.

FIG. 7 is another schematic flowchart of processing data at the physical layer provided by the embodiment of the present application.

FIG. 8 is a schematic diagram of data processed by two encodings provided by the embodiment of the present application.

Fig. 9 is a schematic block diagram of an apparatus for processing data provided by an embodiment of the present application.

Fig. 10 is a schematic block diagram of another device for processing data provided by an embodiment of the present application.

Fig. 11 is a schematic structural diagram of an apparatus for processing data provided by an embodiment of the present application.

Fig. 12 is a schematic structural diagram of another device for processing data provided by an embodiment of the present application.

Fig. 13 is a schematic structural diagram of another device for processing data provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings.

The technical solutions of the embodiments of the present application can be applied to various communication systems with data exchange, such as: global system of mobile communication (GSM) system, code division multiple access (CDMA) system, wideband code Division multiple access (wideband code division multiple access, WCDMA) system, general packet radio service (general packet radio service, GPRS), long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) Communication System, 5th Generation (5G) Or future systems or new radio (new radio, NR), etc.

FIG. 1 is a schematic diagram of a data exchange architecture provided by an embodiment of the present application.

Figure 1 shows a multi-layer switching architecture in a data switching network, which includes central switching (central switching, CSW) nodes (such as intranet switches), aggregation switching (aggregation switching, ASW) nodes (such as access layer switches ), top of rack (TOR), and servers (or computing unit arrays) and other nodes, under this architecture, the distribution distances between switching nodes at different levels are different. Specifically, each switching node stores and forwards received data packets according to the routing information and control information in the header. When multiple data packets need to be sent from the same port at the same time, it is necessary to configure buffers to avoid port congestion, but each The cache resource at the node is limited. When the cache usage reaches the upper limit, the node will discard extra data packets, resulting in packet loss. When a node receives a data packet and finds that the packet is lost, it will start the retransmission mechanism, that is, the receiving node sends a message to make the sending node retransmit the data packet. This process has a certain delay, which will affect the efficiency of data exchange.

Figure 2 shows a method of processing data at an intermediate switching node.

At the sending node, the data to be sent is grouped, and the grouped data (data group) is encapsulated sequentially from the upper layer to the lower layer according to the seven-layer network protocol, and forward error correction code (forward error correction) is used for the encapsulated data at the physical layer. coding, FEC) and send after encoding. In this encoding process, only one encoding is performed, and one encapsulated data group or multiple data groups are used as a unit during encoding, assuming that one encapsulated data group is used as a unit , that is, perform FEC encoding on all the data in an encapsulated data group to generate a codeword. It is assumed that multiple encapsulated data groups are used as a unit, that is, FEC encoding is performed on all data in the multiple encapsulated data groups to generate a codeword. Therefore, this encoding process can improve the accuracy of transmission of each data group, but cannot avoid the problem of missing data groups.

At the receiving node, the received data is decoded and decapsulated according to the reverse process of the sending node, and the data of the corresponding user is obtained. And at a certain data layer, such as at the transmission control protocol layer (transmission control protocol, TCP) to detect whether the received data is complete (that is, whether the number of received data groups is consistent with the number of groups that the sending node divides the data to be sent into) , that is, to detect whether there is any packet loss, and if a data group is found to be lost, the sending node is notified to resend the above-mentioned data to be sent. In this process, there will be a millisecond-level delay from the discovery of data loss to the re-reception of retransmitted data, which greatly affects the data exchange efficiency of the network.

In view of this, the embodiments of the present application provide a method and device for processing data at the physical layer, which can effectively avoid the problem of packet loss during data exchange, thereby improving the efficiency of data exchange.

FIG. 3 is a flowchart of a method for processing data by a sending node provided in an embodiment of the present application. The method 300 shown in FIG. 3 includes:

Step S310, the first node divides the first data into K data groups, K is an integer greater than 1, and the first data is data sent to the second node.

It should be understood that the first node and the second node are nodes in the data exchange network, the first node and the second node may be intermediate nodes, and the first node may also be the starting node for sending the first data. No restrictions.

Exemplarily, the first node and the second node may be devices in a data exchange network, such as TOR, a computer, a single central processing unit (central processing unit, CPU), or a graphics processing unit (graphics processing unit, GPU).

Optionally, the length of each data group in the K data groups is the same, which can also be described as the symbol occupied by each data group in the K data groups, or the number of bits is the same. Similar descriptions below are understood here, I won't repeat them later.

For example, as shown in FIG. 4 , the first node groups the data to be sent (first data) into K data groups, and each data group in the K data groups has the same length.

Step S320, the first node encodes the K data groups using the first coding scheme to obtain second data, the second data includes M1 first codewords, wherein the first codewords are the data from the K data groups Part of the data selected in each data group is generated by encoding using the first encoding scheme, and M1 is an integer greater than 1.

It should be understood that in the process of generating a first codeword using the first coding scheme, the partial data selected by the first node in each of the K data groups may be part of the symbols in each data group, Or the data carried on some bits.

Optionally, the M1 first codewords include N data groups, the first data group in the N data groups includes position information, and the position information indicates the position of the first data group in the N data groups, The first data group is any one of the N data groups, and N is an integer greater than K.

It should be understood that the second data includes M1 first codewords, which may also be described as that the second data includes N data groups, or that the M1 first codewords include N data groups. The N data groups include encoded K data groups and Q encoded overhead data groups, that is, N=K+Q.

Optionally, the lengths of the N data groups are the same.

Optionally, the first codeword is generated by encoding the data on the same number of symbols selected from each of the K data groups using the first coding scheme. That is to say, in the process of generating a first codeword, the data selected by the first node from each of the K data groups occupies the same number of symbols or bits.

Optionally, the first codeword is generated by using the first encoding scheme to encode and generate the data on symbols at the same position selected from each of the K data groups. That is to say, in the process of generating a first codeword, the symbols or bits occupied by the data selected by the first node from each of the K data groups are the same.

Optionally, the first codeword is generated by encoding the data on the same number of symbols selected from the same position in each of the K data groups using the first coding scheme. That is to say, in the process of generating a first codeword, the first node selects data on the same number of symbols or bits from the same position in each of the K data groups.

Optionally, each of the N data groups includes an identifier representing the second data.

That is, after the second node receives the data groups, it can judge which data groups belong to the data groups of the second data through the identification in the data groups.

It should be understood that the second data is generated by encoding the first data, so the identifier representing the second data may also represent the first data.

In step S330, the first node sends the second data to the second node, and correspondingly, the second node receives the second data.

The process of encoding the first data using the first encoding scheme to generate the second data will be illustrated below with reference to FIGS. 4-6 .

For example, as shown in FIG. 4, the first node divides the first data into K data groups, and then arranges the K data groups vertically. After the arrangement, data group 1, data group 2, ..., data groups K As shown in Figure 5, each data group is composed of data units in the horizontal direction, and the data units can be symbols or bits. The data unit occupied by a dotted line box in the vertical direction in each data group is the minimum coding unit of the data group, and the minimum coding unit is different in different domains, for example, in the binary domain, the minimum coding unit is 1 bit , in a finite field, the minimum coding unit is 1 symbol, which is not limited in this application.

In the process of encoding the first data using the first encoding scheme, assuming that the K data groups have the same length, the second data shown in Figure 6 is generated after encoding, the second data includes N data groups, and the N data groups The lengths are the same, N is an integer greater than K, and the extra data group after encoding using the first encoding scheme is encoding overhead.

The second data includes M1 first codewords (a column of the second data is a first codeword), for a first codeword, for example the leftmost first codeword shown in Figure 6, the first codeword The codeword can be obtained by using the first encoding scheme to select the data in a data unit of each data group in the K data groups shown in Figure 5, and in the process of selecting the data unit, each data The number of data units selected by the groups is the same, and the positions of the data units selected in each data group can be the same (for example, the first row of data units is taken in K data groups), or different (for example, interleaved coding, in the data group 1 selects the data unit in column 1, selects the data unit in column 2 in data group 2, selects the data unit in column 1 in data group 3, selects the data unit in column 2 in data group 4, and so on, in data group K- 1 selects the data unit in the first column, and selects the data unit in the second column in the data group K). It should be understood that, in the process of generating different first codewords, the number of data units selected in the K data groups may be different. For example, the first codeword #1 is obtained by using the first encoding scheme for data selected from one data unit of each data group, and the first codeword #2 is obtained by using the first coding scheme for data selected from two data units of each data group The data are obtained using the first encoding scheme.

It should be understood that each data group included in the second data includes position information, and the position information is the position of the data group in the second data. For example, data group 4 in FIG. 6 includes position information, and the position information indicates Data group 4 is in the fourth row of the second data. The data receiving node (second node) can restore the second data according to the location information, and determine M1 first codewords. Or, the data group included in the second data may not include position information, and the first node sends the N data groups sequentially according to the vertical arrangement position of each data group in the N data groups, and the second node may send the N data groups according to the received The sequence of the data groups restores the second data as shown in FIG. 6 .

It should also be understood that the above description about FIG. 6 is only an example and does not limit the present application.

After encoding the first data using the first encoding scheme, the second data can be processed in three ways:

Method 1 (without second encoding)

As shown in Figure 4, the first node adds a header to each of the N data groups belonging to the second data generated by encoding using the first encoding scheme, and the header includes routing information and control information for intermediate switching Nodes forward data.

The first node adds a preamble for delimitation to the N data groups after the header is added.

For example, a preamble may be added to one data group, or the same preamble may be added to multiple data groups, which is not limited in this application.

Step S330 is replaced by the first node sending the second data to the second node, wherein the second data includes N data groups added with a preamble and a header. Correspondingly, the second node receives the second data.

For the second node, after receiving the data (including the second data), the second node identifies the data group according to the delimitation of the preamble, and determines the data group belonging to the second data, and judges whether the second data has a missing data group Condition.

It should be understood that the second data includes M1 first codewords, which may also be described as that the second data includes N data groups, or that the M1 first codewords include N data groups. As shown in FIG. 6 , the second data is divided horizontally, and each row is a data group; the second data is divided vertically, and each column is a first codeword. When the first node sends the second data to the second node, it is sent in the form of a data group, and correspondingly, when the second node receives the second data, it is also received in the form of a data group. The second node can longitudinally arrange the received data groups belonging to the second data according to the received data groups and the location information included in the data groups, as shown in Figure 6 after the arrangement, so M1 can be determined after the vertical arrangement For the first codeword, if there is a lost data group, the lost data group can be restored by decoding the first codeword.

Optionally, the second node starts a timer after receiving the first data group belonging to the second data, if before the timer ends, the number of data groups belonging to the second data received by the second node is less than N, it is determined that the second data has a missing data group; if the number of data groups belonging to the second data received by the second node is equal to N before the timer expires, it is determined that the second data has no missing data group.

For example, the second data includes 10 data groups, and if only 9 data groups belonging to the second data are received before the timer expires, it is considered that there is a missing data group in the second data. If 10 data groups belonging to the second data are received before the timer expires, it is considered that the second data has no missing data groups.

It should be understood that the above-mentioned timer may be a period of time set artificially.

Optionally, the second node caches the received data group, and if it is determined that the second data has a missing data group, the second node restores the missing data group according to the cached data group belonging to the second data.

Optionally, the data group belonging to the second data includes position information, and the second node determines a first code word according to the received data group belonging to the second data and the position information in the data group, and uses the first code word The first decoding recovers the lost data set.

It should be understood that the first decoding is decoding corresponding to the first encoding, for example, the first decoding is decoding corresponding to FEC, which is not limited in the present application.

Optionally, the data group received by the second node includes an identifier representing the second data.

It should be understood that the second node can distinguish whether the data group belongs to the second data according to the identifier in the data group.

Optionally, the second node clears the cached data group.

For example, if the second data is completely received by the second node within a set period of time, for example, before the timer expires, it is determined that no packet loss occurs for the second data during data transmission, and at this time, the timing can be stopped and the cache can be cleared The data group belonging to the second data.

If the second data is not completely received by the second node within the set time period, for example, before the timer expires, that is to say, packet loss occurs during the transmission of the second data, then according to the method mentioned above The lost data group is restored. After the restoration is completed, the complete second data is handed over to the upper layer for processing, and then the cached data group belonging to the second data is cleared.

If restoring the lost data group according to the method mentioned above fails to restore the data group, the cached data group belonging to the second data may also be cleared at this time. During this process, the physical layer fails to recover the lost packets, and the data is handed over to the upper layer for processing, and the upper layer may notify the first node to resend the second data.

It should be understood that since the cache resource at the switch node in the data exchange network has an upper limit, clearing the cache can release the cache resource at the switch node (the second node), and also avoid failures caused when the cache of the switch node reaches the upper limit. Packet loss, thereby improving the performance of data transmission.

Method 2 (encoding for the second time, header and payload are encoded together):

As shown in FIG. 4 , the first node adds a header to each of the N data groups encoded and generated using the first encoding scheme, and the header includes routing information and control information for forwarding data by the intermediate switching node.

The first node uses the second encoding scheme to encode the N data groups added with headers to generate third data, and the third data includes M2 second codewords, which are used for all data of U data groups and headers Generated by encoding in the second encoding scheme, 1≤U≤N, 1≤M2≤N.

It should be understood that the third data generated by encoding using the second encoding scheme includes N data groups, that is, during the encoding process using the second encoding scheme, the number of data groups before encoding and after encoding does not change, but , when encoding using the second encoding scheme, a second codeword is generated based on all data in at least one data group.

It should also be understood that the third data includes M2 second codewords, which may also be described as the third data including N data groups, or the M2 second codewords including N data groups.

Exemplarily, the second data includes 10 data groups, and the third data generated by encoding using the second encoding scheme also includes 10 data groups, and the third data can also be described as including 5 second codewords (the The 2 data groups of are encoded as a whole using the second coding scheme to generate a second codeword, so the third data can also be described as including 5 second codewords).

The U data groups are the coding units of the second encoding. Assuming U=1, it can be understood that, for all the data of one data group in the N data groups after adding the header, use the second coding scheme to encode to generate a second codewords, at this time, M2=N, that is, the third data includes N second codewords. Assuming U=2, it can be understood that, for all the data of the two data groups in the N data groups after adding the header, use the second encoding scheme to encode and generate a second codeword. At this time, if N is an even number, then M2=N/2, that is, the third data includes N/2 second code words; if N is an odd number, then M2=(N+1)/2, that is, the third data includes (N+1)/2 second code words Two code words.

It should be understood that in mode 2, as shown in FIG. 4 , the data group (payload) and the header are encoded using the same code (second code) to generate a second codeword, that is, to generate third data.

Afterwards, the first node adds a preamble for delimitation to the second codeword in the third data.

Exemplarily, a second codeword (which may be generated by encoding one data group, or generated by encoding multiple data groups) may be added with a preamble, or multiple second codewords may be added with the same preamble. There is no restriction on this.

Step S330 is replaced by the first node sending third data to the second node, where the third data includes a preamble and a header. Correspondingly, the second node receives the third data.

For the second node, after receiving the data (including the third data), the second node identifies the data group according to the delimitation of the preamble, and determines the data group belonging to the third data.

The second node can use the second decoding to M2 second codewords (including the payload and the header, because the first node encodes the data group and the header together through the second codeword generated by the second encoding scheme) to generate the second codeword Two data and header.

After the second data is generated, it is judged whether there is a missing data group in the second data.

Specifically, the method for the second node to judge whether the second data has lost a data group, and in the case of determining that the second data has lost a data group, the method for the second node to retrieve the lost data group, and other operations of the second node , you can refer to the description of the specific operation steps of the second node in mode 1, for the sake of brevity, details are not repeated here.

Method 3 (encoding for the second time, header and payload are encoded separately):

As shown in Figure 7, the first node uses the second encoding scheme to encode the N data groups generated using the first encoding scheme to encode the third data, the third data includes M2 second codewords, and the second codewords are All the data in the U data groups are generated by encoding using the second encoding scheme, 1≤U≤N, and M2 is an integer greater than 1.

The U data groups are the coding units of the second encoding. Assuming U=1, it can be understood that, for all the data of one data group in the N data groups, use the second coding scheme to encode and generate a second codeword, here , M2=N, that is, the third data includes N second codewords. Assuming U=2, it can be understood that, for all the data of the two data groups in the N data groups, use the second encoding scheme to encode and generate a second code word. At this time, if N is an even number, then M2=N/ 2, that is, the third data includes N/2 second codewords; if N is an odd number, then M2=(N+1)/2, that is, the third data includes (N+1)/2 second codewords.

Next, the first node adds a header to each second codeword in the third data, where the header includes routing information and control information, and the header is encoded using a third encoding scheme to generate a header codeword.

It should be understood that in manner 3, the data group (payload) and the header are respectively encoded using different encodings.

After respectively encoding the data group and the header, the first node adds a preamble for delimitation to the third data to which the header is added.

For example, when adding a preamble to the second codeword included in the third data, one preamble may be added to one second codeword, or the same preamble may be added to multiple second codewords, which is not limited in this application.

Step S330 may be replaced by the first node sending the third data to the second node, where the third data includes a preamble and a header. Correspondingly, the second node receives the third data.

For the second node, after receiving the data (including the third data), the second node identifies the data group according to the delimitation of the preamble, and determines the data group belonging to the third data.

The second node uses the third decoding for the header codeword to generate the header, and uses the first decoding method for the M2 second codewords (including the load, because the second codeword is generated by the first node encoding the data group using the second coding scheme). Second decoding to generate second data.

After the second data is generated, it is judged whether there is a missing data group in the second data.

Specifically, the method for the second node to judge whether the second data has lost a data group, and in the case of determining that the second data has lost a data group, the method for the second node to retrieve the lost data group, and other operations of the second node , you can refer to the description of the specific operation steps of the second node in mode 1, for the sake of brevity, details are not repeated here.

In modes 1, 2, and 3, the second node can receive or forward data according to the routing information and control information included in the header. For the data of this node, extract the payload from the data group and submit it to the upper layer for processing.

Optionally, the first coding scheme, the second coding scheme, or the third coding scheme in the foregoing embodiments include FEC.

Optionally, the first decoding, the second decoding, or the third decoding in the foregoing embodiment includes decoding corresponding to FEC.

FIG. 8 is a schematic diagram of data processed by two encodings provided by the embodiment of the present application.

Figure 8 is a specific example of the data to be sent (the first data above) encoded using the first code (vertical code) and the second code (horizontal code) (the third data above), using the first code The third data encoded by the second encoding scheme includes 98 data groups and 2 overhead data groups (the overhead generated during the encoding process using the first encoding scheme), that is, the above-mentioned first data is divided into K data group, using the first code to generate N data groups for K data groups, and N data groups include encoded K data groups and Q overhead data groups, where K=98 and Q=2 in the example shown in FIG. 8 , N=100, the header of each data group after two encodings occupies 9 symbols or bits, the position information in each data group occupies 1 symbol or bit, and the load in each data group occupies 504 symbols or bits Bits, the overhead of encoding each data group using the second encoding scheme occupies 30 symbols or bits, and the above number of symbols or bits is only an example and does not limit the present application.

In the embodiment provided in this application, the second coding scheme adopts KP4 FEC, that is, Reed-Solomon code (ReedSolomon, RS) (544, 514), which is constructed based on Galois field (Galois field, GF) (2 ¹⁰ ), The error correction capability is 15 in-field symbols.

For the scheme provided by this application, the first coding scheme (vertical) is additionally added on the basis of the second coding scheme (horizontal), in order to make data distribution easy, the first coding scheme can be constructed based on GF(2 ¹⁰ ) The RS (100,98) codeword, when the RS codeword is used for error correction and erasure correction, can restore the data carried by any two lost symbols in the domain.

It should be understood that the first codeword can be arbitrarily designed according to requirements, so as to balance the retrieval capability and indicators such as overhead, delay, and cache, and this application does not limit this.

In the above-mentioned embodiment illustrated in FIG. 8 , an additional 2% overhead can be allowed to allow any of the 100 data groups less than or equal to two data groups to be discarded during data exchange, and the receiving node (second node) can completely find Return the lost data set.

Using the method provided by the embodiment of the present application, in the case of packet loss, the delay of retrieving the lost data group through the first codeword can be understood as the sum of the delay of completely collecting the data group and the delay of erasure correction decoding. Compared with the delay from when the upper layer discovers the packet loss and starts the retransmission mechanism to when the complete data group is received again, the method provided by the embodiment of the present application can reduce the delay of exchanging data.

It should be understood that the methods provided in the embodiments of the present application may be used alone or in combination, which is not limited in the present application.

It should be noted that the execution subject mentioned in the above method embodiment is only an example, and the execution subject may also be a chip, a chip system, or a processor that supports the execution subject to implement the above method embodiment, and this application does not limit this .

The method embodiments of the embodiments of the present application are described above with reference to the accompanying drawings, and the device embodiments of the embodiments of the present application are described below. It can be understood that the descriptions of the method embodiments and the descriptions of the device embodiments may correspond to each other, therefore, the undescribed parts may refer to the foregoing method embodiments.

It can be understood that, in the above method embodiments, the methods and operations implemented by the first node may also be implemented by components (such as chips or circuits) that can be used for the first node, and the methods and operations implemented by the second node, It can also be implemented by components (such as chips or circuits) available for the second node.

The foregoing mainly introduces the solution provided by the embodiment of the present application from the perspective of interaction between nodes. It can be understood that each network element, such as a transmitting end device or a receiving end device, includes a corresponding hardware structure and/or software module for performing each function in order to realize the above functions. Those skilled in the art should be aware that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software drives hardware depends on the specific application and design constraints of the technical solution. Skilled artisans may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

The embodiment of the present application can divide the functional modules of the transmitting end device or the receiving end device according to the above method example, for example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module middle. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules. It should be noted that the division of modules in the embodiment of the present application is schematic, and is only a logical function division, and there may be other division methods in actual implementation. In the following, description will be made by taking the division of each functional module corresponding to each function as an example.

Fig. 9 is a schematic block diagram of an apparatus for processing data provided by an embodiment of the present application. The device 400 includes a transceiver unit 410 and a processing unit 420 . The transceiver unit 410 can communicate with the outside, and the processing unit 420 is used for data processing. The transceiver unit 410 may also be called a communication interface or a communication unit.

Optionally, the apparatus 400 may further include a storage unit, which may be used to store instructions and/or data, and the processing unit 420 may read instructions or and/or data in the storage unit.

In one design, the device 400 may be the first node in the data exchange network, the transceiver unit 410 is used to perform the receiving or sending operation of the first node in the method embodiment above, and the processing unit 420 is used to perform the above The internal processing operation of the first node in the method embodiment.

In another design, the apparatus 400 may be a device including the first node. Alternatively, the apparatus 400 may be a component configured in the first node, for example, a chip in the first node. In this case, the transceiver unit 410 may be an interface circuit, a pin, and the like. Specifically, the interface circuit may include an input circuit and an output circuit, and the processing unit 420 may include a processing circuit.

In a possible implementation manner, the processing unit 420 is configured to divide the first data into K data groups, K is an integer greater than 1, the first data is data sent to the second node, and the processing unit 420 is further configured to Encoding the K data groups using the first coding scheme to obtain second data, the second data includes M1 first code words, and the first code words are selected from each data group of the K data groups Part of the data is encoded using the first encoding scheme to generate codewords, M1 is an integer greater than 1; the transceiver unit 410 is configured to send the second data to the second node.

Based on the above scheme, in the process of generating the first codeword, the data in each data group is selected, so at the receiving end (second node) of the second data, if the data group belonging to the second data is lost, it can be The lost data group is retrieved according to the decoding of the first codeword, thereby improving the efficiency of data exchange.

In a possible implementation manner, the M1 first codewords include N data groups, and the first data group in the N data groups includes position information, and the position information indicates that the first data group is within the N data groups The position in , the first data group is any data group in the N data groups, and N is an integer greater than K.

Based on the above scheme, adding position information to the data group encoded using the first coding scheme can make the receiving end of the second data recover the data encoded using the first coding scheme according to the received position information in each data group. The arrangement of the data groups, so as to determine the first codeword for recovering the lost data groups.

In a possible implementation manner, the lengths of the N data groups are the same.

In a possible implementation manner, when the processing unit 420 encodes and generates the first codeword using the first encoding scheme, the number of symbols carrying data selected in each of the K data groups is the same.

In a possible implementation manner, when the processing unit 420 encodes and generates the first codeword using the first encoding scheme, the positions of the symbols carrying data selected in each of the K data groups are the same.

In a possible implementation, the M1 first codewords include N data groups, where N is an integer greater than K, and the processing unit 420 is further configured to encode the N data groups using a second encoding scheme to generate a third data, the third data includes M2 second codewords, the second codewords are codewords generated by encoding all the data of the U data groups using the second coding scheme, and the U data groups are selected from the N data groups group, 1≤U≤N, 1≤M2≤N, the transceiver unit 410 is configured to send the third data to the second node.

Based on the above scheme, on the basis of using the first encoding scheme, use the second encoding scheme to encode the N data groups again, so that each data group can be transmitted accurately, avoiding garbled characters and errors during the transmission of the data groups. code.

In a possible implementation manner, each of the N data groups includes an identifier representing the second data.

Based on the above solution, after the second node receives the data group, it can use the identifier to distinguish the data group belonging to the second data, so as to more accurately judge whether there is a missing data group in the second data during the data exchange process.

In a possible implementation manner, the first coding scheme includes forward error correction coding (FEC).

In a possible implementation manner, the second coding scheme includes forward error correction coding (FEC).

Fig. 10 is a schematic block diagram of an apparatus for processing data provided by an embodiment of the present application. The device 500 includes a transceiver unit 510 and a processing unit 520 . The transceiver unit 510 can communicate with the outside, and the processing unit 520 is used for data processing. The transceiver unit 510 may also be called a communication interface or a communication unit.

Optionally, the apparatus 500 may further include a storage unit 530, which may be used to store instructions and/or data, and the processing unit 520 may read instructions or and/or data in the storage unit 530.

In one design, the device 500 may be a second node in the data exchange network, the transceiver unit 510 is used to perform the receiving or sending operation of the second node in the method embodiment above, and the processing unit 520 is used to perform the above The internal processing operation of the second node in the method embodiment.

In another design, the apparatus 500 may be a device including the second node. Alternatively, the apparatus 500 may be a component configured in the second node, for example, a chip in the second node. In this case, the transceiver unit 510 may be an interface circuit, a pin, and the like. Specifically, the interface circuit may include an input circuit and an output circuit, and the processing unit 520 may include a processing circuit.

In a possible implementation manner, the transceiver unit 510 is configured to receive a data group belonging to the second data from the first node, the second data includes M1 first codewords, and the first codeword is a pair of K data Part of the data selected in each data group of the group is encoded using the first encoding scheme to generate a codeword, and K and M1 are integers greater than 1.

Based on the above scheme, since the first node selects the data in each data group during the process of generating the first codeword, the second node can, in the case of losing the data group of the second data, update the first codeword Word decoding retrieves lost data groups, thereby improving the efficiency of data exchange.

In a possible implementation manner, the M1 first codewords include N data groups, where N is an integer greater than K, and the processing unit 520 is configured to receive the first data group belonging to the second data at the transceiver unit 510 Begin to open the timer, if before the timer ends, the number of data groups belonging to the second data received by the transceiver unit 510 is less than N, then the processing unit 520 determines that the second data has missing data groups, if the timer ends Before, the number of data groups belonging to the second data received by the transceiver unit 510 is equal to N, and the processing unit 520 determines that there is no missing data group of the second data.

Based on the above solution, a time period can be set artificially, and whether there is a packet loss problem in the data can be judged within the time period, so as to avoid judgment delay.

In a possible implementation manner, the storage unit 530 is used to buffer the received data group, and the processing unit 520 is also used to determine that the second data has a missing data group, according to the data received by the transceiver unit 510 belonging to the second The data set of data restores the lost data set.

In a possible implementation manner, the second data includes N data groups, the first data group in the N data groups includes position information, and the first data group is any data group in the N data groups, The processing unit 520 is also configured to determine the first codeword according to the data group belonging to the second data received by the transceiver unit 510 and the position information in the data group, and use the first decoding to restore the lost codeword to the first codeword. data group.

Based on the above scheme, the second node restores the arrangement of the data group encoded by the first node using the first coding scheme through the position information added by the first node in the data group encoded using the first coding scheme, so as to determine that the lost The first codeword of the data group.

In a possible implementation manner, the processing unit 520 is further configured to clear the data group of the second data cached in the storage unit 530 .

Based on the foregoing solution, the cache capacity at the second node is increased by clearing the cache.

In a possible implementation manner, the lengths of the N data groups are the same.

In a possible implementation manner, the first codeword is a codeword generated by encoding the data on the same number of symbols selected from each of the K data groups using the first coding scheme.

In a possible implementation manner, the symbols of the same number have the same position in each of the K data groups.

In a possible implementation manner, each of the N data groups includes an identifier representing the second data.

Based on the above scheme, after receiving the data group, the second node can use the identifier to distinguish the data group belonging to the second data, so as to more accurately judge whether there is a missing data group in the second data.

In a possible implementation manner, the M1 first codewords include N data groups, the transceiver unit 510 is configured to receive third data from the first node, the third data includes M2 second codewords, and the first The second codeword is a codeword generated by encoding all the data of the U data groups using the second coding scheme, 1≤U≤N, 1≤M2≤N, the U data groups are selected from the N data groups, the The processing unit 520 is further configured to use second decoding on the M2 second codewords to generate second data.

Based on the above scheme, because the second data has been encoded twice, the second node can accurately receive each data group through the second decoding (if any data group has an error during transmission, the second node can pass the second Decoding performs error correction on the data group), and the lost data group can be recovered through the first decoding.

In a possible implementation manner, the first decoding includes decoding corresponding to a forward error correction code (FEC).

In a possible implementation manner, the second decoding includes decoding corresponding to a forward error correction code (FEC).

As shown in FIG. 11 , the embodiment of the present application further provides an apparatus 600 for processing data. The device 600 includes a processor 610, the processor 610 is coupled with a memory 620, the memory 620 is used to store computer programs or instructions or and/or data, and the processor 610 is used to execute the computer programs or instructions and/or data stored in the memory 620, The methods in the above method embodiments are executed.

Optionally, the apparatus 600 includes one or more processors 610 .

Optionally, as shown in FIG. 11 , the apparatus 600 may further include a memory 620 .

Optionally, the apparatus 600 may include one or more memories 620 .

Optionally, the memory 620 may be integrated with the processor 610, or set separately.

Optionally, as shown in FIG. 11 , the apparatus 600 may further include a transceiver 630 and/or a communication interface, and the transceiver 630 and/or the communication interface are used for receiving and/or sending signals. For example, the processor 610 is configured to control the transceiver 630 and/or the communication interface to receive and/or send signals.

As a solution, the apparatus 600 is configured to implement the operations performed by the first node in the above method embodiments. For example, the processor 610 is configured to implement the operations performed internally by the first node in the above method embodiments, and the transceiver 630 is configured to implement the receiving or sending operations performed by the first node in the above method embodiments. The processing unit 420 in the apparatus 400 may be the processor in FIG. 11 , and the transceiver unit 410 may be the transceiver in FIG. 11 . For the operations performed by the processor 610, reference may be made to the description of the processing unit 420 above, and for the operations performed by the transceiver 630, reference may be made to the description of the transceiver unit 410, which will not be repeated here.

As shown in FIG. 12 , the embodiment of the present application further provides an apparatus 700 for processing data. The device 700 includes a processor 710, the processor 710 is coupled with a memory 720, the memory 720 is used to store computer programs or instructions and/or data, and the processor 710 is used to execute the computer programs or instructions and/or data stored in the memory 720, The methods in the above method embodiments are executed.

Optionally, the apparatus 700 includes one or more processors 710 .

Optionally, as shown in FIG. 12 , the apparatus 700 may further include a memory 720 .

Optionally, the apparatus 700 may include one or more memories 720 .

Optionally, the memory 720 may be integrated with the processor 710, or set separately.

Optionally, as shown in FIG. 12 , the apparatus 700 may further include a transceiver 730 and/or a communication interface, and the transceiver 730 and/or the communication interface are used for receiving and/or sending signals. For example, the processor 710 is configured to control the transceiver 730 to receive and/or send signals.

As a solution, the apparatus 700 is used to implement the operations performed by the second node in the above method embodiments.

For example, the processor 710 is configured to implement the operations performed internally by the second node in the above method embodiments, and the transceiver 730 is configured to implement the receiving or sending operations performed by the second node in the above method embodiments. The processing unit 520 in the apparatus 500 may be the processor in FIG. 12 , and the transceiver unit 510 may be the transceiver and/or the communication interface in FIG. 12 . For the operations performed by the processor 710, reference may be made to the description of the processing unit 520 above, and for the operations performed by the transceiver 730, reference may be made to the description of the transceiver unit 510, which will not be repeated here.

The embodiment of the present application also provides a device for processing data, including a processor, the processor is coupled with the input/output interface, and the data is transmitted through the input/output interface, and the processor is used to execute the method in any one of the above method embodiments. method.

As shown in FIG. 13 , the embodiment of the present application also provides an apparatus 800 for processing data. The device 800 includes a logic circuit 810 and an input/output interface (input/output interface) 820 .

Wherein, the logic circuit 810 may be a processing circuit in the device 800 . The logic circuit 810 may be coupled to the storage unit, and invoke instructions in the storage unit, so that the device 800 can implement the methods and functions of the various embodiments of the present application. The input/output interface 820 may be an input/output circuit in the device 800, which outputs information processed by the device 800, or inputs data or signaling information to be processed into the device 800 for processing.

As a solution, the apparatus 800 is configured to implement the operations performed by the first node in each method embodiment above.

For example, the logic circuit 810 is used to implement the processing-related operations performed by the first node in the above method embodiments, and the input/output interface 820 is used to implement the sending and/or reception performed by the first node in the above method embodiments related operations. For the operations performed by the logic circuit 810 , refer to the above description of the processing unit 420 , and for the operations performed by the input/output interface 820 , refer to the above description for the transceiver unit 410 , which will not be repeated here.

As another solution, the apparatus 800 is configured to implement the operations performed by the second node in the foregoing method embodiments.

For example, the logic circuit 810 is used to implement the processing-related operations performed by the second node in the above method embodiments, and the input/output interface 820 is used to implement the sending and/or reception performed by the second node in the above method embodiments related operations. For the operations performed by the logic circuit 810 , refer to the above description of the processing unit 520 , and for the operations performed by the input/output interface 820 , refer to the above description for the transceiver unit 510 , which will not be repeated here.

It should be understood that the above-mentioned device may be one or more chips. For example, the device may be a field programmable gate array (field programmable gate array, FPGA), an application specific integrated circuit (ASIC), a system on chip (SoC), or a central The processor (central processor unit, CPU), can also be a network processor (network processor, NP), can also be a digital signal processing circuit (digital signal processor, DSP), can also be a microcontroller (microcontroller unit, MCU) , and can also be a programmable logic device (programmable logic device, PLD) or other integrated chips.

In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The steps of the methods disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware. To avoid repetition, no detailed description is given here.

It should be noted that the processor in the embodiment of the present application may be an integrated circuit chip, which has a signal processing capability. In the implementation process, each step of the above-mentioned method embodiments may be completed by an integrated logic circuit of hardware in a processor or instructions in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components . Various methods, steps, and logic block diagrams disclosed in the embodiments of the present application may be implemented or executed. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.

It can be understood that the memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories. Among them, the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically programmable Erases programmable read-only memory (electrically EPROM, EEPROM) or flash memory. Volatile memory can be random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, many forms of RAM are available such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) And direct memory bus random access memory (directrambus RAM, DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

An embodiment of the present application also provides a data exchange system, and the system includes a first node and a second node.

According to the method provided by the embodiment of the present application, the present application also provides a computer-readable medium, the computer-readable medium stores program code, and when the program code is run on the computer, the computer is made to execute the method of the above-mentioned embodiment . For example, when the computer program is executed by a computer, the computer can implement the method executed by the first node or the method executed by the second node in the above method embodiments.

The embodiment of the present application also provides a computer program product including instructions, which, when executed by a computer, enable the computer to implement the method executed by the first node or the method executed by the second node in the above method embodiments.

For explanations and beneficial effects of relevant content in any data processing device provided above, reference may be made to the corresponding method embodiments provided above, and details are not repeated here.

In the above embodiments, all or part of them may be implemented by software, hardware, firmware or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media. The available medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, a solid state disk (solid state disc, SSD)) etc.

The network equipment and terminal equipment in the above-mentioned various apparatus embodiments correspond to the network equipment and terminal equipment in the method embodiments, and corresponding steps are performed by corresponding modules or units, for example, the communication unit (transceiver) performs the receiving or receiving in the method embodiments. In the sending step, other steps besides sending and receiving may be performed by a processing unit (processor). For the functions of the specific units, reference may be made to the corresponding method embodiments. Wherein, there may be one or more processors.

The terms "component", "module", "system" and the like are used in this specification to refer to a computer-related entity, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be components. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. A component may, for example, be based on a signal having one or more packets of data (e.g., data from two components interacting with another component between a local system, a distributed system, and/or a network, such as the Internet via a signal interacting with other systems). Communicate through local and/or remote processes.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

Those skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or May be integrated into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.

If the functions described above are realized in the form of software function units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disc and other media that can store program codes. .

The above is only a specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the application. Should be covered within the protection scope of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims (27)

1. A method for processing data, characterized in that the method is applied to a data exchange network, comprising: The first node divides the first data into K data groups, K is an integer greater than 1, and the first data is data sent to the second node; The first node encodes the K data groups using a first coding scheme to obtain second data, the second data includes M1 first codewords, and the first codewords are pairs from the K data groups Part of the data selected in each data group of the data group is encoded using the first coding scheme to generate a codeword, and M1 is an integer greater than 1; The first node sends the second data to the second node. 2. The method according to claim 1, wherein the M1 first codewords include N data groups, the first data group in the N data groups includes position information, and the position information indicates The position of the first data group in the N data groups, the first data group is any data group in the N data groups, and N is an integer greater than K. 3. The method according to claim 1 or 2, characterized in that the lengths of the N data groups are the same. 4. according to the method described in any one in claim 1 to 3, it is characterized in that, when using the first encoding scheme encoding to generate described first code word, in each data group of described K data groups, select The same number of symbols that carry data. 5. according to the method described in any one in claim 1 to 4, it is characterized in that, when using the first encoding scheme encoding to generate described first codeword, select in each data group of described K data groups The location of the symbol that carries the data is the same. 6. according to the method described in any one in claim 1 to 5, it is characterized in that, described M1 the first code word comprises N data groups, and N is the integer greater than K, and described method also comprises: The first node encodes the N data groups using a second coding scheme to generate third data, the third data includes M2 second codewords, and the second codeword is for U data groups Codewords generated by encoding all data using the second encoding scheme, the U data groups are selected from the N data groups, 1≤U≤N, 1≤M2≤N; The first node sending the second data to the second node includes: The first node sends the third data to the second node. 7. The method according to any one of claims 2 to 6, wherein each data group of the N data groups includes an identifier characterizing the second data. 8. A method for processing data, characterized in that the method is applied to a data exchange network, comprising: The second node receives a data group belonging to the second data from the first node, the second data includes M1 first codewords, and the first codeword is selected from each data group of the K data groups Part of the data of is encoded using the first encoding scheme to generate codewords, and K and M1 are integers greater than 1. 9. method according to claim 8, is characterized in that, described M1 first code words comprise N data groups, and N is the integer greater than K, and described method also comprises: The second node starts a timer upon receiving the first data group belonging to the second data, If the number of data groups belonging to the second data received by the second node is less than N before the timer expires, then determine that there is a missing data group in the second data; If the number of data groups belonging to the second data received by the second node is equal to N before the timer expires, it is determined that there is no missing data group for the second data. 10. The method according to claim 9, further comprising: The second node caches the received data set; If it is determined that the second data has a missing data group, the second node recovers the missing data group according to the received data group belonging to the second data. 11. The method according to claim 10, wherein the first data group in the N data groups includes position information, and the first data group is any data group in the N data groups , the second node restores the lost data group according to the received data group belonging to the second data, including: The second node determines the M1 first codewords according to the received data group belonging to the second data and the position information in the data group; The second node recovers the lost data group by using the first decoding for the M1 first codewords. 12. The method according to any one of claims 9 to 11, wherein the lengths of the N data groups are the same. 13. The method according to any one of claims 8 to 12, wherein the first codeword is on the same number of symbols selected from each data group in the K data groups The data is encoded using the first encoding scheme to generate a codeword. 14. The method according to claim 13, wherein the symbols of the same number have the same positions in each of the K data groups. 15. The method according to any one of claims 9 to 14, wherein each data group of the N data groups includes an identifier characterizing the second data. 16. The method according to any one of claims 8 to 15, wherein the M1 first codewords include N data groups, and the second node receives the second data from the first node data set, including: The second node receives third data from the first node, the third data includes M2 second codewords, and the second codeword uses a second encoding scheme for all data of U data groups Codewords generated by encoding, 1≤U≤N, 1≤M2≤N, the U data groups are selected from the N data groups; The second node uses second decoding on the M2 second codewords to generate the second data. 17. A device for processing data, characterized in that the device is a device in a data exchange network, comprising: a processing unit, configured to divide the first data into K data groups, K is an integer greater than 1, and the first data is data sent to the second node; the processing unit is also configured to process the K data The group is encoded using the first coding scheme to obtain second data, the second data includes M1 first codewords, and the first codeword is a part selected from each data group of the K data groups The data is encoded using the first encoding scheme to generate a codeword, and M1 is an integer greater than 1; A transceiver unit, configured to send the second data to the second node. 18. The device according to claim 17, wherein the M1 first codewords include N data groups, the first data group in the N data groups includes position information, and the position information indicates The position of the first data group in the N data groups, the first data group is any data group in the N data groups, and N is an integer greater than K. 19. The device according to claim 17 or 18, wherein the lengths of the N data groups are the same. 20. The device according to any one of claims 17 to 19, wherein when the processing unit uses the first encoding scheme to encode and generate the first codeword, each of the K data groups The number of symbols carrying data selected in the data group is the same. 21. The device according to any one of claims 17 to 20, wherein when the processing unit uses the first encoding scheme to encode and generate the first codeword, each of the K data groups The positions of the selected data-carrying symbols in the data group are the same. 22. The device according to any one of claims 17 to 21, wherein the M1 first codewords include N data groups, where N is an integer greater than K, The processing unit is further configured to encode the N data groups using a second coding scheme to generate third data, the third data includes M2 second codewords, and the second codewords are U All data of the data group is encoded using the second coding scheme to generate a codeword, the U data groups are selected from the N data groups, 1≤U≤N, 1≤M2≤N; The transceiving unit is configured to send the third data to the second node. 23. The device according to any one of claims 18 to 22, wherein each data group of the N data groups includes an identifier representing the second data. 24. A device for processing data, characterized in that the device is a device in a data exchange network, the device includes a processor, the processor is coupled with a memory, the memory stores instructions, and the instructions are When the processor runs, causing the processor to perform the method according to any one of claims 1 to 7, or causing the processor to execute the method according to any one of claims 8-16. 25. A device for processing data, characterized in that the device is a device in a data exchange network, and the device includes a logic circuit for coupling with an input/output interface, through which the input/output The interface transmits data to execute the method according to any one of claims 1 to 7, or to execute the method according to any one of claims 8 to 16. 26. A computer-readable storage medium, characterized in that, the computer-readable storage medium is used to store a computer program, and when the computer program is run on a computer, the computer executes the program described in claims 1 to 7. The method according to any one of claims 8 to 16, or causing the computer to execute the method according to any one of claims 8 to 16. 27. A computer program product, characterized in that the computer program product comprises: computer program code, when the computer program code is executed, the method according to any one of claims 1 to 7 is implemented, or Implementing the method as claimed in any one of claims 8 to 16.

Images