A network encoding transmission method, storage medium, and firmware upgrade method

Abstract

This invention relates to the field of data transmission technology, and in particular to a network encoding transmission method, storage medium, and firmware upgrade method. The method includes the following steps: S100, obtaining the data packet reception status of each node in the same broadcast domain; S200, each node generates the length of a transmission contention window based on the data packet reception status; S300, analyzing the scarcity of each file block based on the data packet reception status of each node; the data packet reception status includes received file blocks and unreceived file blocks; S400, the nodes generate encoding results based on the scarcity of each file block; S500, each node broadcasts data packets sequentially according to the length of the transmission contention window and the encoding results; S600, each node receives data packets broadcast by other nodes and decodes the data packets based on its own data packet reception status. This solution can reduce collisions and interference during data transmission and improve data transmission efficiency.

Description

Technical Field

[0001] This invention relates to the field of data transmission technology, and in particular to a network encoding transmission method, a storage medium, and a firmware upgrade method. Background Technology

[0002] With the continuous development of the Internet, the scale of networks is constantly expanding, and the complexity of networks is also continuously increasing. Under this trend, how to complete the upgrade data reception of each node in the entire network topology with numerous nodes and complex lines has become a major challenge.

[0003] In existing technologies, point-to-point routing and forwarding are typically used for round-robin upgrades. While this method has a high success rate, it suffers from time-consuming and inefficient network performance when there are many nodes and complex topologies, as each node needs to transmit data packets sequentially to its child nodes. In addition, existing technologies also use distributed file distribution mechanisms for data packet transmission. This method often employs flooding for broadcast upgrades. Compared to point-to-point data transmission, this method allows data to quickly reach nodes with good communication. However, the collisions and interference caused by flooding are significant, resulting in most nodes with good communication links having already completed their transmissions while the weakest nodes still need to complete theirs before the entire network upgrade can be finished.

[0004] To address the aforementioned issues, existing technologies have improved data transmission methods. First, data packets are transmitted to the bottleneck node using point-to-point routing to achieve global optimization. Then, each child node in the network topology requests missing data from its parent node to achieve local optimization. This approach, combining broadcasting and point-to-point methods, avoids the time-consuming problem of globally using point-to-point data transmission and solves the problems of excessive collisions and interference caused by direct flooding, thus improving data transmission efficiency.

[0005] However, using the above method, in the second stage, child nodes need to frequently request data packets from parent nodes. It is very likely that different nodes will request the same data packets, thus wasting bandwidth and failing to fully utilize the advantages of multicast and local collision domains to optimize file transmission. Its data transmission efficiency still needs to be improved. Summary of the Invention

[0006] This invention provides a network encoding transmission method, a storage medium, and a firmware upgrade method, which can improve data transmission efficiency.

[0007] The basic solution provided by this invention is as follows:

[0008] A network encoding transmission method includes the following steps:

[0009] S300, based on the data packet reception status of each node, analyze the scarcity of each file block; the data packet reception status includes received file blocks and unreceived file blocks;

[0010] S400, the node generates encoding results based on the scarcity of each file block;

[0011] In S500, each node broadcasts data packets based on the encoding results.

[0012] The beneficial effects of Basic Solution 1: The improved data transmission efficiency primarily addresses how to quickly receive data from all nodes in the entire network topology. Using this solution, regardless of whether point-to-point routing and forwarding were used for initial data transmission or a distributed file distribution mechanism was employed, the methods described in this solution can improve the data packet reception efficiency across the entire network topology.

[0013] Specifically, based on the data packet reception status of each node, the prevalence of each file block among the nodes can be analyzed, i.e., the scarcity of each file block can be determined. Then, based on the scarcity of each file block, encoding results are generated, and data packets are broadcast according to the encoding results. This yields a better network encoding and transmission strategy, more quickly increasing the total number of file blocks possessed by each node and accelerating the growth rate of nodes completing the reception of all file blocks. The principle is that a higher scarcity of a file block indicates that a relatively large number of nodes have not received it. Using this scheme, the highly scarce file blocks can be broadcast first, allowing more nodes to receive the required file blocks on the first broadcast, improving the efficiency of the number of nodes completing all data reception in the entire network topology, thereby improving data transmission efficiency. Furthermore, this scheme eliminates the need for frequent replies for each packet during data transmission; each node can autonomously receive data packets, saving on data packet transmission steps and further improving data transmission efficiency.

[0014] Furthermore, the S300 includes:

[0015] S301, obtain the communication success rate between adjacent nodes;

[0016] S302, based on the communication success rate between adjacent nodes and the data packet reception status of each node, analyze the scarcity of each file block and generate scarcity analysis results;

[0017] In S400, the encoding result is generated based on the scarcity analysis results.

[0018] Beneficial effects: The communication success rate between nodes affects whether data transmission can be completed. Therefore, in order to prevent a situation where a file block is highly scarce but the communication success rate is too low, resulting in the inability to quickly and successfully complete data transmission and affecting data transmission efficiency, this scheme comprehensively analyzes the scarcity of each file block based on the communication success rate between adjacent nodes and the data packet reception status of each node, and generates encoding results to further improve data transmission efficiency.

[0019] Furthermore, S302 includes:

[0020] S3021, Based on the communication success rate between adjacent nodes and the data packet reception status of each node, the scarcity of each file block is calculated by weighted average and the scarcity calculation result is generated.

[0021] S3022, Based on the scarcity calculation results, sort the scarcity of each file block and generate scarcity analysis results.

[0022] Beneficial effects: The scarcity calculation results are generated by weighted average scoring, which is simple and helps to improve the efficiency of the calculation results output.

[0023] Furthermore, the scarcity analysis results include the scarcity order of each file block;

[0024] In S400, each file block is XORed with its adjacent file blocks according to the scarcity order of each file block, and the XOR result is used for encoding.

[0025] The network encoding transmission method further includes S500, which generates data packets based on the encoding results and broadcasts the data packets sequentially.

[0026] Beneficial effect: Based on the scarcity order of each file block, each file block is XORed with its adjacent file blocks in turn. For example, if the data to be transmitted includes file blocks 0, 1, 2, and 3, and the scarcity order of each file block is 2>1>0>3, then each file block is XORed pairwise. Specifically... The number of file blocks to be XORed can be selected based on the actual operation. Data packets are then generated based on the encoding results and broadcast sequentially. Therefore, compared to directly broadcasting each file block (requiring four rounds of broadcasting), only three or fewer rounds of broadcasting are needed to complete the reception, resulting in fewer broadcasts and higher data transmission efficiency.

[0027] Furthermore, it also includes S600, where each node receives data packets broadcast by other nodes and decodes the data packets according to its own data packet reception status.

[0028] Beneficial effect: Each node receives data packets broadcast by other nodes, such as file blocks within the received data packets. The node can decode the content of file block 1 based on the encoded content in the data packets broadcast by other nodes and the content of the file blocks it has already received.

[0029] Furthermore, the S600 includes:

[0030] S601, each node receives data packets broadcast by other nodes and determines whether it can decode the data packets based on its own data packet reception status. If yes, then execute S602; otherwise, execute S603.

[0031] S602, decodes the data packet;

[0032] S603 stores the encoded content in the data packets. After receiving other data packets, it combines the encoded content in each data packet and decodes them again.

[0033] Beneficial effects: Each node receives data packets broadcast by other nodes and determines whether it can decode the packets. If so, it decodes them directly; otherwise, it temporarily stores the received packets. For example, if the received data packet contains file blocks... If the node has already received file block 2, it can decode the content of file block 1 based on the encoded content in the data packets broadcast by other nodes and the content of the file blocks it has already received; if the received data packet contains file block 1... The node receives only file block 3, so it cannot decode the data packet. Therefore, in this solution, the encoded content of the data packet is temporarily stored. After receiving other data packets, the encoded content of each data packet is combined with the encoded content of each data packet to decode the data packet again to obtain the content of each file block.

[0034] Furthermore, it also includes:

[0035] S100, obtain the data packet reception status of each node in the same broadcast domain;

[0036] S200, each node generates the length of the transmission contention window based on the data packet reception situation;

[0037] In S500, each node broadcasts data packets sequentially according to the length of the contention window.

[0038] Beneficial effects: Each node generates a sending contention window length based on the received data packets, and then sends packets sequentially according to the length of the sending contention window. This allows nodes that have received more file blocks to send packets first, enabling more file blocks to be sent in the early packet sending process, thus increasing the total number of file blocks held by each node more quickly and accelerating the growth rate of nodes that have completed receiving all file blocks. The principle is that nodes that have received more file blocks have more ways to generate data packets. For example, if a node receives two file blocks, it can only process the file blocks by XORing them pairwise. If another node receives three file blocks, it can process them by XORing them pairwise or by XORing all three file blocks together. In other words, nodes that have received more file blocks have more flexible ways to generate data packets. At the same time, they can also transmit more data information (the XOR result of multiple file blocks) in a single data packet, increasing the amount of data contained in a data packet of the same size, improving the utilization rate of data packets, and thus achieving the effect of rapidly increasing the total number of file blocks held by each node, thereby accelerating the growth rate of nodes that have completed receiving all file blocks.

[0039] Furthermore, the S600 also includes:

[0040] S604: Analyze whether each node has successfully decoded each data packet and obtained all file blocks. If not, return to execute S100.

[0041] Beneficial effect: Analyze whether each node has obtained all file blocks to determine whether to start a new round of data broadcasting. If not, return to obtain the data reception status of each node again, and start a new round of broadcasting based on the new scarcity situation until all nodes have completed data reception.

[0042] The second basic solution provided by this invention is a network encoded transmission storage medium for storing computer-executable instructions, which, when executed, implement the above-mentioned network encoded transmission method.

[0043] The beneficial effects of Basic Scheme Two: The improved data transmission efficiency primarily addresses how to quickly receive data from all nodes in the entire network topology. Using this scheme, regardless of whether point-to-point routing and forwarding were used for initial data transmission or a distributed file distribution mechanism was employed, the methods described in this scheme can improve the data packet reception efficiency throughout the entire network topology.

[0044] Specifically, based on the data packet reception status of each node, the prevalence of each file block among the nodes can be analyzed, i.e., the scarcity of each file block can be determined. Then, based on the scarcity of each file block, encoding results are generated, and data packets are broadcast according to the encoding results. This yields a better network encoding and transmission strategy, more quickly increasing the total number of file blocks possessed by each node and accelerating the growth rate of nodes completing the reception of all file blocks. The principle is that a higher scarcity of a file block indicates that a relatively large number of nodes have not received it. Using this scheme, the highly scarce file blocks can be broadcast first, allowing more nodes to receive the required file blocks on the first broadcast, improving the efficiency of the number of nodes completing all data reception in the entire network topology, thereby improving data transmission efficiency. Furthermore, this scheme eliminates the need for frequent replies for each packet during data transmission; each node can autonomously receive data packets, saving on data packet transmission steps and further improving data transmission efficiency.

[0045] The third basic solution provided by this invention is a firmware upgrade method that uses the above-mentioned network encoding transmission method to transmit firmware data and performs firmware upgrade after the network encoding transmission is completed.

[0046] The beneficial effects of Basic Solution 3: The improved data transmission efficiency primarily addresses how to quickly receive data from all nodes in the entire network topology. Using this solution, regardless of whether point-to-point routing and forwarding were used for initial data transmission or a distributed file distribution mechanism was employed, the methods described in this solution can improve the data packet reception efficiency throughout the entire network topology.

[0047] Specifically, based on the data packet reception status of each node, the prevalence of each file block among the nodes can be analyzed, i.e., the scarcity of each file block can be determined. Then, based on the scarcity of each file block, encoding results are generated, and data packets are broadcast according to the encoding results. This yields a better network encoding and transmission strategy, more quickly increasing the total number of file blocks possessed by each node and accelerating the growth rate of nodes completing the reception of all file blocks. The principle is that a higher scarcity of a file block indicates that a relatively large number of nodes have not received it. Using this scheme, the highly scarce file blocks can be broadcast first, allowing more nodes to receive the required file blocks on the first broadcast, improving the efficiency of the number of nodes completing all data reception in the entire network topology, thereby improving data transmission efficiency. Furthermore, this scheme eliminates the need for frequent replies for each packet during data transmission; each node can autonomously receive data packets, saving on data packet transmission steps and further improving data transmission efficiency.

[0048] Using the above method to transmit firmware data before firmware upgrade results in high data transmission efficiency, thereby improving firmware upgrade efficiency. Attached Figure Description

[0049] Figure 1 This is a flowchart of a network encoding transmission method according to an embodiment of the present invention.

[0050] Figure 2 This is a schematic diagram of nodes in the same broadcast domain in a network coding transmission method according to an embodiment of the present invention. Detailed Implementation

[0051] The following detailed description illustrates the specific implementation method:

[0052] Example 1:

[0053] A network encoding transmission method, such as Figure 1 As shown, it includes the following steps:

[0054] S100: Obtain the data packet reception status of each node in the same broadcast domain. The data packet reception status includes received file blocks and unreceived file blocks. This embodiment uses firmware upgrade in the State Grid network as an example for illustration. Before firmware upgrade, firmware data transmission is required. After the State Grid completes its network, all nodes periodically send discovery list messages (management messages carrying neighbor site list information, periodically broadcast by all nodes in the communication network).

[0055] In this embodiment, similar to the discovery list message, each node periodically broadcasts its own data packet reception status. Specifically, to save length, the data can be compressed before broadcasting. For example, if there are many received file blocks, 1 can represent a bitmap of unreceived file blocks; that is, a bitmap can represent a marker for unreceived file blocks. In addition, it can be appended to the end of the data in the discovery list message, thus eliminating the need to send additional data packets. While each node is sending the discovery list message, it can learn about the data packet reception status of surrounding nodes within a certain routing cycle.

[0056] S200, each node generates the length of its transmission contention window based on the received data packets. In this embodiment, the more file blocks that have been received, the smaller the transmission contention window. When the number of received file blocks is the same, the nodes are randomly ordered. Nodes with larger transmission contention windows must wait for nodes with smaller receiving windows to send packets before they can send their own. In this embodiment, a carrier sense multiple access (CSMA) protocol is used, and the size of the transmission contention window is determined based on the number of received file blocks. The more blocks received, the shorter the time spent waiting for an acknowledgment pulse, and the easier it is to preempt the channel and send data packets first. Specifically:

[0057] Each node's file blocks are represented as a tuple f(x) = (x, ~x), where x represents the vector of unreceived file blocks, and ~x represents the vector of received file blocks. For example, in this embodiment, there are four file blocks: F0, F1, F2, and F3. If node TEI = m has F0 and F3, but not F1 or F2, then f(m) = (F1F2, F0F3); if it only has F1, then f(m) = (F0F2F3, F1), and so on.

[0058] N(x) represents the length of vector x. The length of its transmission contention window is proportional to N(x). That is, the smaller N(x) is, the smaller the transmission contention window is, and the easier it is to transmit network-coded broadcasts.

[0059] S300 analyzes the scarcity of each file block based on the data packet reception status of each node. S300 includes:

[0060] S301, such as Figure 2 As shown, each node obtains its communication success rate with its neighboring nodes, and the communication success rate is represented by PER.

[0061] S302, based on the communication success rate between adjacent nodes and the data packet reception status of each node, analyzes the scarcity of each file block and generates scarcity analysis results; S302 includes:

[0062] S3021, based on the communication success rate between adjacent nodes and the data packet reception status of each node, calculates a weighted average of the scarcity of each file block and generates the scarcity calculation result. Specifically:

[0063] The network coding content identifies surrounding nodes based on the previously received discovery list message. Each node is sorted according to its communication success rate, as shown in this embodiment. Figure 2 As shown, nodes with larger PER values ​​are arranged first and in the form of tuples, such as f(7)=(F1F2,F0F3), f(2)=(F0,F1F2F3), f(3)=(F0F1F2,F3), f(6)=(F1F2F3,F0), f(5)=(F0F2F3,F1), f(4)=(F0F1F3,F2). The arrangement results are shown in Table 1.

[0064] Table 1 Original state of nodes

[0065]

[0066] If N(x) > 1 for a node, it means that the node has not received at least one file block. In this case, the total number of missing file blocks in each node is obtained. Let L(b) be defined as the total number of missing file blocks with ID = b. Calculate the total number of missing file blocks for each node and sort them from most to least. For example, in the example above, L(0) = 4, L(1) = 4, L(2) = 4, L(3) = 3.

[0067] Based on the total number of missing file blocks, a scarcity-weighted average score is calculated: E(b,TEI) = WL*L(b) + WP*PER(TEI), where TEL represents a node, PER(TEI) represents the communication success rate between node TEL and this node, b is the ID number of the missing file block for node TEI, and WL and WP represent the weight values ​​of L(b) and PER(TEI), respectively. In this embodiment, WL = 0.5 and WP = 0.5, then the calculation shows that:

[0068] E(1,7)=0.5*4+0.5*0.3=2.15;

[0069] E(2,7)=0.5*4+0.5*0.3=2.15;

[0070] E(0,2)=0.5*4+0.5*0.29=2.14;

[0071] E(0,3)=2.12;

[0072] E(1,3)=2.12;

[0073] E(2,3)=2.12;

[0074] E(1,6)=2.10;

[0075] E(2,6)=2.10;

[0076] E(3,6)=1.5+0.1=1.6;

[0077] E(0,5)=2.08;

[0078] E(2,5)=2.08;

[0079] E(3,5) = 1.5 + 0.08 = 1.58;

[0080] E(0,4)=2.07;

[0081] E(1,4)=2.07;

[0082] E(3,4)=1.57.

[0083] Then, after weighting, we can obtain the scarcity calculation result:

[0084] R(0)=E(0,2)+E(0,3)+E(0,5)+E(0,4)=8.41;

[0085] R(1)=E(1,7)+E(1,3)+E(1,6)+E(1,4)=8.44;

[0086] R(2)=E(2,7)+E(2,3)+E(2,6)+E(2,5)=8.45;

[0087] R(3)=E(3,6)+E(3,5)+E(3,4)=4.75.

[0088] S3022, Based on the scarcity calculation results, the scarcity of each file block is sorted, and scarcity analysis results are generated. In this embodiment, based on the above scarcity calculation results, R(2)>R(1)>R(0)>R(3).

[0089] S400, the node generates an encoding result based on the scarcity of each file block. Specifically, according to the scarcity order of each file block, each file block is XORed with its adjacent file blocks in sequence, without performing XOR operations with the same input; the XOR result is used for encoding, and an encoding result is generated. Since R(2)>R(1)>R(0)>R(3), in this scheme, according to The files are encoded and sent in sequence. In other embodiments of this application, the number of file blocks to be XORed in a single operation can be selected according to the actual operation. Therefore, compared to directly broadcasting each file block (which requires four rounds of broadcasting), only three rounds of broadcasting are needed to complete the reception. This results in fewer broadcasts and higher data transmission efficiency. In other embodiments of this application, the more file blocks to be XORed in a single operation, the fewer data packets are generated, and the fewer broadcasts are required.

[0090] In step S500, each node broadcasts data packets based on the encoding results (only for nodes that have received file blocks). Each node generates several data packets sequentially based on the encoded content in the encoding results, and broadcasts these data packets sequentially according to the length of the transmission contention window. Specifically, externally, nodes send packets sequentially according to the length of the transmission contention window; internally, nodes broadcast each data packet sequentially based on the encoding results.

[0091] In S600, each node receives data packets broadcast by other nodes and decodes the packets based on its own packet reception status. S600 includes:

[0092] S601, each node receives data packets broadcast by other nodes and determines whether it can decode the data packets based on its own data packet reception status. If yes, then execute S602; otherwise, execute S603.

[0093] S602 decodes the data packet. For example, if the received data packet contains a file block... The node can decode the content of file block 1 based on the encoded content in the data packets broadcast by other nodes and the content of the file blocks it has already received.

[0094] S603 stores the encoded content of data packets. Upon receiving other data packets, it combines the encoded content from each packet and decodes them again. For example, if the received data packet contains a file block... The data packet contains encoded content, but the node itself has neither file block 1 nor file block 2, so it cannot be decoded. Therefore, in this solution, the encoded content of the data packet is temporarily stored. After receiving other data packets, the encoded content of each data packet is combined with the encoded content of each data packet to decode again to obtain the content of each file block. The decoding process in this embodiment is shown in Tables 2, 3, and 4. Specifically, in this solution, the received data packets are directly temporarily stored in the storage location of the corresponding file block, with the smallest file block placed first. The principle is that directly storing data packets that cannot be decoded will occupy a large amount of storage space on the node. Storing data packets directly in the storage location of the corresponding file block can avoid using additional data storage space and reduce storage space consumption.

[0095] Table 2 Broadcast Subsequent status

[0096]

[0097]

[0098] Table 3 Broadcast Subsequent status

[0099]

[0100] Table 4 Broadcast Subsequent status

[0101]

[0102] S604: Analyze whether each node has successfully decoded each data packet and obtained all file blocks. If not, return to execute S100. Specifically, analyze whether each node has obtained all file blocks to determine whether to conduct a new round of data broadcasting. If not, return to re-obtain the data reception status of each node and conduct a new round of broadcasting based on the new scarcity situation until all nodes have completed data reception.

[0103] A network-encoded transmission storage medium is provided for storing computer-executable instructions, which, when executed, implement the network-encoded transmission method described above.

[0104] A firmware upgrade method uses the aforementioned network encoding transmission method to transmit firmware data, and performs a firmware upgrade after the network encoding transmission is completed.

[0105] The above are merely embodiments of the present invention. Commonly known structures and characteristics are not described in detail here. Those skilled in the art are aware of all common technical knowledge in the field prior to the application date or priority date, are aware of all existing technologies in that field, and have the ability to apply conventional experimental methods prior to that date. Those skilled in the art can, under the guidance of this application, improve and implement this solution in combination with their own capabilities. Some typical known structures or methods should not be obstacles for those skilled in the art to implement this application. It should be noted that those skilled in the art can make several modifications and improvements without departing from the structure of the present invention. These should also be considered within the scope of protection of the present invention, and will not affect the effectiveness of the implementation of the present invention or the practicality of the patent. The scope of protection claimed in this application should be determined by the content of its claims, and the specific embodiments described in the specification can be used to interpret the content of the claims.

Claims

1. A network encoding transmission method, characterized in that: Includes the following steps: S100, obtain the data packet reception status of each node in the same broadcast domain; S200, each node generates the length of the transmission contention window based on the data packet reception situation; S300, based on the data packet reception status of each node, analyze the scarcity of each file block; the data packet reception status includes received file blocks and unreceived file blocks; S400, the node generates encoding results based on the scarcity of each file block; In S500, each node broadcasts data packets according to the encoding result, including: each node broadcasts data packets sequentially according to the length of the contention window. The S300 includes: S301, obtain the communication success rate between adjacent nodes; S302, based on the communication success rate between adjacent nodes and the data packet reception status of each node, analyze the scarcity of each file block and generate scarcity analysis results; S302 includes: S3021, based on the communication success rate between adjacent nodes and the data packet reception status of each node, the scarcity of each file block is calculated by weighted average, and the scarcity calculation result is generated; the weighted average calculation of the scarcity of each file block includes: E(b,TEI)=WL*L(b)+WP*PER(TEI), where TEI represents a node, PER(TEI) represents the communication success rate between node TEI and this node, b is the file block ID number missing by node TEI, WL and WP represent the weight values ​​of L(b) and PER(TEI) respectively; L(b) is defined as the total number of missing file blocks with ID = b; S3022, Based on the scarcity calculation results, sort the scarcity of each file block and generate scarcity analysis results; the scarcity analysis results include the scarcity order of each file block. S400 includes: performing an XOR operation on each file block and its adjacent file blocks in sequence according to the scarcity order of each file block, and encoding the result of the XOR operation.

2. The network encoding transmission method according to claim 1, characterized in that: It also includes the S600, where each node receives data packets broadcast by other nodes and decodes the data packets based on its own data packet reception status.

3. The network encoding transmission method according to claim 2, characterized in that: The S600 includes: S601, each node receives data packets broadcast by other nodes and determines whether it can decode the data packets based on its own data packet reception status. If yes, then execute S602; otherwise, execute S603. S602, decodes the data packet; S603 stores the encoded content in the data packets. After receiving other data packets, it combines the encoded content in each data packet and decodes them again.

4. The network encoding transmission method according to claim 3, characterized in that: The S600 also includes: S604: Analyze whether each node has successfully decoded each data packet and obtained all file blocks. If not, return to execute S100.

5. A network-encoded transmission storage medium for storing computer-executable instructions, characterized in that: When the computer-executable instructions are executed, they implement the network encoding transmission method according to any one of claims 1-4.

6. A firmware upgrade method, characterized in that: Firmware data transmission was performed using the network encoding transmission method described in any one of claims 1-4, and firmware upgrades were performed after the network encoding transmission was completed.

Images