Routing message transmission method, quantum key distribution network, node and storage medium

Abstract

The invention relates to the field of routing, and discloses a routing message transmission method, a quantum key distribution network, a node and a storage medium, and the method comprises the steps: generating a routing message; the routing message at least comprises a routing number of the target node; determining a next hop node of the routing message from the adjacent nodes of the initial node according to the routing number of the adjacent nodes of the initial node, the routing number of the target node and a longest equivalent character string algorithm; if the next-hop node is not the target node, the routing message is sent to the next-hop node, the next-hop node serves as an initial node until the next-hop node is the target node, and the routing message is sent to the target node. The stability of routing message transmission and the quantum key distribution network is improved, and the paralysis possibility of the quantum key distribution network when the quantum key distribution network is attacked is reduced.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of routing, and in particular to a routing message transmission method, a quantum key distribution network, a node, and a storage medium. Background Art

[0002] A network consisting of multiple (communication) nodes is called a quantum key distribution network. In a quantum key distribution network, nodes are responsible for transmitting routing messages between different networks. A node can transmit a routing message to another node to realize the routing and forwarding of routing messages.

[0003] In the prior art, the inter-domain communication of the quantum key distribution network relies on the sub-controller to report the network topology information to the main controller / central controller, and the main controller / central controller calculates the optimal routing path and transmits the routing message to the target node through the optimal routing path. However, once the main controller / central controller is unstable or attacked, the entire quantum key distribution network may face the risk of paralysis, making the stability of routing message transmission poor. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide a routing message transmission method, a quantum key distribution network, a node and a storage medium to improve the stability of routing message transmission.

[0005] In order to solve the above technical problems, an embodiment of the present application provides a routing message transmission method, the method comprising:

[0006] Generate a routing message; the routing message at least includes: a routing number of a target node;

[0007] According to the routing numbers of the adjacent nodes of the initial node, the routing number of the target node and the longest equal string algorithm, the next hop node of the routing message is determined from the adjacent nodes of the initial node; if the next hop node is not the target node, the routing message is sent to the next hop node and the next hop node is used as the initial node until the next hop node is the target node, and the routing message is sent to the target node.

[0008] The embodiment of the present application also provides a method for transmitting a routing message, wherein the method determines the next hop node of the routing message from the adjacent nodes of the initial node according to the routing number of the adjacent node of the initial node, the routing number of the target node, and the longest equal string algorithm, including:

[0009] Comparing the routing numbers of the multiple adjacent nodes of the initial node with the routing number of the target node according to the longest equal string algorithm, obtaining the longest equal values ​​of the multiple adjacent nodes of the initial node with respect to the multiple routing numbers of the target node;

[0010] According to the longest equal values ​​of the multiple routing numbers, a next hop node of the routing message is determined from multiple adjacent nodes of the initial node.

[0011] The embodiment of the present application further provides a method for transmitting a routing message, wherein the method determines the next hop node of the routing message from multiple adjacent nodes of the initial node according to the longest equal values ​​of the multiple routing numbers, including:

[0012] Determining a maximum longest equal routing number value among the plurality of longest equal routing number values;

[0013] According to the longest equal value of the maximum routing number, the next hop node of the routing message is determined from a plurality of adjacent nodes of the initial node.

[0014] The embodiment of the present application further provides a method for transmitting a routing message, wherein the method determines the next hop node of the routing message from multiple adjacent nodes of the initial node according to the longest equal value of the maximum routing number, including:

[0015] If the longest equal value of the maximum routing number corresponds to an adjacent node of the initial node, an adjacent node of the initial node corresponding to the longest equal value of the maximum routing number is used as the next hop node of the routing message.

[0016] The embodiment of the present application further provides a method for transmitting a routing message, wherein the method determines the next hop node of the routing message from multiple adjacent nodes of the initial node according to the longest equal value of the maximum routing number, including:

[0017] If the longest equal value of the maximum routing number corresponds to a plurality of the adjacent nodes, comparing the lengths of the routing numbers of the plurality of adjacent nodes corresponding to the longest equal value of the maximum routing number;

[0018] The adjacent node with the shortest routing number is selected as the next hop node of the routing message.

[0019] An embodiment of the present application further provides a method for transmitting a routing message, wherein the configuration file of the initial node includes the routing number of the initial node and the routing numbers of the adjacent nodes of the initial node.

[0020] The embodiment of the present application further provides a method for transmitting a routing message, wherein the method for determining the routing number of the neighboring node of the initial node includes:

[0021] Receiving a configuration file sent by an adjacent node of the initial node;

[0022] The routing numbers of the neighboring nodes of the initial node are determined according to the configuration files sent by the neighboring nodes of the initial node and the configuration file of the initial node.

[0023] The embodiment of the present application also provides a quantum key distribution network, including: a plurality of nodes; a network interconnection of the plurality of nodes;

[0024] The initial node is any one of the multiple nodes, and the initial node is used to execute any of the routing message transmission methods described above.

[0025] An embodiment of the present application also provides an initial node, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute any of the routing message transmission methods described above.

[0026] An embodiment of the present application further provides a computer-readable storage medium storing a computer program, wherein the computer program implements any of the above-mentioned routing message transmission methods when executed by a processor.

[0027] In the present application, when the routing message is transmitted, each next-hop node is selected in real time by the node where the routing message is currently located according to the routing number. The routing number of the destination node is compared in real time for routing. No main controller / central controller is required, which can reduce costs. A quantum key distribution network is established to realize the distribution of routing messages. There are no core nodes and routing calculation centers. The routing is directly compared in real time according to the routing number of the destination, which improves the stability of routing message transmission and quantum key distribution network, and reduces the possibility of paralysis of the quantum key distribution network when attacked. At the same time, the use of dial-up routing networking technology can also shorten the calculation time of routing messages during addressing and avoid meaningless loss of routing messages during transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] One or more embodiments are exemplarily described by the pictures in the corresponding drawings, and these exemplary descriptions do not constitute limitations on the embodiments.

[0029] Figure 1 It is a schematic diagram of the structure of a quantum key distribution network provided in an embodiment of the present application;

[0030] Figure 2 This is a flow chart of a first routing message transmission method provided in an embodiment of the present application;

[0031] Figure 3 is a flowchart of a second routing message transmission method provided in an embodiment of the present application;

[0032] Figure 4 is a flowchart of a third routing message transmission method provided in an embodiment of the present application;

[0033] Figure 5 is a flowchart of a fourth routing message transmission method provided in an embodiment of the present application;

[0034] Figure 6 is a flowchart of a fifth routing message transmission method provided in an embodiment of the present application;

[0035] Figure 7 It is a structural diagram of the initial node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0036] To make the purpose, technical scheme and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings. However, it will be appreciated by those skilled in the art that in the present application, many technical details are proposed in order to enable the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical scheme claimed in the present application can also be implemented. The division of the following embodiments is for the convenience of description, and the specific implementation of the present application should not be construed as any limitation, and the various embodiments can be combined and referenced with each other under the premise of no contradiction.

[0037] In the prior art, inter-domain communication relies on the sub-controllers reporting network topology information to the main controller / central controller, which then calculates the optimal routing path. However, this architecture has certain vulnerabilities: once the main controller / central controller runs unstably or is attacked, the entire quantum key distribution network may face the risk of paralysis, which exposes the system's shortcomings in stability and security.

[0038] In view of the above technical problems, the embodiments of the present application provide a quantum key distribution network. Figure 1 is a schematic diagram of the structure of a quantum key distribution network provided in an embodiment of the present application, such as Figure 1 As shown, the quantum key distribution network includes multiple nodes, and the networks of the multiple nodes are interconnected.

[0039] The IP network interconnection between nodes depends on human settings. For example, a user connects two nodes through a network cable to make the two nodes interconnected, or a user sets up a wireless bridge to make the two nodes interconnected, or uses other methods to connect two nodes to make the two nodes interconnected.

[0040] In the embodiment of the present application, the network interconnection of multiple nodes can be understood as each node being interconnected with at least one other node in the quantum key distribution network. The quantum key distribution network can also be called a routing message distribution network.

[0041] Each node has a corresponding routing number, which can be manually set and stored in the configuration file of each node. In the quantum key distribution network, all nodes exist in a tree topology, the routing number length of the child node is longer than the routing number length of the parent node, the routing number of the child node is an extension of the routing number of the parent node, and all child nodes under the parent node include the routing number of the parent node. For example, node 10 is the parent node of node 1, the routing number of node 10 is 0, the routing number of node 1 is 010, the routing number length of node 1 is longer than the routing number length of node 10, and the initial part number 0 of the routing number of node 1 is the routing number of node 10.

[0042] The initial node is any one of the multiple nodes in the quantum key distribution network, and the initial node wants to transmit a routing message to the target node. The target node is another node in the quantum key distribution network determined by the initial node according to business needs. For example, the initial node can be node 5, and the target node can be node 6.

[0043] In the embodiment of the present application, the initial node may also be a local node.

[0044] For example, when node 5 wants to transmit a routing message to node 6, node 5 first determines its own adjacent nodes, and then selects one of the adjacent nodes as the next hop node of the routing message based on the routing number of its own adjacent node, the routing number of node 6, and the longest equal string algorithm, so as to transmit the routing message to node 6 through the next hop node of the routing message. The next hop node of node 5 can be node 3.

[0045] The quantum key distribution network in the embodiment of the present application does not need to add a main controller / central controller, which can reduce costs and improve the stability of routing message transmission in the quantum key distribution network.

[0046] Based on the quantum key distribution network provided in the above embodiment, the embodiment of the present application also provides a routing message transmission method, Figure 2 is a flowchart of a first routing message transmission method provided in an embodiment of the present application, such as Figure 2 As shown, the routing message transmission method is applied to a local node or a starting node in the above-mentioned quantum key distribution network, and specifically includes the following steps.

[0047] Step 201: Generate a routing message.

[0048] The routing message at least includes: the routing number of the target node.

[0049] The routing message is generated by the initial node itself. The initial node can generate routing messages according to business needs. The routing message can also include: quantum keys, interactive information, etc., which are not specifically limited in the embodiments of this application. The interactive information usually contains a series of actions or requests for interacting with the target node to meet specific business needs. Transmitting quantum keys ensures that the data transmitted over the network is fully protected in terms of confidentiality, integrity and credibility, thereby improving the security of network communications between nodes.

[0050] The routing message needs to be transmitted from the initial node to the target node.

[0051] Step 202, according to the routing number of the adjacent node of the initial node, the routing number of the target node and the longest equal string algorithm, determine the next hop node of the routing message from the adjacent nodes of the initial node; if the next hop node is not the target node, send the routing message to the next hop node, and use the next hop node as the initial node, until the next hop node is the target node, and send the routing message to the target node.

[0052] For example, when the initial node is node 5 and the target node is node 6, the adjacent nodes of the initial node are node 11 and node 3. According to the routing number 01083630025 of node 11 and the routing number 0108363 of node 3 and the longest equal string algorithm, the next hop node of the routing message is determined to be node 3 from the adjacent nodes of the initial node. At this time, node 3 is not the target node. Node 5 sends the routing message to node 3, making node 3 the new initial node, and the target node remains unchanged; Node 3 determines that the next hop node of the routing message is node 1 according to the routing numbers of its adjacent nodes, the routing number of node 6 and the longest equal string algorithm. At this time, node 1 is not the target node either. Node 3 sends the routing message to node 1, making node 1 the new initial node, and the target node remains unchanged; Node 1 determines that the next hop node of the routing message is node 1 according to the routing numbers of its adjacent nodes, the routing number of node 6 and the longest equal string algorithm. According to the number, the routing number of node 6 and the longest equal string algorithm, the next hop node of the routing message is determined to be node 2. At this time, node 2 is not the target node either. Node 1 sends the routing message to node 2, making node 2 the new initial node, and the target node remains unchanged; according to the routing number of its adjacent node, the routing number of node 6 and the longest equal string algorithm, node 2 determines that the next hop node of the routing message is node 4. At this time, node 4 is not the target node either. Node 2 sends the routing message to node 4, making node 4 the new initial node, and the target node remains unchanged; according to the routing number of its adjacent node, the routing number of node 6 and the longest equal string algorithm, node 2 determines that the next hop node of the routing message is node 6. At this time, node 6 is the target node. Node 2 sends the routing message to node 6, and the routing message is consumed by node 6.

[0053] The embodiment of the present application provides a routing message transmission method. When the routing message is transmitted, each next-hop node is selected in real time by the node where the routing message is currently located according to the routing number and the longest equal string algorithm. The routing number of the destination node is compared and routed in real time. No main controller / central controller is required, which can reduce costs. A quantum key distribution network is established to realize the distribution of routing messages. There are no core nodes and routing calculation centers. The routing is directly compared and routed in real time according to the routing number of the destination. The stability of routing message transmission and quantum key distribution network is improved, and the possibility of paralysis of the quantum key distribution network when attacked is reduced. At the same time, the dial-up routing networking technology is adopted, which can also shorten the calculation time of routing messages when addressing and avoid meaningless loss of routing messages during transmission.

[0054] In the above Figure 2 Based on the routing message transmission method shown in the figure, the embodiment of the present application also provides another routing message transmission method. Figure 3 is a flow chart of a second routing message transmission method provided in an embodiment of the present application, such as Figure 3As shown, the above step 202 determines the next hop node of the routing message from the adjacent nodes of the initial node according to the routing number of the adjacent nodes of the initial node, the routing number of the target node and the longest equal string algorithm, and specifically includes the following steps.

[0055] Step 301, compare the routing numbers of multiple adjacent nodes of the initial node with the routing number of the target node according to the longest equal string algorithm to obtain the longest equal length value of the multiple adjacent nodes of the initial node with respect to the multiple routing numbers of the target node.

[0056] The longest equal string algorithm is used to find the longest continuous equal substring in a string. It can find the longest substring with the same characters in two given strings and return its length or the substring itself. In the embodiment of the present application, the longest equal string algorithm returns the longest equal string length, which can also be called the longest equal value of the routing number.

[0057] Compare the longest equal string length of the routing number of each adjacent node of the initial node with the routing number of the target node. For example, when the initial node is node 1 and the target node is node 6, the adjacent nodes of node 1 include: node 3, node 7, node 9, node 10, and node 2. Among them, the routing number of node 3 is 0108363, the routing number of node 6 is 02062637788, the longest equal string between the routing number of node 3 and the routing number of the target node is 0, and the corresponding longest equal string length is 1; the routing number of node 7 is 0106162, the routing number of node 6 is 02062637788, the longest equal string between the routing number of node 7 and the routing number of the target node is 0, and the corresponding longest equal string length is 1; the routing number of node 9 is 0105956, and the routing number of node 6 is 02062637788. , the longest equal string between the routing number of node 9 and the routing number of the target node is 0, and the corresponding longest equal string length is 1; the routing number of node 10 is 0, the routing number of node 6 is 02062637788, the longest equal string between the routing number of node 10 and the routing number of the target node is 0, and the corresponding longest equal string length is 1; the routing number of node 2 is 020, the routing number of node 6 is 02062637788, the longest equal string between the routing number of node 2 and the routing number of the target node is 020, and the corresponding longest equal string length is 3. Therefore, when the initial node is node 1, the adjacent nodes of the initial node are node 3, node 7, node 9, node 10, and node 2. The longest equal values ​​of the multiple routing numbers of these five adjacent nodes for the target node are 1, 1, 1, 1, and 3 respectively.

[0058] Step 302: Determine the next hop node of the routing message from multiple adjacent nodes of the initial node according to the longest equal values ​​of multiple routing numbers.

[0059] For example, when the initial node is node 1 and the target node is node 6, the adjacent nodes of the initial node are node 3, node 7, node 9, node 10, and node 2. According to the corresponding multiple routing number longest equal values ​​1, 1, 1, 1, 3, the next hop node of the routing message is determined from node 3, node 7, node 9, node 10, and node 2. The next hop node is one of node 3, node 7, node 9, node 10, and node 2.

[0060] In the embodiment of the present application, according to the size of the longest equal values ​​of multiple routing numbers, the node corresponding to the largest longest equal value of the routing number can be selected as the next hop node. For example, the next hop node can be node 2.

[0061] Of course, the substring can also be determined by the longest equal string algorithm, and then based on the substring, the next hop node of the routing message can be determined from multiple adjacent nodes of the initial node, which is not specifically limited in the embodiment of the present application.

[0062] A routing message transmission method provided in an embodiment of the present application adopts dial-up routing networking technology and the longest equal string algorithm, and performs real-time comparison and routing based on the routing number of the destination. There are no core nodes and routing calculation centers, which can improve the stability of the quantum key distribution network.

[0063] In the above Figure 3 Based on the routing message transmission method shown in the figure, the embodiment of the present application also provides another routing message transmission method. Figure 4 is a flowchart of a third routing message transmission method provided in an embodiment of the present application, such as Figure 4 As shown, the above step 302, according to the longest equal values ​​of multiple routing numbers, determines the next hop node of the routing message from multiple adjacent nodes of the initial node, and specifically includes the following steps.

[0064] Step 401, determining the maximum longest equal routing number value among a plurality of longest equal routing number values.

[0065] For example, when the initial node is node 1, the adjacent nodes of the initial node are node 3, node 7, node 9, node 10, and node 2, and the corresponding multiple longest equal values ​​of routing numbers are 1, 1, 1, 1, and 3. It can be determined that the longest equal value of the maximum routing number among the multiple longest equal values ​​of routing numbers is 3.

[0066] Step 402: Determine the next hop node of the routing message from a plurality of adjacent nodes of the initial node according to the longest equal value of the maximum routing number.

[0067] The longest equal value of the maximum routing number may correspond to one adjacent node of the initial node, or may correspond to multiple adjacent nodes of the initial node.

[0068] For example, in the example of step 401, the longest equal value of the maximum routing number corresponds to node 2, that is, corresponds to an adjacent node of the initial node.

[0069] Specifically, if the longest equal value of the maximum routing number corresponds to an adjacent node of the initial node, an adjacent node of the initial node corresponding to the longest equal value of the maximum routing number is used as the next hop node of the routing message. For example, in the example of step 401, the node 2 corresponding to the longest equal value of the maximum routing number is the next hop node of the routing message.

[0070] A routing message transmission method provided by an embodiment of the present application, when the longest equal value of the maximum routing number corresponds to an adjacent node of the initial node, an adjacent node of the initial node corresponding to the longest equal value of the maximum routing number is used as the next hop node of the routing message, so that the next hop node is closer to the target node, thereby making the routing message transmission path from the initial node to the target node shorter and the transmission efficiency higher.

[0071] In the above Figure 4 Based on the routing message transmission method shown in the figure, the embodiment of the present application also provides another routing message transmission method. Figure 5 is a flowchart of a fourth routing message transmission method provided in an embodiment of the present application, such as Figure 5 As shown, the above step 402, according to the longest equal value of the maximum routing number, determines the next hop node of the routing message from multiple adjacent nodes of the initial node, and specifically includes the following steps.

[0072] Step 501: If the longest equal value of the maximum routing number corresponds to multiple adjacent nodes, the lengths of the routing numbers of the multiple adjacent nodes corresponding to the longest equal value of the maximum routing number are compared.

[0073] like Figure 1 Node 1 and node 2 in the diagram are not connected, that is, the networks of node 1 and node 2 are not interoperable. At this time, the initial node is node 1, the target node is node 6, the adjacent nodes of the initial node are node 3, node 7, node 9 and node 10. According to the corresponding multiple longest equal values ​​of routing numbers 1, 1, 1, 1, it can be determined that the maximum longest equal value of routing numbers among the multiple longest equal values ​​of routing numbers is 1. At this time, the maximum longest equal value of routing numbers corresponds to four adjacent nodes: node 3, node 7, node 9 and node 10.

[0074] Compare the lengths of the routing numbers of multiple adjacent nodes corresponding to the longest equal value of the maximum routing number. For example, the longest equal value of the maximum routing number corresponds to four adjacent nodes: node 3, node 7, node 9 and node 10, the routing number of node 3 is 0108363, the length is 7, the routing number of node 7 is 0106162, the length is 7, the routing number of node 9 is 0105956, the length is 7, and the routing number of node 10 is 0, the length is 1.

[0075] Step 502: Select an adjacent node with the shortest routing number as the next hop node of the routing message.

[0076] For example, in the example of step 501, if Figure 1 When nodes 1 and 2 in the figure are not connected, the initial node is node 1, and the target node is node 6, the maximum routing number longest equal value corresponds to multiple adjacent nodes: node 3, node 7, node 9 and node 10, and the corresponding routing number lengths are: 7, 7, 7, 1. It can be seen that the shortest routing number length is 1, which corresponds to node 10, so node 10 is used as the next hop node of the routing message. Node 10 is the parent node of the initial node, that is, in the embodiment of the present application, when all nodes are consistent in the number of digits that match the comparison string, the routing message is transmitted to the parent node of the initial node, that is, the parent node of the initial node is used as the next hop node.

[0077] A routing message transmission method provided by an embodiment of the present application, when the longest equal value of the maximum routing number corresponds to multiple adjacent nodes, selects an adjacent node with the shortest routing number length as the next hop node of the routing message, that is, when all nodes are consistent in the number of digits of the string comparison, the routing message is transmitted to the parent node of the initial node to gradually approach the target node through the parent node.

[0078] In the above Figure 2 Based on the one routing message transmission method shown, an embodiment of the present application also provides another routing message transmission method, wherein the configuration file of the initial node contains the routing number of the initial node and the routing numbers of the adjacent nodes of the initial node.

[0079] In the embodiment of the present application, all routing numbers included in the configuration file may be manually set, or may be automatically stored after the nodes are connected, and no specific limitation is made in the embodiment of the present application.

[0080] In one case, it is assumed that the neighboring nodes of each node contained in the configuration file of the node are reachable. Therefore, the routing numbers of the neighboring nodes of the initial node in the above step 202 can be directly loaded from the configuration file of the initial node to determine the routing numbers of its neighboring nodes.

[0081] In another case, each node and its adjacent nodes need to be confirmed to confirm that the nodes are reachable. Figure 6 is a flowchart of a fifth routing message transmission method provided in an embodiment of the present application, such as Figure 6 As shown, the method for determining the routing number of the neighboring node of the initial node in the above step 202 specifically includes the following steps.

[0082] Step 601: Receive a configuration file sent by a neighboring node of an initial node.

[0083] After the initial node is connected to its adjacent node, the initial node sends a configuration file carrying its own routing number to the adjacent node, and the adjacent node also sends a configuration file carrying its own routing number to the initial node.

[0084] Step 602: Determine the routing numbers of the neighboring nodes of the initial node according to the configuration files sent by the neighboring nodes of the initial node and the configuration file of the initial node.

[0085] The initial node and the adjacent node each save the other's routing number as a mark, indicating that the other node is reachable.

[0086] The configuration file of the initial node contains the routing numbers of all its neighboring nodes. After the neighboring node transmits the configuration file of the neighboring node, the initial node extracts the routing number of the neighboring node from the configuration file, and then determines the routing number and the routing numbers of all neighboring nodes stored in the configuration file of the initial node. If the routing number exists in the routing numbers of all neighboring nodes stored in the configuration file of the initial node, the routing number is determined to be the routing number of the neighboring node of the initial node. If the routing number does not exist in the routing numbers of all neighboring nodes stored in the configuration file of the initial node, the routing number is not necessarily the routing number of the neighboring node of the initial node, and other processing is performed later.

[0087] A routing message transmission method provided in an embodiment of the present application determines the routing numbers of the neighboring nodes of the initial node based on the configuration files sent by the neighboring nodes of the initial node and the configuration files of the initial node, thereby improving the security of the quantum key distribution network.

[0088] The quantum key distribution network established in the present application obtains the transmission path of routing messages by using an algorithm that compares the lengths of strings of the same length. Compared with other technologies that calculate and select the optimal path, it reduces the time for routing link synchronization, the time for the routing hub to calculate the optimal path, and the time for nodes to communicate with the routing hub. When the message is routed, the routing path is selected in real time by the node where the message is located and does not need to be uploaded to the routing hub. Therefore, the routing of the message is not restricted by the routing hub. Even if a single node is attacked, other nodes can replace it to complete the forwarding of the routing message.

[0089] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.

[0090] The embodiment of the present application relates to an initial node, Figure 7 is a schematic diagram of the structure of the initial node provided in the embodiment of the present application, such as Figure 7 As shown, it includes: at least one processor 701; and a memory 702 that is communicatively connected to the at least one processor 701; wherein the memory 702 stores instructions that can be executed by the at least one processor 701, and the instructions are executed by the at least one processor 701 so that the at least one processor 701 can execute the routing message transmission method in the above-mentioned embodiments.

[0091] The memory 702 and the processor 701 are connected in a bus manner. The bus may include any number of interconnected buses and bridges. The bus connects various circuits of one or more processors and memories together.

[0092] The embodiment of the present application relates to a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the above method embodiment is implemented.

[0093] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0094] Those skilled in the art will appreciate that the above embodiments are specific embodiments for implementing the present application, and in actual applications, various changes may be made thereto in form and detail without departing from the spirit and scope of the present application.

Claims

1. A routing message transmission method, characterized in that: The method comprises: Generate a routing message; the routing message at least includes: a routing number of a target node; According to the routing numbers of the adjacent nodes of the initial node, the routing number of the target node and the longest equal string algorithm, the next hop node of the routing message is determined from the adjacent nodes of the initial node; if the next hop node is not the target node, the routing message is sent to the next hop node and the next hop node is used as the initial node until the next hop node is the target node, and the routing message is sent to the target node.

2. The routing message transmission method according to claim 1, characterized in that: The step of determining the next hop node of the routing message from the adjacent nodes of the initial node according to the routing number of the adjacent node of the initial node, the routing number of the target node, and the longest equal string algorithm comprises: Comparing the routing numbers of the multiple adjacent nodes of the initial node with the routing number of the target node according to the longest equal string algorithm, obtaining the longest equal values ​​of the multiple adjacent nodes of the initial node with respect to the multiple routing numbers of the target node; According to the longest equal values ​​of the multiple routing numbers, a next hop node of the routing message is determined from multiple adjacent nodes of the initial node.

3. The routing message transmission method according to claim 2, characterized in that: The step of determining the next hop node of the routing message from the plurality of adjacent nodes of the initial node according to the longest equal values ​​of the plurality of routing numbers comprises: Determining a maximum longest equal routing number value among the plurality of longest equal routing number values; According to the longest equal value of the maximum routing number, the next hop node of the routing message is determined from a plurality of adjacent nodes of the initial node.

4. The routing message transmission method according to claim 3, characterized in that: The step of determining the next hop node of the routing message from a plurality of adjacent nodes of the initial node according to the longest equal value of the maximum routing number comprises: If the longest equal value of the maximum routing number corresponds to an adjacent node of the initial node, an adjacent node of the initial node corresponding to the longest equal value of the maximum routing number is used as the next hop node of the routing message.

5. The routing message transmission method according to claim 3, characterized in that: The step of determining the next hop node of the routing message from a plurality of adjacent nodes of the initial node according to the longest equal value of the maximum routing number comprises: If the longest equal value of the maximum routing number corresponds to a plurality of the adjacent nodes, comparing the lengths of the routing numbers of the plurality of adjacent nodes corresponding to the longest equal value of the maximum routing number; The adjacent node with the shortest routing number is selected as the next hop node of the routing message.

6. The routing message transmission method according to claim 1, characterized in that: The configuration file of the initial node includes the routing number of the initial node and the routing numbers of the adjacent nodes of the initial node.

7. The method for transmitting routing information according to claim 6, characterized in that: The method for determining the routing number of the neighboring node of the initial node includes: Receiving a configuration file sent by an adjacent node of the initial node; The routing numbers of the neighboring nodes of the initial node are determined according to the configuration files sent by the neighboring nodes of the initial node and the configuration file of the initial node.

8. A quantum key distribution network, characterized in that: include: Multiple nodes; Network interconnection of the multiple nodes; The initial node is any one of the multiple nodes, and the initial node is used to execute the routing message transmission method described in any one of claims 1 to 7.

9. An initial node, characterized in that: include: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the routing message transmission method according to any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the routing message transmission method according to any one of claims 1 to 7 is implemented.

Images