Data transmission method and system, and storage medium and electronic device

Abstract

Disclosed in the present application are a data transmission method and system, and a storage medium and an electronic device. The method comprises: acquiring initial message data and a target node; on the basis of the target node, determining link identifiers; using a set of hash functions to perform calculation on each link identifier, so as to determine a target bit string, wherein a target bit in the target bit string is a preset value, and the target bit is determined by means of a result of using each hash function in the set of hash functions to execute hash calculation on a target link identifier; and assembling the initial message data and the target bit string into target message data, and sending same to the target node. By means of the present application, the technical problem in the related art of the low data transmission efficiency of satellite network forwarding is solved, thereby achieving the effect of improving the data transmission efficiency of satellite network forwarding.

Description

Data transmission methods, systems, storage media and electronic devices

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411595852X, filed on November 8, 2024, entitled "Data Transmission Method, System, Storage Medium and Electronic Device", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of computers, and more specifically, to a data transmission method, system, storage medium, and electronic device. Background Technology

[0004] In related technologies, satellite network forwarding mainly adopts IP (Internet Protocol) forwarding, MPLS (Multi-Protocol Label Switching) forwarding from terrestrial network technologies, or forwarding based on the geographical or logical location address of the satellite according to the characteristics of the satellite network. However, in terms of forwarding methods, they all belong to table lookup forwarding. Data packets need to carry complete path information during the forwarding process, resulting in lower carrying efficiency as the path is longer.

[0005] This indicates that there is a technical problem with the low efficiency of satellite network data transmission in the relevant technologies.

[0006] There is currently no effective solution to the above problems. Summary of the Invention

[0007] This application provides a data transmission method, system, storage medium, and electronic device to at least solve the technical problem of low data transmission efficiency in satellite network forwarding in related technologies.

[0008] According to one embodiment of this application, a data transmission method is provided, comprising: acquiring initial message data and a target node; determining a link identifier based on the target node, wherein the link identifier is used to indicate the nodes through which the initial message data is sent to the target node; calculating a target bit string for each link identifier using a set of hash functions, wherein the target bit in the target bit string is a preset value, and the target bit is determined by performing hash calculations on the target link identifier using each of the set of hash functions; assembling the initial message data and the target bit string into target message data and sending it to the target node.

[0009] In an exemplary embodiment, the step of calculating the target bit string by using a set of hash functions for each of the link identifiers includes: obtaining a first link identifier, wherein the target link identifier includes the first link identifier; performing hash calculations on the first link identifier sequentially using k first hash functions to obtain k first target bits, wherein the set of hash functions includes the k first hash functions, k is a positive integer, and the target bits include the first target bits; updating the k first target bits in the initial bit string to the preset value to obtain a first target bit string, wherein each bit in the initial bit string is set to a default value.

[0010] In an exemplary embodiment, the step of sequentially performing hash calculations on the first link identifier using k first hash functions to obtain k first target bits includes: obtaining a second link identifier, wherein the target link identifier includes the second link identifier, and the first link identifier is different from the second link identifier; sequentially performing hash calculations on the second link identifier using the k first hash functions to obtain k second target bits, wherein the target bits include the second target bits; updating the k second target bits in the initial bit string to the preset value to obtain a second target bit string; and determining the target bit string based on the first target bit string and the second target bit string.

[0011] In an exemplary embodiment, after performing hash calculations on the second link identifier sequentially using the k first hash functions to obtain k second target bits, the method further includes: comparing whether the k first target bits and the k second target bits are completely identical; if the k first target bits and the k second target bits are not completely identical, updating the k second target bits in the initial bit string to the preset value to obtain a second target bit string, and determining the target bit string based on the first target bit string and the second target bit string; or, if the k first target bits and the k second target bits are completely identical, reselecting k second hash functions to perform hash calculations on the first link identifier and the second link identifier sequentially to obtain k third target bits and k fourth target bits, wherein the target bits include the third target bits and the fourth target bits; updating the k first target bits and the k second target bits in the initial bit string to the preset value to obtain the target bit string.

[0012] In an exemplary embodiment, the step of obtaining initial message data and a target node, and determining a link identifier based on the target node, includes: obtaining the initial message data, the target node, and a set of hash functions; determining the set of links through which the initial message data is sent to the target node based on a predetermined link relationship and the target node, and determining the set of hash functions from the set of hash functions; determining the link identifier and the length of the target bit string based on the set of links, wherein the length of the target bit string is positively correlated with the number of links in the set of links.

[0013] In one exemplary embodiment, the method further includes: controlling a starting satellite node to acquire the initial message data and a target satellite node from a satellite system; determining the link identifier based on the target satellite node, wherein the initial message data is configured to be sent from the starting satellite node to the target satellite node; controlling the starting satellite node to calculate the target bit string for each link identifier using the set of hash functions; and controlling the starting satellite node to calculate the local bit string based on a local link identifier using the set of hash functions, wherein the local target bit in the local bit string is set to the preset value to indicate the local link identifier. The local target bit is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the starting satellite node. The starting satellite node is controlled to compare the target bit string and the local bit string to determine the next-hop link identifier. The next-hop link identifier indicates that the same bits in the local bit string and the target bit string all have the link identifier indicated by the preset value. The starting satellite node is controlled to send the target message data to the node corresponding to the next-hop link identifier based on the next-hop link identifier until it is sent to the target node.

[0014] According to another embodiment of this application, a data transmission method is provided, comprising: receiving target message data, wherein the target message data includes a target bit string, initial message data, and a hash function identifier, the initial message data representing message data sent by a starting node, the hash function identifier being used to determine a set of hash functions, the target bit string being determined by performing hash calculations on a link identifier using each of the set of hash functions, the link identifier being used to identify the link that needs to be traversed during the transmission of the initial message data; calculating a local bit string based on a local link identifier using the set of hash functions, wherein the local bit string is determined by performing hash calculations on the local link identifier using each of the set of hash functions, the local link identifier representing the identifier corresponding to the link connected to the current node; comparing the target bit string and the local bit string to determine a next-hop link identifier, wherein the next-hop link identifier represents a link identifier in which the same bits in both the local bit string and the target bit string have a preset value; and, if the next-hop link identifier exists, sending the target message data to the node corresponding to the next-hop link identifier.

[0015] In an exemplary embodiment, after determining the local bit string by calculating using the set of hash functions based on the local link identifier, the method further includes: if the target packet data includes the remaining path length, determining whether the remaining path length meets a preset length condition; if the remaining path length meets the preset length condition, comparing the target bit string and the local bit string to determine the next-hop link identifier; if the next-hop link identifier exists, sending the target packet data to the node corresponding to the next-hop link identifier; if the remaining path length does not meet the preset length condition, parsing the target packet data to obtain the initial packet data.

[0016] In an exemplary embodiment, the step of comparing the target bit string and the local bit string to determine a next-hop link identifier when the remaining path length meets the preset length condition, and sending the target packet data to the node corresponding to the next-hop link identifier based on the next-hop link identifier, includes: comparing the target bit string and the local bit string to determine whether the next-hop link identifier exists when the remaining path length meets the preset length condition; modifying the remaining path length and sending the target packet data to the node corresponding to the next-hop link identifier when the next-hop link identifier exists; and parsing the target packet data to obtain the initial packet data when the next-hop link identifier does not exist.

[0017] In an exemplary embodiment, the method further includes: controlling the current satellite node to receive the target message data, wherein the initial message data represents message data sent by the starting satellite node, and the link identifier includes a link that needs to be traversed to identify the initial message data from the starting satellite node to the current satellite node; controlling the current satellite node to calculate the local bit string based on the local link identifier using the set of hash functions, wherein the local link identifier represents the identifier corresponding to the link to which the current satellite node is connected; controlling the current satellite node to compare the target bit string and the local bit string to determine the next-hop link identifier; and, if the next-hop link identifier exists, controlling the current satellite node to send the target message data to the satellite node corresponding to the next-hop link identifier.

[0018] According to another embodiment of this application, a data transmission system is provided, including: a starting node, a current node, and a target node, wherein the starting node is configured to acquire initial message data and the target node, and determine a link identifier based on the target node; calculate a target bit string for each link identifier using a set of hash functions, wherein the target bit in the target bit string is a preset value, and the target bit is determined by performing hash calculations on the target link identifier using each of the set of hash functions; assemble the initial message data and the target bit string into target message data and send it to the target node; the current node is configured to receive the target message data; based on this... The local bit string is determined by calculating the local link identifier using the set of hash functions. The local bit string is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the current node. The target bit string and the local bit string are compared to determine the next-hop link identifier. The next-hop link identifier represents the link identifier where the same bits in both the local bit string and the target bit string have preset values. If the next-hop link identifier exists, the target packet data is sent to the node corresponding to the next-hop link identifier until it reaches the target node.

[0019] According to another embodiment of this application, a frame structure is provided for Ethernet frames. The Ethernet frame includes an Ethernet header, a destination field, and a payload: the Ethernet header is located at the beginning of the Ethernet frame and connected to the destination field, and the Ethernet header is used to encapsulate header information of network data; the destination field is located between the Ethernet header and the payload, and the destination field includes a hash function identifier field, a destination bit string field, and a network packet header field; wherein, the destination bit string field is used to indicate the destination bit string, the destination bit in the destination bit string is a preset value, the destination link identifier is used to indicate the node through which the network data is sent to the destination node, and the destination bit is determined by performing a hash calculation on the destination link identifier using a set of hash functions, the set of hash functions being specified by the hash function identifier field; the payload is located at the end of the Ethernet frame and connected to the destination field, and is used to encapsulate the network data.

[0020] In one exemplary embodiment, the target field further includes: a path length field for indicating the number of target link identifiers; and a target bit string length field for indicating the length of the target bit string.

[0021] In one exemplary embodiment, the hash function identification field includes: a hash function set identification field, used to indicate the hash function set to which the group of hash functions belongs; and a hash function number field, used to indicate the number of hash functions in the group of hash functions.

[0022] According to yet another embodiment of this application, a computer-readable storage medium is also provided, wherein a computer program is stored therein, and the computer program is configured to perform the steps in any of the above method embodiments when it is run.

[0023] According to yet another embodiment of this application, an electronic device is also provided, including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0024] According to yet another embodiment of this application, a computer program product is also provided, including a computer program that, when executed by a processor, implements the steps of the methods described in various embodiments of this application.

[0025] This application obtains initial message data and, through the target node, specifies the nodes the initial message data must pass through to reach the target node. A set of hash functions is used to calculate the target bit string for each link identifier. The target bit in the target bit string, calculated using the hash function, indicates the target link identifier. The initial message data and the target bit string are assembled to obtain the target message data, which is then sent to the target node. By using hash functions to calculate the target bit string, the target message data, containing both the initial message data and the target bit string, can be directly sent to the target node, avoiding the time loss caused by table lookups during transmission. Therefore, this solves the technical problem of low data transmission efficiency in satellite network forwarding in related technologies, thereby improving the efficiency of satellite network data transmission. Attached Figure Description

[0026] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments of this application and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0027] Figure 1 is a hardware structure block diagram of a mobile terminal according to an embodiment of the present application of a data transmission method;

[0028] Figure 2 is a schematic diagram of a data transmission system architecture according to an embodiment of this application;

[0029] Figure 3 is a flowchart of a data transmission method according to an embodiment of this application;

[0030] Figure 4 is a schematic diagram of constructing a bit string using the Bloom filter algorithm according to an embodiment of this application;

[0031] Figure 5 is a flowchart of the initial message data encapsulation according to an embodiment of this application;

[0032] Figure 6 is a schematic diagram of the initial message data encapsulation information according to an embodiment of this application;

[0033] Figure 7 is a schematic diagram of the data forwarding process of the head node according to an embodiment of this application;

[0034] Figure 8 is a flowchart of a data transmission method according to an embodiment of this application;

[0035] Figure 9 is a schematic diagram of the data forwarding process implemented by the forwarding node according to an embodiment of this application;

[0036] Figure 10 is a schematic diagram of the data forwarding process of the forwarding node according to an embodiment of this application. Detailed Implementation

[0037] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0038] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0039] The present application will be described below with reference to embodiments:

[0040] The methods and embodiments provided in this application can be executed in a mobile terminal, computer terminal, or similar computing device. Taking a mobile terminal as an example, FIG1 is a hardware structure block diagram of a mobile terminal for a data transmission method according to an embodiment of this application. As shown in FIG1, the mobile terminal may include one or more (only one is shown in FIG1) processors 102 (processors 102 may include, but are not limited to, microprocessors MCUs or programmable logic devices FPGAs, etc.) and a memory 104 configured to store data. The mobile terminal may also include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that the structure shown in FIG1 is only illustrative and does not limit the structure of the mobile terminal. For example, the mobile terminal may include more or fewer components than shown in FIG1, or have a different configuration than shown in FIG1.

[0041] The memory 104 may be configured to store computer programs, such as application software programs and modules, like the computer program corresponding to the data transmission method in this embodiment. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thereby implementing the aforementioned method. The memory 104 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0042] The transmission device 106 is configured to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by the mobile terminal's communication provider. In one example, the transmission device 106 includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device 106 may be a Radio Frequency (RF) module configured to communicate with the Internet wirelessly.

[0043] Figure 2 shows a schematic diagram of a data transmission system architecture according to an embodiment of this application, including: a starting node, a current node, and a target node. The starting node is configured to acquire initial message data and the target node, and determine a link identifier based on the target node. A set of hash functions is used to calculate a target bit string for each link identifier, wherein the target bit in the target bit string is a preset value, and the target bit is determined by performing hash calculations on the target link identifier using each of the hash functions in the set of hash functions. The initial message data and the target bit string are assembled into target message data and sent to the target node. The current node is configured to receive the target message data. The local bit string is determined by calculating the local link identifier using the set of hash functions. The local bit string is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the current node. The target bit string and the local bit string are compared to determine the next-hop link identifier. The next-hop link identifier represents the link identifier where the same bits in both the local bit string and the target bit string have a preset value. If the next-hop link identifier exists, the target packet data is sent to the node corresponding to the next-hop link identifier until it reaches the target node.

[0044] The method embodiments provided in this application can be applied to the data transmission system architecture shown in Figure 2.

[0045] This embodiment provides a data transmission method. Figure 3 is a flowchart of the data transmission method according to an embodiment of this application. As shown in Figure 3, the process includes the following steps:

[0046] Step S302: Obtain initial message data and target node, and determine link identifier based on the target node, wherein the link identifier is used to indicate the nodes through which the initial message data is sent to the target node;

[0047] Step S304: For each of the link identifiers, a set of hash functions are used to calculate and determine the target bit string, wherein the target bit in the target bit string is a preset value, and the target bit is determined by performing hash calculations on the target link identifier using each of the hash functions in the set of hash functions.

[0048] Step S306: Assemble the initial message data and the target bit string into target message data and send it to the target node.

[0049] In the above embodiments, the initial message data can be understood as message data carrying the link nodes and target node that need to be traversed during transmission. The link identifier can be understood as indicating the nodes that the initial message data needs to pass through to reach the target node. The target node can be the tail node, representing the final node that receives the initial message data, and can transmit the obtained initial message data to the gateway station. A hash function can transform an input of arbitrary length into a fixed-length output through a hash algorithm. It is a data structure that can be directly accessed based on a key value. Records are accessed by mapping the key value to a position in a table, thus speeding up the search process.

[0050] In the above embodiments, the target link identifier can be calculated using a set of hash functions to obtain the target bit. The target bit in the target bit string can be set to a preset value after calculation to indicate different target link identifiers. The preset value can be 1, but is not limited to this.

[0051] In the above embodiments, the Bloom filter algorithm can be used to map the link identifier to the Bloom filter data format. This allows direct selection of the initial data packet at the target node's exit point, avoiding conventional routing table lookup operations. It enables computational forwarding, improves processing speed, and reduces node processing latency. The Bloom filter algorithm is a fast lookup algorithm using multiple hash functions. It can determine whether an element is in a set without storing the element, saving storage space while improving space efficiency and query speed. By creating a target bit string for the target element, the initial packet data and the target bit string can be assembled into target packet data and sent to the target node.

[0052] This application obtains initial message data and nodes determined by the target node that indicate the path the initial message data must traverse to reach the target node. A set of hash functions is used to calculate the target bit string for each link identifier. The target bit in the target bit string, calculated using the hash function, indicates the target link identifier. The initial message data and the target bit string are assembled to obtain the target message data, which is then sent to the target node. By using hash functions to calculate the target bit string, the target message data, containing both the initial message data and the target bit string, can be directly sent to the target node, avoiding the time loss caused by table lookups during transmission. Therefore, this solves the technical problem of low data transmission efficiency in satellite network forwarding in related technologies, thereby improving the efficiency of satellite network data transmission.

[0053] Optionally, the entity performing the above steps can be the head node or a ground control networker, but is not limited to these.

[0054] In an exemplary embodiment, the step of calculating the target bit string by using a set of hash functions for each of the link identifiers includes: obtaining a first link identifier, wherein the target link identifier includes the first link identifier; performing hash calculations on the first link identifier sequentially using k first hash functions to obtain k first target bits, wherein the set of hash functions includes the k first hash functions, k is a positive integer, and the target bits include the first target bits; updating the k first target bits in the initial bit string to the preset value to obtain a first target bit string, wherein each bit in the initial bit string is set to a default value.

[0055] In the above embodiments, a certain link identifier (i.e., the first link identifier mentioned above) and k different hash functions (i.e., the k first hash functions mentioned above) are selected from the target link identifiers. The input link identifier is hashed using the k hash functions respectively, as shown in Figure 4. Figure 4 is a schematic diagram of constructing a bit string according to the Bloom filter algorithm of this application embodiment. An m-bit bit string is created and initialized to the default value of 0. The input element link identifier is represented as e, and the hash result of the i-th hash function on the input element e is recorded as r. i =h i (e) If the hash calculation result r1 of the first hash function is h1(e) = 8, then the target bit of the 8th bit in the bit string is updated to the preset value 1. K hash functions are then performed on the input element e to obtain k first target bits. These k first target bits are then updated to the preset value 1 to obtain the first target bit string. Constructing the bit string using the Bloom filter algorithm and mapping the link identification information to the Bloom filter data format avoids the routing table lookup operation in traditional transmission, reduces node computation time, and improves overall transmission efficiency.

[0056] In the above embodiments, the Bloom filter mechanism can also be used for set determination. Suppose there is a set E. Based on the attribute characteristics of the elements in the set, a BA is constructed for the set. Then, through multi-hash mapping, it is possible to quickly determine whether element e belongs to set E.

[0057] In an exemplary embodiment, the step of sequentially performing hash calculations on the first link identifier using k first hash functions to obtain k first target bits includes: obtaining a second link identifier, wherein the target link identifier includes the second link identifier, and the first link identifier is different from the second link identifier; sequentially performing hash calculations on the second link identifier using the k first hash functions to obtain k second target bits, wherein the target bits include the second target bits; updating the k second target bits in the initial bit string to the preset value to obtain a second target bit string; and determining the target bit string based on the first target bit string and the second target bit string.

[0058] In the above embodiment, a second link identifier, different from the first link identifier, and k identical first hash functions are selected from the target link identifier. The second link identifier is then hashed using the same k first hash functions to obtain k second target bits. These k second target bits are then updated to a preset value of 1 to obtain a second target bit string. The target bit string can be determined based on the first and second target bit strings. The hash functions are calculated sequentially by bit, which is much shorter than the data length of an IP address or MPLS label, greatly improving data carrying efficiency.

[0059] In an exemplary embodiment, after performing hash calculations on the second link identifier sequentially using the k first hash functions to obtain k second target bits, the method further includes: comparing whether the k first target bits and the k second target bits are completely identical; if the k first target bits and the k second target bits are not completely identical, updating the k second target bits in the initial bit string to the preset value to obtain a second target bit string, and determining the target bit string based on the first target bit string and the second target bit string; or, if the k first target bits and the k second target bits are completely identical, reselecting k second hash functions to perform hash calculations on the first link identifier and the second link identifier sequentially to obtain k third target bits and k fourth target bits, wherein the target bits include the third target bits and the fourth target bits; updating the k first target bits and the k second target bits in the initial bit string to the preset value to obtain the target bit string.

[0060] In the above embodiments, for two different input elements, a hash collision will occur when the k hash mapping results are completely identical, i.e., the generated bit strings are exactly the same. When the k first target bits obtained by the same k first hash functions are not completely identical to the k second target bits, the k second target bits can be updated to a preset value of 1 to obtain the second target bit string, and the target bit string can be determined based on the first target bit string and the second target bit string.

[0061] In the above embodiment, when the k first target bits obtained by the same k first hash functions are exactly the same as the k second target bits, k second hash functions different from the first hash functions are selected, and the first link identifier and the second link identifier are calculated by the k second hash functions in sequence to obtain k third target bits and k fourth target bits. The k third target bits and k fourth target bits are updated to the preset value 1 to obtain the target bit string.

[0062] In the above embodiment, an x-bit bit string can be constructed and initialized to the default value of 0. K=4 first hash functions can be selected to perform hash calculations on the first link identifier and the second link identifier. The first target bit r1 of the hash calculation result in the first link identifier can be h1(e)=2, the second target bit r2 can be h2(e)=3, the third target bit r3 can be h3(e)=7, and the fourth target bit r4 can be h4(e)=10. The target bits of the 2nd, 3rd, 7th and 10th bits in the initial bit string are updated to the preset value 1 respectively.

[0063] In the above embodiments, when the k first target bits and the k second target bits are completely identical, that is, when the first second target bit, the second second target bit, the third second target bit, and the fourth second target bit of the hash calculation result in the second link identifier are completely identical to the four first target bits in the first link identifier, that is, the hash calculation result r in the second link identifier... 1＝ h1(e) = 2, r 2＝ h2(e) = 3, r 3＝ h3(e) = 7, r 4＝ If h4(e) = 10, then k second hash functions are selected to recalculate the first link identifier and the second link identifier, resulting in k third target bits and k fourth target bits.

[0064] In the above embodiments, when the k first target bits and the k second target bits are not completely identical, the k second target bits are updated to a preset value of 1. That is, as long as one of the four second target bits in the hash calculation result of the second link identifier differs from the first target bit, it is sufficient. For example, r1 can be different, but r2, r3, and r4 can be the same; or r1 and r2 can be different, but r3 and r4 can be the same. This application does not impose any restrictions on this. By comparing the target bits of different link identifiers, duplicate links can be avoided when determining the next link during data transmission, and the time consumption caused by data transmission stalls due to problems can be reduced. In an exemplary embodiment, the step of obtaining initial message data and a target node, and determining a link identifier based on the target node, includes: obtaining the initial message data, the target node, and a set of hash functions; determining the set of links through which the initial message data is sent to the target node based on a predetermined link relationship and the target node, and determining the set of hash functions from the set of hash functions; determining the link identifier and the length of the target bit string based on the set of links, wherein the length of the target bit string is positively correlated with the number of links in the set of links.

[0065] In the above embodiments, the satellite network topology is basically fixed, and the number of nodes and inter-satellite links is limited. Assuming the satellite constellation has M orbits and N satellites in each orbit, the total number of inter-satellite links is 2NM. Each inter-satellite link is assigned a link identifier. Through the operation of the routing protocol, the centralized controller or each satellite node can grasp the entire network topology information. The link identifier can be represented by `linkID`. Encapsulating the link identifier information of the nodes to which data needs to reach within the satellite nodes and performing computational forwarding during the forwarding process can effectively improve forwarding efficiency while reducing the forwarding overhead of the nodes.

[0066] In the above embodiments, the pre-determined link relationship can be the link with the shortest transmission path, or it can be a link that must include a certain transmission node. The flowchart for implementing the initial message data encapsulation process can be found in Figure 5. As shown in Figure 5, the set of links through which the initial message data is transmitted is determined based on the pre-determined link relationship (i.e., the forwarding path length) and the target node. The target bit string length and link identifier (linkID) can be determined through the link set. The number of hash functions is selected based on the link relationship and the target bit string length. The target bit string data is calculated using the link identifier (linkID), hash functions, and the target bit string length (m), and then encapsulated and sent. The message format of the initial message data can be found in Figure 6. As shown in Figure 6, the initial message data encapsulation information can include the path length, hash function set identifier, number of hash functions, target bit string length, and target bit string data.

[0067] In one exemplary embodiment, the method further includes: controlling a starting satellite node to acquire the initial message data and a target satellite node from a satellite system; determining the link identifier based on the target satellite node, wherein the initial message data is configured to be sent from the starting satellite node to the target satellite node; controlling the starting satellite node to calculate the target bit string for each link identifier using the set of hash functions; and controlling the starting satellite node to calculate the local bit string based on a local link identifier using the set of hash functions, wherein the local target bit in the local bit string is set to the preset value to indicate the local link identifier. The local target bit is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the starting satellite node. The starting satellite node is controlled to compare the target bit string and the local bit string to determine the next-hop link identifier. The next-hop link identifier indicates that the same bits in the local bit string and the target bit string all have the link identifier indicated by the preset value. The starting satellite node is controlled to send the target message data to the node corresponding to the next-hop link identifier based on the next-hop link identifier until it is sent to the target node.

[0068] In the above embodiments, the starting satellite node can be the head node. A schematic diagram of the head node's data forwarding process can be found in Figure 7. As shown in Figure 7, the head node S1 obtains initial message data from the satellite system and the target satellite node (i.e., the tail node S9). Based on the target satellite node, it determines the link identifiers (i.e., link1, link2, link3, and link4). It then performs hash calculations on link identifiers link1, link2, link3, and link4 using a set of hash functions to determine the target bit string. The head node performs hash calculations on link identifiers link1 and link5 (i.e., the aforementioned local link identifiers) using the same set of hash functions, updating the corresponding local target bits to a preset value of 1 to obtain the local bit string. By comparing the local bit string with the target bit string, if the corresponding bits in both the local and target bit strings have a preset value of 1 (i.e., the bit string calculated by link1 and the target bit string both have a preset value of 1), the link identifier corresponding to the aforementioned local bit string (i.e., link1) is determined as the next-hop link identifier, and the target message data is sent until it reaches the target node S9. Mapping the path information carried in the data packet to a set of bit strings reduces the computation length during transmission and greatly improves transmission efficiency compared to MPLS forwarding with multiple 20-label information and multiple 128-bit SIDs (Segment Identifiers) carried by SRv6 (Segment Routing over IPv6).

[0069] This embodiment provides a data transmission method. Figure 8 is a flowchart of the data transmission method according to an embodiment of this application. As shown in Figure 8, the process includes the following steps:

[0070] Step S802: Receive target message data, wherein the target message data includes a target bit string, initial message data, and a hash function identifier. The initial message data represents message data sent by the starting node. The hash function identifier is used to determine a set of hash functions. The target bit string is determined by performing hash calculations on the link identifier using each hash function in the set of hash functions. The link identifier is used to identify the link that needs to be traversed during the initial message data transmission process.

[0071] Step S804: Based on the local link identifier, the set of hash functions are used to calculate and determine the local bit string. The local bit string is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the current node.

[0072] Step S806: Compare the target bit string and the local bit string to determine the next-hop link identifier, wherein the next-hop link identifier indicates that the same bits in the local bit string and the target bit string all have the link identifier indicated by a preset value.

[0073] Step S808: If the next-hop link identifier exists, send the target packet data to the node corresponding to the next-hop link identifier.

[0074] In the above embodiments, the initial message data can be understood as message data carrying the link nodes that need to be passed through during the transmission process and the target node. The link identifier can be understood as the link that needs to be passed to reach the target node. The hash function can transform an input of arbitrary length into an output of fixed length through a hash algorithm. It is a data structure that can be directly accessed based on the key value. The record is accessed by mapping the key value to a position in the table to speed up the search.

[0075] In the above embodiments, a Bloom filter algorithm can be used to map the link identifier to a Bloom filter data format. The Bloom filter algorithm is a fast lookup algorithm using multiple hash functions, which can determine whether an element is in a set without storing the element, saving storage space while improving space efficiency and query speed. By creating a target bit string for the target element, the initial message data, the target bit string, and the hash function identifier can be assembled into target message data and sent to the node corresponding to the next-hop link identifier.

[0076] In the above embodiments, the local link identifier can be understood as the identifier corresponding to the link connected to the forwarding node. A set of hash functions is used to calculate the local target bit using the local link identifier, updating the corresponding local target bits to a preset value of 1 to obtain the local bit string. The link identifier is determined based on the target star node, and a set of hash functions is used to hash the link identifier to determine the target bit string. By comparing the local bit string with the target bit string, if the corresponding bits in both the local and target bit strings have a preset value of 1, the link identifier corresponding to the local bit string is determined as the next-hop link identifier, and the target packet data is sent.

[0077] In the above embodiment, the forwarding node receives target packet data containing a target bit string, initial packet data, and a hash function identifier. For example, as shown in Figure 7, assuming S6 is a forwarding node, S6 receives the target bit string, initial packet data, and hash function identifier from the head node S1 destined for S9. The hash function identifier can be a pre-determined set of hash functions with k=4. The target bit string can be a bit string calculated by link1, link2, link3, and link4 using four hash functions, and can contain 16 target bits. Forwarding node S6 calculates the local link identifier (including link6 from S6 to S5 and link4 from S6 to S9) according to the four hash functions to obtain the local bit string. The local bit string is compared with the target bit string. If four target bits in the target bit string are the same as the local bit string in the local link identifier (i.e., the local bit string calculated by link4), the link4 link identifier can be determined as the next-hop link identifier, and the target packet data is sent to the node S9 corresponding to link4.

[0078] This application, upon obtaining target message data including the target bit string, initial message data, and hash function identifier, calculates the local link identifier using a set of hash functions, updates the corresponding local target bits to a preset value of 1 to obtain the local bit string. By comparing the target bits in the local bit string and the target bit string, if the corresponding bits in both the local bit string and the target bit string have a preset value of 1, the link identifier corresponding to the aforementioned local bit string can be determined as the next-hop link identifier, and the target message data can be sent. Since the target bit string is calculated using hash functions, the next-hop link identifier can be directly determined by comparing the local bit string and the target bit string, avoiding the time loss caused by table lookups during transmission. Therefore, it can solve the technical problem of low data transmission efficiency in satellite network forwarding in related technologies, thereby improving the data transmission efficiency of satellite networks.

[0079] Optionally, the entity performing the above steps can be a forwarding node, but is not limited to this.

[0080] In an exemplary embodiment, after determining the local bit string by calculating using the set of hash functions based on the local link identifier, the method further includes: if the target packet data includes the remaining path length, determining whether the remaining path length meets a preset length condition; if the remaining path length meets the preset length condition, comparing the target bit string and the local bit string to determine the next-hop link identifier; if the next-hop link identifier exists, sending the target packet data to the node corresponding to the next-hop link identifier; if the remaining path length does not meet the preset length condition, parsing the target packet data to obtain the initial packet data.

[0081] In the above embodiments, after determining the local bit string through a set of hash functions, it is determined whether the remaining path length of the target packet data meets a preset length condition, wherein the preset condition can be that the remaining path length is greater than 0. The data forwarding process of the forwarding node can be referred to Figure 9. As shown in Figure 9, the forwarding node extracts path length information. When the remaining path length of the target packet data is greater than 0, it compares the target bit string and the local bit string to determine whether a next-hop link identifier exists. If it does, the target packet data is sent to the node corresponding to the next-hop link identifier. When the remaining path length of the target packet data is less than 0, the node is treated as the end node, and the target packet data is parsed to obtain the initial packet data, ending the forwarding operation. The forwarding node only needs to calculate the local link directly connected to it and, by comparing it with the target link, can directly lock the next-hop link identifier in the target link, avoiding the time consumption of table lookup by the forwarding node and effectively reducing the forwarding time of the node.

[0082] In an exemplary embodiment, the step of comparing the target bit string and the local bit string to determine a next-hop link identifier when the remaining path length meets the preset length condition, and sending the target packet data to the node corresponding to the next-hop link identifier based on the next-hop link identifier, includes: comparing the target bit string and the local bit string to determine whether the next-hop link identifier exists when the remaining path length meets the preset length condition; modifying the remaining path length and sending the target packet data to the node corresponding to the next-hop link identifier when the next-hop link identifier exists; and parsing the target packet data to obtain the initial packet data when the next-hop link identifier does not exist.

[0083] In the above embodiments, when the target packet data includes a path remaining length greater than 0, the target bit string and the local bit string are compared to determine whether a next-hop link identifier exists, as shown in Figure 9. If a link identifier match is found, the remaining path length is decremented by one, and the target packet data is sent to the node corresponding to the next-hop link identifier. If no match is found, the target packet data is parsed to obtain the initial packet data, and the forwarding operation ends. Each time the corresponding link identifier is calculated, the remaining path length is decremented by 1, which reduces the computational workload of the next node. Furthermore, the remaining path length visually indicates the location of data transmission. When the remaining path length is 0, the packet data can be obtained directly.

[0084] In an exemplary embodiment, the method further includes: controlling the current satellite node to receive the target message data, wherein the initial message data represents message data sent by the starting satellite node, and the link identifier includes a link that needs to be traversed to identify the initial message data from the starting satellite node to the current satellite node; controlling the current satellite node to calculate the local bit string based on the local link identifier using the set of hash functions, wherein the local link identifier represents the identifier corresponding to the link to which the current satellite node is connected; controlling the current satellite node to compare the target bit string and the local bit string to determine the next-hop link identifier; and, if the next-hop link identifier exists, controlling the current satellite node to send the target message data to the satellite node corresponding to the next-hop link identifier.

[0085] In the above embodiment, the current satellite node can be a forwarding node. A schematic diagram of the data forwarding process of the forwarding node can be found in Figure 10. The system predefines multiple hash function sets and performs full network synchronization. The forwarding path from forwarding node S1 to tail node S9 is the link identifier set S1-S2-S3-S6-S9. Forwarding node S1 receives target packet data sent from the starting satellite node. It performs hash calculations on the local link identifiers (i.e., link identifiers S1-S2, S1-S4, and S1-S10) using a set of hash functions, updating the corresponding local target bits to a preset value of 1 to obtain a local bit string. By comparing the local bit string with the target bit string, if the same bits in both the local and target bit strings have a preset value of 1 (i.e., the bit string calculated by link S1-S2 and the target bit string both have a preset value of 1), the link identifier corresponding to the local bit string (i.e., link S1-S2) is determined as the next-hop link identifier. The remaining path length is decremented by one, and the target packet data is sent. S2, acting as the next forwarding node, uses the corresponding hash function based on the hash function set identifier and the number of hash functions k carried in the packet. It then performs hash mapping calculations on the link identifiers of links S2-S3, S2-S5, and S2-S11 corresponding to the node. If a match is found in link S2-S3 (i.e., the bit string calculated for link S2-S3 has a preset value of 1 for the same bits as the target bit string), the remaining path length is decremented by one, and the packet is forwarded to node S3. Nodes S3 and S6 repeat the above forwarding steps, eventually forwarding the packet to node S9, reducing the remaining path length to 0, and ending the forwarding process. By calculating and comparing the local link identifier with the data packet encapsulated by the header node, the forwarding node can directly determine the next-hop link identifier. Furthermore, as the remaining path length decreases, the forwarding node can gradually reduce its computational workload. This improves the efficiency of each forwarding node and significantly reduces the overall transmission time.

[0086] This embodiment provides a frame structure applied to Ethernet frames, as shown in Figure 6. The Ethernet frame includes an Ethernet header, a destination field, and a payload: the Ethernet header is located at the beginning of the Ethernet frame and connected to the destination field; the Ethernet header is used to encapsulate header information of network data. The destination field is located between the Ethernet header and the payload, and includes a hash function identifier field, a destination bit string field, and a network packet header field. The destination bit string field indicates the destination bit string, where the destination bit is a preset value. The destination link identifier indicates the nodes through which the network data passes to the destination node. The destination bit is determined by performing a hash calculation on the destination link identifier using a set of hash functions, specified by the hash function identifier field. The payload is located at the end of the Ethernet frame and connected to the destination field, used to encapsulate the network data. The destination field also includes: a path length field indicating the number of destination link identifiers; and a destination bit string length field indicating the length of the destination bit string. The hash function identification field includes: a hash function set identification field, used to indicate the hash function set to which the group of hash functions belongs; and a hash function number field, used to indicate the number of hash functions in the group of hash functions.

[0087] In the above embodiments, as shown in Figure 6, the frame structure may include an Ethernet header, a destination field, and a payload. The Ethernet header encapsulates the header information of the network data. The destination field may include a hash function identifier field, a destination bit string field, a network packet header field, a path length field, and a destination bit string length field. The hash function identifier field further includes a hash function set identifier field and a hash function count field. The hash function set identifier field indicates the hash function set to which a set of hash functions belongs; the hash function count field indicates the number of hash functions in a set of hash functions. The payload, located at the end of the Ethernet frame, is connected to the destination field and can encapsulate the network data.

[0088] In the above embodiments, the target bit string field in the target field can indicate the target bit string. The target link identifier in the target bit string can be understood as indicating the nodes that the initial message data needs to pass through to reach the target node. The target node can be the tail node, representing the final node that receives the initial message data. The obtained initial message data can be sent to the gateway station. The target bit can be obtained by calculating through a set of hash functions. After calculation, the target bit in the target bit string can be set to a preset value to indicate different target link identifiers. The preset value can be 1, but is not limited to this.

[0089] In the above embodiments, a link identifier from the target link identifier and k different hash functions are selected. The input link identifier is hashed using the k hash functions respectively. The hash function can be specified by the hash function identifier field, as shown in Figure 4. Figure 4 is a schematic diagram of constructing a bit string according to the Bloom filter algorithm of this application embodiment. An m-bit bit string is created and initialized to the default value of 0. The input element link identifier is represented as e, and the hash result of the i-th hash function on the input element e is recorded as r. i =h i (e) If the hash calculation result r1 of the first hash function is h1(e) = 8, then the target bit of the 8th bit in the bit string is updated to the preset value 1. K hash functions are then performed on the input element e to obtain k first target bits. These k first target bits are then updated to the preset value 1 to obtain the first target bit string. By constructing the bit string using the Bloom filter algorithm and mapping the link identification information to the Bloom filter data format, the routing table lookup operation in traditional transmission can be avoided, reducing the computation time of nodes and improving overall transmission efficiency. In the above embodiment, the Bloom filter mechanism can also be used for set determination. Assuming there is a set E, a BA is constructed for the set based on the attribute characteristics of the elements in the set. Then, through multi-hash mapping, it is possible to quickly determine whether element e belongs to set E.

[0090] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0091] Embodiments of this application also provide a computer-readable storage medium storing a computer program, wherein the computer program is configured to execute the steps in any of the above method embodiments when run.

[0092] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard drive, magnetic disk, or optical disk. Embodiments of this application also provide an electronic device including a memory and a processor. The memory stores a computer program, and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0093] In one exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor and the input / output device is connected to the processor.

[0094] Embodiments of this application also provide a computer program product, including a computer program that, when executed by a processor, implements the steps of the methods in various embodiments of this application.

[0095] Specific examples in this embodiment can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0096] Obviously, those skilled in the art should understand that the modules or steps of this application described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those presented here, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, this application is not limited to any particular combination of hardware and software.

[0097] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the principles of this application should be included within the protection scope of this application.

Claims

1. A data transmission method, comprising: Acquire initial message data and target node, and determine link identifier based on the target node, wherein the link identifier is used to indicate the nodes through which the initial message data is sent to the target node; For each of the link identifiers, a set of hash functions are used to calculate and determine the target bit string, wherein the target bit in the target bit string is a preset value, and the target bit is determined by performing hash calculations on the target link identifier using each of the hash functions in the set of hash functions; The initial message data and the target bit string are assembled into target message data and sent to the target node.

2. The method according to claim 1, wherein, The step of calculating the target bit string by using a set of hash functions for each of the link identifiers includes: Obtain the first link identifier, wherein the target link identifier includes the first link identifier; The first link identifier is hashed sequentially using k first hash functions to obtain k first target bits, wherein the set of hash functions includes the k first hash functions, k is a positive integer, and the target bits include the first target bits; The k first target bits in the initial bit string are updated to the preset values ​​to obtain the first target bit string, wherein each bit in the initial bit string is set to the default value.

3. The method according to claim 2, wherein, The step of sequentially performing hash calculations on the first link identifier using k first hash functions to obtain k first target bits includes: Obtain a second link identifier, wherein the target link identifier includes the second link identifier, and the first link identifier is different from the second link identifier; The second link identifier is hashed sequentially using the k first hash functions to obtain k second target bits, wherein the target bits include the second target bits; The k second target bits in the initial bit string are updated to the preset value to obtain the second target bit string, and the target bit string is determined based on the first target bit string and the second target bit string.

4. The method according to claim 3, wherein, After performing hash calculations on the second link identifier sequentially using the k first hash functions to obtain k second target bits, the method further includes: Compare whether the k first target bits and the k second target bits are completely identical; If the k first target bits and the k second target bits are not completely identical, the k second target bits in the initial bit string are updated to the preset value to obtain a second target bit string. The target bit string is then determined based on the first target bit string and the second target bit string; or... If the k first target bits and the k second target bits are exactly the same, k second hash functions are selected again to perform hash calculations on the first link identifier and the second link identifier in turn, so as to obtain k third target bits and k fourth target bits, wherein the target bits include the third target bits and the fourth target bits; The k first target bits and the k second target bits in the initial bit string are updated to the preset values ​​to obtain the target bit string.

5. The method according to claim 1, wherein, The step of obtaining initial message data and target node, and determining link identifier based on target node, includes: Obtain the initial message data, the target node, and the set of hash functions; Based on the predetermined link relationships and the target node, determine the set of links through which the initial message data is sent to the target node, and determine the set of hash functions from the set of hash functions; The link identifier and the length of the target bit string are determined based on the link set, wherein the length of the target bit string is positively correlated with the number of links in the link set.

6. The method according to any one of claims 1 to 5, wherein, The method further includes: The system controls the starting satellite node to acquire the initial message data and the target satellite node from the satellite system, and determines the link identifier based on the target satellite node, wherein the initial message data is configured to be sent from the starting satellite node to the target satellite node; The starting satellite node is controlled to use the set of hash functions to calculate the target bit string for each link identifier; The starting satellite node is controlled to perform calculations using the set of hash functions based on the local link identifier to determine the local bit string. The local target bit in the local bit string is set to the preset value to indicate the local link identifier. The local target bit is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions. The local link identifier represents the identifier corresponding to the link connected to the starting satellite node. The starting satellite node is controlled to compare the target bit string and the local bit string to determine the next-hop link identifier, wherein the next-hop link identifier indicates that the same bits in the local bit string and the target bit string all have the link identifier indicated by the preset value; The starting satellite node is controlled to send the target message data to the node corresponding to the next-hop link identifier based on the next-hop link identifier, until the data is sent to the target node.

7. A data transmission method, comprising: Receive target message data, wherein the target message data includes a target bit string, initial message data, and a hash function identifier. The initial message data represents message data sent by the starting node. The hash function identifier is used to determine a set of hash functions. The target bit string is determined by performing hash calculations on the link identifier using each of the hash functions in the set of hash functions. The link identifier is used to identify the link that needs to be traversed during the transmission of the initial message data. Based on the local link identifier, the set of hash functions are used to calculate and determine the local bit string, wherein the local bit string is determined by performing hash calculations on the local link identifier using each of the set of hash functions, and the local link identifier represents the identifier corresponding to the link connected to the current node. The target bit string and the local bit string are compared to determine the next-hop link identifier, wherein the next-hop link identifier indicates that the same bits in the local bit string and the target bit string all have the link identifier indicated by a preset value; If the next-hop link identifier exists, the target message data will be sent to the node corresponding to the next-hop link identifier.

8. The method according to claim 7, wherein, After determining the local bit string by calculating using the set of hash functions based on the local link identifier, the method further includes: If the target message data includes the remaining path length, determine whether the remaining path length meets a preset length condition; If the remaining path length meets the preset length condition, the target bit string and the local bit string are compared to determine the next-hop link identifier. If the next-hop link identifier exists, the target packet data is sent to the node corresponding to the next-hop link identifier. If the remaining length of the path does not meet the preset length condition, the target message data is parsed to obtain the initial message data.

9. The method according to any one of claims 7 to 8, wherein, The method further includes: Control the current satellite node to receive the target message data, wherein the initial message data represents the message data sent by the starting satellite node, and the link identifier includes the link that the initial message data needs to pass through to be sent from the starting satellite node to the current satellite node; The current satellite node is controlled to use the set of hash functions to calculate and determine the local bit string based on the local link identifier, wherein the local link identifier represents the identifier corresponding to the link to which the current satellite node is connected; The current satellite node is controlled to compare the target bit string and the local bit string to determine the next-hop link identifier; If the next-hop link identifier exists, control the current satellite node to send the target message data to the satellite node corresponding to the next-hop link identifier.

10. A data transmission system, comprising: The system comprises a starting node, a current node, and a target node. The starting node is configured to acquire initial message data and the target node, and to determine a link identifier based on the target node. A set of hash functions is used to calculate a target bit string for each link identifier. The target bit in the target bit string is a preset value, determined by hashing the target link identifier using each of the hash functions in the set of hash functions. The initial message data and the target bit string are assembled into target message data and sent to the target node. The current node is configured to receive the target message data; based on the local link identifier, a set of hash functions are used to calculate and determine the local bit string, wherein the local bit string is determined by performing hash calculations on the local link identifier using each of the hash functions in the set of hash functions, and the local link identifier represents the identifier corresponding to the link to which the current node is connected; the target bit string and the local bit string are compared to determine the next-hop link identifier, wherein the next-hop link identifier represents the link identifier in which the same bits in the local bit string and the target bit string all have the preset value; if the next-hop link identifier exists, the target message data is sent to the node corresponding to the next-hop link identifier until it is sent to the target node.

11. A computer-readable storage medium comprising a stored computer program, wherein, The computer program can be executed by an electronic device to perform the method described in any one of claims 1 to 6 or the method described in any one of claims 7 to 9.

12. A computer program product comprising a computer program that, when executed by a processor, implements the steps of the method according to any one of claims 1 to 6 or the steps of the method according to any one of claims 7 to 9.

13. An electronic device comprising a memory and a processor, the processor being configured to perform the method of any one of claims 1 to 6 or the method of any one of claims 7 to 9 by means of a computer program.

Images