Data transmission method and device

Abstract

The present application provides a data transmission method and device, including: a transmission control node obtains a first transmission node based on a routing pointer in a routing table, wherein the routing table is set by the transmission control node according to a data table, and the data table is established by an information synchronization node based on a set of transmission nodes; the transmission control node transmits first packet data to the first transmission node; the first transmission node analyzes the first packet data to obtain a preset receiving node; and the first transmission node sends the first packet data to the preset receiving node. The transmission control node adopts a decentralized transmission method, transforming end-to-end data transmission into cross-transmission through other data tunnels, which increases the complexity of data transmission, makes the transmission system difficult to be monitored or cracked, and makes data transmission more secure, which is not conducive to the generation of security vulnerabilities and can reduce the risk of data leakage.

Description

Technical Field

[0001] The present application relates to the technical field of data transmission, and in particular to a data transmission method and device. Background Art

[0002] Traditional core information systems serving large customer bases can adopt either a centralized, mainframe-based architecture or a distributed architecture. Distributed architectures reduce costs by breaking down large mainframes into multiple smaller services based on functional modules. These services are then combined into a single application to provide external services. Furthermore, each service in this architecture is independently deployed with a single responsibility, enabling service autonomy and reducing overall system complexity. Consequently, distributed architectures are favored across various industries.

[0003] Most distributed systems employ firewalls to enhance security. These filters, essentially filtering incoming and outgoing network traffic based on a set of user-defined rules, do not alter the end-to-end transmission method from producer to consumer. This filtering approach remains vulnerable to eavesdropping or hacking, posing a risk of security breaches and unsatisfactory security. This is particularly problematic for data transmission environments with high security requirements.

[0004] Therefore, how to increase the security of data transmission in a distributed system is a technical problem that those skilled in the art urgently need to solve. Summary of the Invention

[0005] In view of this, embodiments of the present application provide a data transmission method and apparatus, aiming to increase the security of data transmission in a distributed system.

[0006] In a first aspect, an embodiment of the present application provides a data transmission method, including:

[0007] The transmission control node obtains the first transmission node according to the routing pointer of the routing table, wherein the routing table is set by the transmission control node according to the data table, and the data table is established by the information synchronization node according to the transmission node set;

[0008] The transmission control node transmits the first packet data to the first transmission node;

[0009] The first transmission node analyzes the first packet data to obtain a preset receiving node;

[0010] The first transmission node sends the first packet data to the preset receiving node.

[0011] Optionally, the method further includes:

[0012] The transmission control node obtains the size of the data to be transmitted;

[0013] In response to the size of the data to be transmitted being not greater than a packet threshold, the transmission control node determines the data to be transmitted as the first packet data;

[0014] In response to the size of the data to be transmitted being greater than the packet threshold, the transmission control node splits the data to be transmitted to obtain a plurality of split data, and determines any one of the plurality of split data as the first packet data.

[0015] Optionally, the method further includes:

[0016] The transmission control node determines that another split data among the plurality of split data is second packet data;

[0017] The transmission control node acquires the second transmission node according to the routing pointer of the routing table;

[0018] The transmission control node transmits the second packet data to the second transmission node;

[0019] The second transmission node analyzes the second packet data to obtain the preset receiving node;

[0020] The second transmission node sends the second packet data to the preset receiving node.

[0021] Optionally, the data table includes a new data table and a deleted data table, and the method further includes:

[0022] The information synchronization node obtains the transmission node set;

[0023] In response to any transmission node being added to the transmission node set, the information synchronization node adds a node record corresponding to the added transmission node to the newly added data table, where the node record corresponding to the added transmission node includes one or more of an identity identifier, a time of addition, a network protocol, and a port corresponding to the added transmission node;

[0024] In response to the transmission node set deleting any transmission node, the information synchronization node removes the node record corresponding to the deleted transmission node in the newly added data table, and adds the node record corresponding to the deleted transmission node to the deleted data table. The node record corresponding to the deleted transmission node includes one or more of the identity identifier and deletion time corresponding to the deleted transmission node.

[0025] Optionally, the method further includes:

[0026] The transmission control node obtains the newly added data table;

[0027] The transmission control node establishes a routing table based on the newly added data table and records a first update time, wherein the routing table is a linked list including the routing pointer and the head pointer, and the first update time is the time when the transmission control node obtains the newly added data table;

[0028] In response to the routing pointer and the head pointer coinciding, the transmission control node updates the routing table.

[0029] Optionally, the transmission control node updates the routing table, including:

[0030] The transmission control node obtains a supplementary newly added data table, where the supplementary newly added data table is a data table updated in the newly added data table after the first update time;

[0031] The transmission control node obtains a supplementary deletion data table, where the supplementary deletion data table is a data table updated in the deletion data table after a first update time;

[0032] The transmission control node updates the routing table according to the supplementary newly added data table and the supplementary deleted data table, and records a second update time, where the second update time is the time for updating the routing table.

[0033] Optionally, the transmission control node updates the routing table, including:

[0034] In response to the routing pointer and the head pointer being coincident, the transmission control node obtains a newly added data table;

[0035] The transmission control node updates the routing table according to the newly added data table and records a second update time, where the second update time is the time for updating the routing table.

[0036] In a second aspect, an embodiment of the present application provides a data transmission device, including:

[0037] A first node acquisition module, configured for the transmission control node to acquire a first transmission node according to a routing pointer in a routing table, wherein the routing table is set by the transmission control node according to a data table, and the data table is established by the information synchronization node according to the transmission node set;

[0038] A first transmission module, configured for the transmission control node to transmit the first packet data to the first transmission node;

[0039] A first analysis module, configured for the first transmission node to analyze the first packet data to obtain a preset receiving node;

[0040] The first sending module is used for the first transmission node to send the first packet data to the preset receiving node.

[0041] In a third aspect, an embodiment of the present application provides a device comprising a memory and a processor, wherein the memory is used to store instructions or codes, and the processor is used to execute the instructions or codes so that the device executes the data transmission method described in any one of the first aspects above.

[0042] In a fourth aspect, an embodiment of the present application provides a computer storage medium, in which a code is stored. When the code is executed, the device executing the code implements the data transmission method described in any one of the first aspects above.

[0043] The embodiment of the present application provides a data transmission method and device. When executing the method, the transmission control node first obtains the first transmission node based on the routing pointer of the routing table. The routing table is set by the transmission control node according to the data table. The data table is established by the information synchronization node based on the transmission node set; the transmission control node then transmits the first packet data to the first transmission node; then, the first transmission node analyzes the first packet data to obtain a preset receiving node; finally, the first transmission node sends the first packet data to the preset receiving node. The transmission control node adopts a decentralized transmission method, which changes the end-to-end data transmission into cross-transmission through other data tunnels, increasing the complexity of data transmission, making the transmission system difficult to be monitored or cracked, making data transmission more secure, not conducive to the generation of security vulnerabilities, and reducing the risk of data leakage. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions in this embodiment or the prior art, the following briefly introduces the drawings required for use in the embodiment or the prior art description. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0045] Figure 1 A flowchart of a data transmission method provided in an embodiment of the present application;

[0046] Figure 2 A diagram showing the relationship between the transmission control node, information synchronization node, and transmission node of the data transmission method provided in an embodiment of the present application;

[0047] Figure 3 Another method flow chart of the data transmission method provided in an embodiment of the present application;

[0048] Figure 4 A data table diagram of the data transmission method provided in an embodiment of the present application;

[0049] Figure 5 A routing table diagram of the data transmission method provided in an embodiment of the present application;

[0050] Figure 6 A transmission path diagram of the data transmission method provided in an embodiment of the present application;

[0051] Figure 7 A structural diagram of a data transmission device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0052] Most distributed systems employ firewalls to enhance security. These filters, essentially filtering incoming and outgoing network traffic based on a set of user-defined rules, do not alter the end-to-end transmission method from producer to consumer. This filtering approach remains vulnerable to eavesdropping or hacking, posing a risk of security breaches and unsatisfactory security. This is particularly problematic for data transmission environments with high security requirements.

[0053] The method provided in the embodiment of the present application is executed by a computer device to increase the security of data transmission in a distributed system.

[0054] Obviously, the embodiments described are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0055] See also Figure 1 , Figure 1 A method flow chart of a data transmission method provided in an embodiment of the present application includes:

[0056] Step S101: The transmission control node obtains the first transmission node according to the routing pointer in the routing table.

[0057] The routing table is set by the transmission control node based on the data table, which is created by the information synchronization node based on the transmission node set. Therefore, the contents of the routing table correspond to the transmission node set. Because the routing table includes routing pointers, it is indirectly a linked list based on the transmission node set.

[0058] The transmission control node determines the first transmission node based on its configured routing table. The first transmission node is the node indicated by the routing pointer in the routing table and has no bearing on the transmission content. In other words, the determination of the first transmission node is independent of the transmission content; regardless of the transmission content, the first transmission node is determined solely based on the routing pointer. The first transmission node is not the final receiving node, but rather serves as an information transfer station.

[0059] Through this step, even if an attacker breaks into the data, he cannot get the correct sender and receiver, and cannot obtain the complete and correct data content, which is conducive to protecting data security.

[0060] Step S102: The transmission control node transmits the first packet data to the first transmission node.

[0061] The first packet data is the data obtained by the transmission control node from packetizing the data to be transmitted. As a possible implementation, considering the size of the data to be transmitted and other factors, the first packet data may be the data to be transmitted itself, or it may be data obtained by repackaging the data after splitting the data to be transmitted. Due to the individual variability of the data to be transmitted, this is not limited here.

[0062] Because the first transmission node only exists as a forwarding node, the first packet data can be directly sent to the first transmission node so that the first transmission node can further forward the first packet data.

[0063] Step S103: The first transmission node analyzes the first packet data to obtain a preset receiving node.

[0064] After receiving the first packet data sent by the transmission control node, the first transmission node can analyze the first packet data to determine the node to which the transmission control node actually intends to send the data, i.e., the predetermined receiving node. As a possible implementation, the predetermined receiving node can be the first transmission node itself or another transmission node in the transmission node set.

[0065] Step S104: The first transmitting node sends the first packet data to the predetermined receiving node.

[0066] When the preset receiving node is obtained, the first transmitting node may forward the first packet data to the preset receiving node to complete data transmission.

[0067] To sum up, the transmission control node in this embodiment adopts a decentralized transmission method, which changes the end-to-end data transmission into cross-transmission through other data tunnels, increases the complexity of data transmission, makes the transmission system difficult to be monitored or cracked, and makes data transmission more secure, which is not conducive to security vulnerabilities and can reduce the risk of data leakage.

[0068] In the embodiment of the present application, the above Figure 1 There are many possible implementations of the steps, which are described below. It should be noted that the implementations given in the following description are only for illustrative purposes and do not represent all implementations of the embodiments of the present application.

[0069] See also Figure 2 , Figure 2 This is a relationship diagram of the transmission control node, information synchronization node and transmission node of the data transmission method provided by this embodiment.

[0070] The transmission control node A can be improved from the existing distributed architecture by adding a new transmission control node to each independent consumer deployed on a physical machine (virtual machine), which is responsible for storing routing node status information (for example, transmission node identity (ID), network protocol (IP) and port).

[0071] Information synchronization node B can be deployed independently on a physical machine (or virtual machine), maintaining a connection with each physical machine (or virtual machine) in the producer and consumer clusters and providing heartbeat detection. Cluster deployment improves the availability of information synchronization nodes and prevents single points of failure from impacting the entire link. The information synchronization node treats each consumer with a separate IP address and port as a transmission node and assigns it a number. New transmission nodes are assigned new numbers and disconnected transmission nodes are decommissioned, allowing the transmission control node to control transmission node information.

[0072] Transmission nodes C manage consumers in a distributed architecture as a cluster. They may be composed of multiple physical machines (or virtual machines), each with independent processors, memory, and network IP addresses. The secure transmission framework designed in this embodiment allows for the deployment of separate transmission nodes on each independent physical machine (or virtual machine). Upon joining the distributed architecture network, each transmission node receives a unique identification number from information synchronization node B. It is responsible for receiving packet data from the transmission control node and forwarding it to the target consumer.

[0073] See also Figure 3 , which is another method flow chart of the data transmission method provided in an embodiment of the present application, including:

[0074] Step S301: Information synchronization node management data table.

[0075] See also Figure 4 , this figure is a data table diagram of the data transmission method provided by an embodiment of the present application. The left side of the figure is the newly added data table, and the right side is the deleted data table. The data table includes a newly added data table and a deleted data table, which are used to record newly added transmission nodes and their newly assigned numbers and disconnected transmission nodes and their reclaimed numbers. Specifically including:

[0076] Step S3011: The information synchronization node obtains the transmission node set.

[0077] Since transmission nodes may be added or deleted from the transmission node set, the transmission node set can be obtained regularly to obtain the existing transmission nodes. Based on this, the data table can be managed.

[0078] Step S3012: In response to any transmission node being added to the transmission node set, the information synchronization node adds a node record corresponding to the added transmission node to the newly added data table.

[0079] Whenever a transmission node is added to the transmission node set, the information synchronization node records the transmission node and its corresponding related information in the new data table, including the transmission node's corresponding identity, addition time, network protocol, and port. The identity (ID) is assigned by the information synchronization node using a random number algorithm.

[0080] For example, Figure 4 In T i Time to add transmission node C i ,The new node table records a new row of node records, including the time of addition, node number, network protocol (IP) and port.

[0081] Step S3013: In response to the transmission node set deleting any transmission node, the information synchronization node removes the node record corresponding to the deleted transmission node in the new data table, and adds the node record corresponding to the deleted transmission node to the deleted data table.

[0082] Whenever a transmission node is deleted from the transmission node set, the information synchronization node deletes the transmission node and its corresponding related information from the added data table and adds the transmission node and its corresponding related information to the deleted data table, including one or more of the transmission node's corresponding identity and the deletion time. The identity (ID) in this case is also assigned by the information synchronization node using a random number algorithm.

[0083] For example, Figure 4 If the original C4 node is deleted at time t4, the node record related to the C4 node will be deleted in the new node table, and a new node record will be added to the deleted node table, including the deletion time t4 and the node number.

[0084] As a possible implementation, in order to facilitate the transmission control node to obtain data table data, the new node table and the deleted node table are stored in the data table in chronological order. In addition, the deleted node table can be regularly cleared according to custom time rules to save memory resources.

[0085] Step S302: The transmission control node manages the routing table.

[0086] The transmission control node establishes a routing table based on the data table, specifically including:

[0087] Step S3021: The transmission control node obtains the newly added data table.

[0088] Step S3022: The transmission control node establishes a routing table according to the newly added data table and records a first update time.

[0089] The routing table is a linked list, including the routing pointer and the head pointer, and the first update time is the time when the transmission control node obtains the newly added data table.

[0090] For example, see Figure 5 , Figure 5 The routing table diagram of the data transmission method provided in this embodiment. The transmission control node establishes a routing table based on the newly added data table. Figure 4 The transmission node ID in the newly added data table is added, the routing chain table is established one by one, and the time T0 of obtaining the transmission node is recorded.

[0091] Step S3023: In response to the routing pointer and the head pointer being coincident, the transmission control node updates the routing table.

[0092] When the routing pointer and the head pointer coincide, the routing node update mechanism is triggered to ensure that the transmission node included in the routing table is the latest transmission node, avoiding the situation where a transmission node has been deleted but still exists in the routing table. There are multiple methods for the transmission control node to update the routing table, each suitable for different application environments, which are not limited here.

[0093] As a possible implementation, first, the transmission control node obtains a supplementary new data table. The supplementary new data table is a data table in the new data table updated after a first update time. Secondly, the transmission control node obtains a supplementary deleted data table. The supplementary deleted data table is a data table in the deleted data table updated after the first update time. Finally, the transmission control node updates the routing table based on the supplementary new data table and the supplementary deleted data table, and records a second update time. The second update time is the time when the routing table was updated.

[0094] Specifically, when there are many existing transmission nodes and transmission node additions and deletions are infrequent, first obtain the data from the newly added node table after the first update time and insert it into the routing table. Then, obtain the data from the deleted node table after the first update time, delete the corresponding nodes in the routing table, and update the first update time to the second update time. This simplifies the update process, accelerates updates, and improves update efficiency.

[0095] As another possible implementation, in response to the routing pointer and the head pointer coinciding, the transmission control node first obtains a newly added data table; secondly, the transmission control node updates the routing table based on the newly added data table and records a second update time, wherein the second update time is the time when the routing table is updated.

[0096] Specifically, when there are few existing transmission nodes and transmission nodes are frequently added or deleted, the routing table is rebuilt. This is equivalent to initializing the original routing table and then re-performing steps S3021 to S3022 to establish the routing table. This method is more efficient and faster in scenarios where additions and deletions are frequent.

[0097] Step S303: The transmission control node encapsulates the data to be transmitted.

[0098] Packetization involves routing data to at least one transmission node by setting the packet count and packet threshold. These parameters are adjustable and can be pre-set based on system usage, impacting system performance. A larger packet count and a smaller packet threshold result in more packetization, resulting in greater performance pressure and improved security. Furthermore, each packet must include the destination IP address, port, packet sequence, and total number of packets for verification by the destination node.

[0099] The specific packaging process includes:

[0100] Step S3031: The transmission control node obtains the size of the data to be transmitted.

[0101] Step S3032: In response to the size of the data to be transmitted being not greater than a packet threshold, the transmission control node determines the data to be transmitted as the first packet data.

[0102] When the size of the data to be transmitted is not greater than the packet threshold, the size of the data to be transmitted is small enough and does not need to be split, and the data to be transmitted is directly determined as the first packet data and transmitted.

[0103] Step S3033: In response to the size of the data to be transmitted being greater than the packet threshold, the transmission control node splits the data to be transmitted to obtain a plurality of split data, and determines any one of the plurality of split data as the first packet data.

[0104] In the above packetization process, when the size of the data to be transmitted is larger than the packet threshold, it means that the data to be transmitted is large enough and needs to be split. For example, the size of the data to be transmitted is M1, the preset number of packets is i, and the packet threshold is m. When M1 is larger than m, the data to be transmitted is split into i split data and packetized one by one. The first i-1

[0105] The size of a packet is The last packet size is

[0106] It should be noted that any one of the multiple split data is the first packet data, and the other split data is the second packet data, the third packet data, etc.

[0107] Step S304: The transmission control node sends data.

[0108] Taking the splitting of data into the first packet data and the second packet data as an example, the transmission control node sends data, specifically:

[0109] Step S3041: The transmission control node obtains the first transmission node according to the routing pointer in the routing table.

[0110] Step S3042: The transmission control node transmits the first packet data to the first transmission node.

[0111] Step S3043: The transmission control node obtains the second transmission node according to the routing pointer in the routing table.

[0112] Step S3044: The transmission control node transmits the second packet data to the second transmission node.

[0113] The above steps are similar to those in Example 1 and will not be explained here.

[0114] As a possible implementation method, before transmitting data, the transmission control node may use a PING command to confirm whether the transmission node exists. If not, it will sequentially acquire a transmission node until it is satisfied that the transmission node exists.

[0115] Furthermore, routing pointers have a certain random nature. Because each transmission node's ID is randomly generated, while nodes are selected in order of ID size during transmission, in practice, this is unrelated to the order in which the consumer's physical (or virtual) machines join the transmission network. Each time data is transmitted, the transmission control node selects the updated transmission node based on the routing pointer sequence, ensuring sufficient dispersion of the transmission path. This makes it difficult for attackers to obtain a user's complete access history by compromising a single or small number of nodes.

[0116] As a possible implementation, an asymmetric encryption transmission method may be used between the transmission control node and each transmission node.

[0117] For example, the transmission control node sends a link establishment request to the first transmission node. After verifying the legitimacy of the transmission control node, the first transmission node generates a key pair (public key pubkey_A_C1 and private key prikey_A_C1). It then sends the public key pubkey_A_C1 back to the transmission control node. The transmission control node encrypts the data to be sent (data) using the public key pubkey_A_C1, generating the public key pubkey_A_C1(data) and sending it to the first transmission node.

[0118] Step S305: The transmission node forwards the data.

[0119] Taking the splitting of data into the first packet and the second packet as an example, the following describes how the transmission node forwards data:

[0120] Step S3051: The first transmission node analyzes the first packet data to obtain a preset receiving node.

[0121] Step S3052: The first transmission node sends the first packet data to the predetermined receiving node.

[0122] Step S3053: The second transmission node analyzes the second packet data to obtain the preset receiving node.

[0123] Step S3054: The second transmission node sends the second packet data to the predetermined receiving node.

[0124] For example, after receiving the first packet data sent by the transmission control node, the first transmission node uses the private key prikey_A_C1 to decrypt the data packet and finds that the data packet is sent to the second transmission node. Then, the first transmission node sends the decrypted data packet to the second transmission node using an asymmetric encryption transmission method.

[0125] It should be noted that if the second transmission node receives the second packet data from the transmission control node and decrypts the data packet using the private key and finds that the data packet is sent to the second transmission node, the second transmission may not be performed.

[0126] As can be seen, the second transmission node has two functions: one is to act as a routing node, receiving and forwarding data packets; the other is to act as a preset receiving node, receiving data packets sent by the routing node, assembling and verifying them, and then providing them to consumers.

[0127] For further explanation of the data transmission path, see Figure 6 , Figure 6 The transmission path diagram of the data transmission method provided in the embodiment of the present application shows that when the number of packets is 3, the transmission control node selects the transmission nodes with ID values 1, 2, and 3 for transfer, and finally sends the packet to the target node with ID value 10.

[0128] Step S306: The preset receiving node receives the data.

[0129] After receiving the data, the preset receiving node can assemble and verify the first and second packet data before providing it to the consumer. If the timeout does not receive all packets or the verification is incorrect, a message is sent to the consumer to notify the failure of receiving the message and request retransmission.

[0130] To summarize, this embodiment establishes the relationship between the transmission control node and the transit transmission node by pre-setting the data table and the routing table; then, the security of data transmission is improved by means of packet encapsulation; finally, a decentralized data transmission method is adopted to hide and disperse the transmission path, making it difficult for attackers to obtain the user's complete access record by taking down a single or a few nodes, thereby making the transmitted data more difficult to track, monitor, and steal, and having stronger security. It is very suitable for streaming data transmission scenarios with complex network environments and high data security requirements.

[0131] The above are some specific implementations of the data transmission method provided in the embodiments of the present application. Based on this, the present application also provides a corresponding device. The device provided in the embodiments of the present application will be introduced from the perspective of functional modularization.

[0132] See also Figure 7 The structure diagram of the data transmission device 700 shown in the figure includes a first node acquisition module 701, a first transmission module 702, a first analysis module 703 and a first sending module 704.

[0133] A first node acquisition module 701 is configured to enable a transmission control node to acquire a first transmission node based on a routing pointer in a routing table, wherein the routing table is set by the transmission control node based on a data table, and the data table is established by the information synchronization node based on a set of transmission nodes;

[0134] A first transmission module 702, configured for the transmission control node to transmit the first packet data to the first transmission node;

[0135] A first analysis module 703, configured for the first transmission node to analyze the first packet data and obtain a preset receiving node;

[0136] The first sending module 704 is configured to enable the first transmitting node to send the first packet data to the preset receiving node.

[0137] As a possible implementation manner, the device further includes:

[0138] A packet acquisition module, used by the transmission control node to obtain the size of the data to be transmitted;

[0139] a non-packetizing module, configured to, in response to a size of the data to be transmitted being not greater than a packetizing threshold, determine, by the transmission control node, the data to be transmitted as the first packetized data;

[0140] The first packet module is used for, in response to the size of the data to be transmitted being greater than the packet threshold, the transmission control node splitting the data to be transmitted to obtain multiple split data, and determining any one of the multiple split data as the first packet data.

[0141] As a possible implementation manner, the device further includes:

[0142] A second packetizing module, configured for the transmission control node to determine that another split data among the plurality of split data is second packetized data;

[0143] A second acquisition module, configured for the transmission control node to acquire a second transmission node according to a routing pointer in the routing table;

[0144] A second transmission module, configured for the transmission control node to transmit the second packet data to the second transmission node;

[0145] A second analysis module, configured for the second transmission node to analyze the second packet data to obtain the preset receiving node;

[0146] The second sending module is used for the second transmission node to send the second packet data to the preset receiving node.

[0147] As a possible implementation manner, the data table includes a new data table and a deleted data table, and the device further includes:

[0148] A transmission node set acquisition module, used for the information synchronization node to acquire the transmission node set;

[0149] a new record module, configured to, in response to any transmission node being added to the transmission node set, cause the information synchronization node to add a node record corresponding to the added transmission node to the new data table, where the node record corresponding to the added transmission node includes one or more of an identity identifier, a time of addition, a network protocol, and a port corresponding to the added transmission node;

[0150] A deletion record module is used to respond to the deletion of any transmission node from the transmission node set, the information synchronization node removes the node record corresponding to the deleted transmission node in the newly added data table, and adds the node record corresponding to the deleted transmission node to the deleted data table, the node record corresponding to the deleted transmission node includes one or more of the identity identifier and deletion time corresponding to the deleted transmission node.

[0151] As a possible implementation manner, the device further includes:

[0152] A first data table acquisition module, configured for the transmission control node to acquire the newly added data table;

[0153] a routing table establishment module, configured for the transmission control node to establish a routing table based on the newly added data table and record a first update time, wherein the routing table is a linked list including the routing pointer and the head pointer, and the first update time is the time when the transmission control node obtains the newly added data table;

[0154] The routing table updating module is configured to update the routing table by the transmission control node in response to the routing pointer and the head pointer being coincident.

[0155] As a possible implementation, the routing table updating module includes:

[0156] A new supplementing unit is added, configured for the transmission control node to obtain a supplementary new data table, where the supplementary new data table is a data table updated in the new data table after the first update time;

[0157] A deletion and supplementation unit, configured for the transmission control node to obtain a supplementary deletion data table, wherein the supplementary deletion data table is a data table updated in the deletion data table after a first update time;

[0158] The first updating unit is used for the transmission control node to update the routing table according to the supplementary new data table and the supplementary deleted data table, and record a second update time, where the second update time is the time for updating the routing table.

[0159] As a possible implementation, the routing table updating module includes:

[0160] a second data table acquisition module, configured to, in response to the routing pointer and the head pointer being coincident, enable the transmission control node to acquire a newly added data table;

[0161] A second updating unit is configured for the transmission control node to update the routing table based on the newly added data table and record a second update time, where the second update time is the time when the routing table is updated. The embodiment of the present application also provides corresponding devices and computer storage media for implementing the solution provided in the embodiment of the present application.

[0162] The device includes a memory and a processor, the memory is used to store instructions or codes, and the processor is used to execute the instructions or codes so that the device executes the data transmission method described in any embodiment of the present application.

[0163] The computer storage medium stores codes, and when the codes are executed, the device executing the codes implements the data transmission method described in any embodiment of the present application.

[0164] The "first" and "second" (if any) in the names mentioned in the embodiments of this application are only used as name identifiers and do not mean the first or second in order.

[0165] Through the description of the above embodiments, it can be known that those skilled in the art can clearly understand that all or part of the steps in the above embodiment methods can be implemented by means of software plus a general hardware platform. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product, which can be stored in a storage medium, such as a read-only memory (ROM) / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network communication device such as a router) to execute the methods described in each embodiment or certain parts of the embodiments of the present application.

[0166] Each embodiment in this specification is described in a progressive manner. The same or similar parts between the embodiments can be referred to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple. For the relevant parts, refer to the partial description of the method embodiment. Some or all of the modules can be selected according to actual needs to achieve the purpose of the embodiment. Those of ordinary skill in the art can understand and implement it without paying any creative work.

[0167] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.

Claims

1. A data transmission method, characterized in that: The method comprises: The transmission control node obtains the size of the data to be transmitted; In response to the size of the data to be transmitted being not greater than a packet threshold, the transmission control node determines the data to be transmitted as the first packet data; The transmission control node obtains the first transmission node through a routing pointer according to the order of the transmission node identifiers in the routing table; the routing table is set by the transmission control node according to a data table, and the data table is established by the information synchronization node based on the transmission node set; the transmission node identifiers are assigned by the information synchronization node according to a random number algorithm; the transmission control node transmits the first packet data to the first transmission node; the first transmission node analyzes the first packet data to obtain a preset receiving node; and the first transmission node sends the first packet data to the preset receiving node. In response to the size of the data to be transmitted being greater than the packet threshold, the transmission control node splits the data to be transmitted to obtain a plurality of split data, and determines any one of the plurality of split data as the first packet data; and determines another one of the plurality of split data as the second packet data; The transmission control node obtains the first transmission node and the second transmission node through the routing pointer according to the size order of the transmission node identification identifiers in the routing table; the transmission control node transmits the first packet data to the first transmission node and transmits the second packet data to the second transmission node; the first transmission node analyzes the first packet data and the second packet data to obtain a preset receiving node; the first transmission node sends the first packet data and the second packet data to the preset receiving node.

2. The method according to claim 1, characterized in that The data table includes a newly added data table and a deleted data table, and the method further includes: The information synchronization node obtains the transmission node set; In response to any transmission node being added to the transmission node set, the information synchronization node adds a node record corresponding to the added transmission node to the newly added data table, where the node record corresponding to the added transmission node includes one or more of an identity identifier, a time of addition, a network protocol, and a port corresponding to the added transmission node; In response to the transmission node set deleting any transmission node, the information synchronization node removes the node record corresponding to the deleted transmission node in the newly added data table, and adds the node record corresponding to the deleted transmission node to the deleted data table. The node record corresponding to the deleted transmission node includes one or more of the identity identifier and deletion time corresponding to the deleted transmission node.

3. The method according to claim 2, characterized in that The method further comprises: The transmission control node obtains the newly added data table; The transmission control node establishes a routing table based on the newly added data table and records a first update time, wherein the routing table is a linked list including the routing pointer and the head pointer, and the first update time is the time when the transmission control node obtains the newly added data table; In response to the routing pointer and the head pointer coinciding, the transmission control node updates the routing table.

4. The method according to claim 3, characterized in that The transmission control node updates the routing table, including: The transmission control node obtains a supplementary newly added data table, where the supplementary newly added data table is a data table updated in the newly added data table after the first update time; The transmission control node obtains a supplementary deletion data table, where the supplementary deletion data table is a data table updated in the deletion data table after a first update time; The transmission control node updates the routing table according to the supplementary newly added data table and the supplementary deleted data table, and records a second update time, where the second update time is the time for updating the routing table.

5. The method according to claim 3, characterized in that The transmission control node updates the routing table, including: In response to the routing pointer and the head pointer being coincident, the transmission control node obtains a newly added data table; The transmission control node updates the routing table according to the newly added data table and records a second update time, where the second update time is the time for updating the routing table.

6. A data transmission device, characterized in that: The device comprises: A packet acquisition module, used by the transmission control node to obtain the size of the data to be transmitted; a non-packetizing module, configured to, in response to a size of the data to be transmitted being not greater than a packetizing threshold, determine, by the transmission control node, the data to be transmitted as the first packetized data; a first node acquisition module configured to enable the transmission control node to acquire the first transmission node through a routing pointer according to the order of the transmission node identities in the routing table; the routing table is set by the transmission control node according to a data table, which is established by the information synchronization node based on the transmission node set; and the transmission node identities are assigned by the information synchronization node according to a random number algorithm. A first transmission module, configured for the transmission control node to transmit the first packet data to the first transmission node; A first analysis module, configured for the first transmission node to analyze the first packet data to obtain a preset receiving node; A first sending module, configured for the first transmission node to send the first packet data to the preset receiving node; a first packetizing module, configured to, in response to a size of the data to be transmitted being greater than the packetizing threshold, cause the transmission control node to split the data to be transmitted into a plurality of split data, and determine any one of the plurality of split data as the first packet data; A second packetizing module, configured for the transmission control node to determine that another split data among the plurality of split data is second packetized data; A second acquisition module, configured for the transmission control node to acquire a second transmission node according to a routing pointer in the routing table; A second transmission module, configured for the transmission control node to transmit the second packet data to the second transmission node; A second analysis module, configured for the second transmission node to analyze the second packet data to obtain the preset receiving node; The second sending module is used for the second transmission node to send the second packet data to the preset receiving node.

7. A device, characterized in that The device includes a memory and a processor, the memory is used to store instructions or codes, and the processor is used to execute the instructions or codes, so that the device performs the data transmission method according to any one of claims 1 to 5.

8. A computer storage medium, characterized in that The computer storage medium stores codes, and when the codes are executed, the computer storage device executing the codes implements the data transmission method according to any one of claims 1 to 5.

Images