Routing path generation method and apparatus, and electronic device and storage medium

Abstract

A routing path generation method and apparatus, and an electronic device and a storage medium. The method comprises: determining a key length and a receiving node of a quantum key to be sent; acquiring an adjacency relationship of a QKD node in a QKD network, generation time information of an available QKD key on a link, and a corresponding key length; on the basis of the generation time information and the corresponding key length, selecting an alternative link from among links of the QKD network, wherein a key length of an available QKD key, which is generated on the alternative link after a preset time point, is not less than the key length of the quantum key to be sent; and on the basis of the adjacency relationship and the alternative link, generating a target routing path for sending to the receiving node the quantum key to be sent.

Description

Route path generation method and device, electronic equipment and storage medium

[0001] The present disclosure is based on and claims priority to Chinese Patent Application No. 202410627236.1, filed on May 20, 2024, entitled "Route path generation method and device, electronic equipment and storage medium", the contents of which are hereby incorporated by reference in its entirety into the present disclosure. TECHNICAL FIELD

[0002] The present disclosure relates to the technical field of quantum communication, and particularly relates to a route path generation method and device, electronic equipment and storage medium. BACKGROUND

[0003] In the technical field of quantum communication, quantum key distribution (QKD) follows the principles of "one-time encryption" and "key length equal to plaintext". When two non-adjacent QKD nodes perform QKD, they need to be relayed by other QKD nodes. The QKD node acting as a relay uses the QKD key shared with the previous QKD node to decrypt the quantum key to be forwarded, and then uses the QKD key shared with the subsequent node to encrypt the quantum key, and sends the encrypted quantum key to the subsequent node. Before quantum key distribution, a route path for distributing quantum keys needs to be generated in advance.

[0004] In related technologies, the shortest path priority routing strategy is used to generate the route path for QKD.

[0005] However, when QKD is performed through the route path generated based on the shortest path priority routing strategy, the QKD key used to encrypt the quantum key takes a long time to generate, thereby causing the security of QKD to be low. SUMMARY

[0006] The present disclosure provides a route path generation method and device, electronic equipment and storage medium, which at least partially overcome the problem of low security of QKD in related technologies.

[0007] Other characteristics and advantages of the present disclosure will become apparent from the following detailed description, or will be learned by practice of the present disclosure.

[0008] According to one aspect of the present disclosure, a method for generating a routing path is provided, including: determining a key length of a quantum key to be sent and a receiving node; obtaining an adjacency relationship of a QKD node in a QKD network, generation time information of a QKD key available on a link, and a corresponding key length; selecting, according to the generation time information and the corresponding key length, candidate links from the links of the QKD network, the key length of the QKD key available on the candidate links and generated after a preset time point being not less than the key length of the quantum key to be sent; and generating, according to the adjacency relationship and the candidate links, a target routing path for sending the quantum key to be sent to the receiving node.

[0009] In one embodiment of the present disclosure, the generation time information is a generation time point; and the selecting, according to the generation time information and the corresponding key length, of the candidate links from the links of the QKD network includes: selecting, according to the preset time point, the generation time information and the corresponding key length, the candidate links from the links of the QKD network; when the candidate links cannot form a routing path for sending the quantum key to be sent to the receiving node, updating the preset time point, the updated preset time point being earlier than the previous preset time point; and selecting, according to the updated preset time point, the generation time information and the corresponding key length, the candidate links from the links of the QKD network again.

[0010] In one embodiment of the present disclosure, the generation time information is freshness, the freshness representing a time period in which the generation time point of the QKD key available is located, and the smaller the freshness, the later the corresponding time period; and the selecting, according to the generation time information and the corresponding key length, of the candidate links from the links of the QKD network includes: determining a freshness threshold; selecting, according to the freshness and the corresponding key length, the candidate links from the links of the QKD network, the key length of the QKD key available on the candidate links and having a freshness not greater than the freshness threshold being not less than the key length of the quantum key to be sent; when the candidate links cannot form a routing path for sending the quantum key to be sent to the receiving node, updating the freshness threshold, the updated freshness threshold being greater than the previous freshness threshold; and selecting, according to the updated freshness threshold, the generation time information and the corresponding key length, the candidate links from the links of the QKD network again.

[0011] In one embodiment of the present disclosure, the generating, according to the adjacency relationship and the candidate links, of the target routing path for sending the quantum key to be sent to the receiving node includes: generating, according to the adjacency relationship and the candidate links, a plurality of routing paths for sending the quantum key to be sent to the receiving node; and selecting one of the plurality of routing paths as the target routing path.

[0012] In one embodiment of the present disclosure, the selecting a routing path from the plurality of routing paths as a target routing path comprises: randomly selecting a routing path from the plurality of routing paths as the target routing path; or selecting a routing path from the plurality of routing paths as the target routing path according to a shortest path first routing strategy.

[0013] In one embodiment of the present disclosure, the obtaining the generation time information and the corresponding key length of the available QKD key on the link in the QKD network comprises: sending an obtaining request to the QKD node in the QKD network; and receiving the link state information fed back by the QKD node in the QKD network in response to the obtaining request, wherein the link state information comprises the generation time information and the key length of the available QKD key on the link between the QKD node and an adjacent QKD node.

[0014] According to another aspect of the present disclosure, there is provided a routing path generation apparatus, comprising: a determination module configured to determine a key length of a quantum key to be sent and a receiving node; an obtaining module configured to obtain an adjacency relationship of a QKD node in a QKD network, generation time information and a corresponding key length of an available QKD key on a link; a selection module configured to select, according to the generation time information and the corresponding key length, a candidate link from the links of the QKD network, wherein the key length of an available QKD key generated after a preset time point on the candidate link is not less than the key length of the quantum key to be sent; and a generation module configured to generate, according to the adjacency relationship and the candidate link, a target routing path for sending the quantum key to be sent to the receiving node.

[0015] In one embodiment of the present disclosure, the generation time information is a generation time point; the selection module is configured to select, according to a preset time point, the generation time information and the corresponding key length, a candidate link from the links of the QKD network; when the candidate link cannot form a routing path for sending the quantum key to be sent to the receiving node, update the preset time point, wherein the updated preset time point is earlier than the previous preset time point; and select, according to the updated preset time point, the generation time information and the corresponding key length, a candidate link from the links of the QKD network again.

[0016] In one embodiment of the present disclosure, the generation time information is freshness, the freshness representing a time period in which a generation time point of the available QKD key is located, and the smaller the freshness, the later the corresponding time period; the selecting module is configured to determine a freshness threshold; select candidate links from the links of the QKD network according to the freshness and the corresponding key length, the key length of the available QKD key with the freshness not greater than the freshness threshold on the candidate links being not less than the key length of the to-be-sent quantum key; when the candidate links cannot form a routing path for sending the to-be-sent quantum key to the receiving node, update the freshness threshold, the updated freshness threshold being greater than the previous freshness threshold; and select candidate links from the links of the QKD network again according to the updated freshness threshold, the generation time information and the corresponding key length.

[0017] In one embodiment of the present disclosure, the generation module is configured to generate a plurality of routing paths for sending the to-be-sent quantum key to the receiving node according to the adjacency relationship and the candidate links; and select one routing path from the plurality of routing paths as the target routing path.

[0018] In one embodiment of the present disclosure, the generation module is configured to randomly select one routing path from the plurality of routing paths as the target routing path; or select one routing path from the plurality of routing paths as the target routing path according to a shortest path first routing strategy.

[0019] In one embodiment of the present disclosure, the obtaining module is configured to send an obtaining request to a QKD node in a QKD network; and receive link state information fed back by the QKD node in the QKD network in response to the obtaining request, the link state information including generation time information and a key length of an available QKD key on a link between the QKD node and an adjacent QKD node.

[0020] According to still another aspect of the present disclosure, there is provided a routing path generation device, comprising: a neighbor management module configured to maintain a neighbor table, the neighbor table being configured to represent an adjacency relationship between QKD nodes in a QKD network; a link state management module configured to maintain link state information of the QKD nodes in the QKD network, the link state information including generation time information and a key length of an available QKD key on a link between a QKD node and an adjacent QKD node; and a routing management module configured to generate a routing table according to the routing path generation method in any of the above embodiments.

[0021] According to still another aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the routing path generation method of any of the above via execution of the executable instructions.

[0022] According to still another aspect of the present disclosure, a computer readable storage medium is provided, having stored thereon a computer program, the computer program being executed by a processor to implement the routing path generation method of any of the above.

[0023] According to still another aspect of the present disclosure, a computer program product is provided, the computer program product comprising a computer program or computer instructions, the computer program or the computer instructions being loaded and executed by a processor to cause a computer to implement the routing path generation method of any of the above.

[0024] The technical solutions provided by the embodiments of the present disclosure have at least the following beneficial effects:

[0025] The technical solutions provided by the embodiments of the present disclosure have at least the following beneficial effects:

[0026] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0027] The accompanying drawings, which are incorporated into and form part of the specification, illustrate embodiments consistent with the present disclosure and, together with the specification, serve to explain the principles of the present disclosure. It is clear that the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative labor based on these drawings.

[0028] FIG. 1 shows a flowchart of quantum key distribution in the related art.

[0029] FIG. 2 shows a schematic diagram of a routing path generation system in one embodiment of the present disclosure.

[0030] FIG. 3 shows a schematic diagram of a routing path generation apparatus in one embodiment of the present disclosure.

[0031] FIG. 4 shows a flowchart of a routing path generation method in one embodiment of the present disclosure.

[0032] FIG. 5 shows a flowchart of selecting an alternative link in one embodiment of the present disclosure.

[0033] FIG. 6 shows a flowchart of selecting an alternative link in another embodiment of the present disclosure.

[0034] FIG. 7 shows a schematic diagram of a QKD network in one embodiment of the present disclosure.

[0035] FIG. 8 shows a schematic diagram of a routing path generation apparatus in another embodiment of the present disclosure.

[0036] FIG. 9 shows a structural block diagram of an electronic device in one embodiment of the present disclosure. DETAILED DESCRIPTION

[0037] Example implementations will now be described more fully with reference to the accompanying drawings. Example implementations may, however, be implemented in many different forms and should not be construed as limited to the examples set forth herein; rather, these implementations are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the example implementations to those skilled in the art. Features described in the description, examples, or claims that are not essential to the understanding of the application are not limitations of the application.

[0038] In addition, the accompanying drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification. The drawings illustrate examples of the present disclosure and, as such, a change in the size or proportion of some parts on the drawings should be understood as not limiting the scope of the present disclosure. Like reference numerals refer to like elements throughout the drawings. It is to be understood that the same or similar components have the same or similar reference numbers wherever they occur. It is to be understood that the components, functional blocks, and / or other components described herein can be implemented in software, firmware, hardware, or a combination thereof, using any suitable means.

[0039] It should be understood that various steps in the method implementations of the present disclosure can be performed in a different order and / or in parallel. In addition, the method implementations can include additional steps and / or omit performing the steps shown. The scope of the present disclosure is not limited in this regard.

[0040] It should be noted that the terms "a" or "an" used in the present disclosure are used in a descriptive sense and not as limiting. It is to be understood that the terms "a" or "an" should be interpreted as "one or more" unless otherwise indicated in the context by the terms "one" or "only one."

[0041] Due to the characteristics of QKD, QKD can only be implemented between two communicating parties, and the two communicating parties need to implement fiber direct connection, which is limited by the transmission distance of optical signals. Under the premise of meeting the key generation rate requirement, the transmission distance of QKD is usually 40-80 km. If QKD over a longer distance is to be implemented, a relay node needs to be added between the sending node and the receiving node. In the sending node, the relay node and the receiving node, the shared key on the link between the adjacent two nodes (i.e., the QKD key obtained by the two end nodes of the link) is obtained by QKD between the adjacent two nodes.

[0042] In a large mesh interconnected QKD network, a routing mechanism needs to be supported, and routing is usually performed according to a static routing or a shortest path priority strategy. For security considerations, the quantum key distribution process follows the principles of "one-time pad" and "key length equal to plaintext length". In the quantum key relay process, QKD keys of the same length need to be consumed by each related QKD node for encrypted transmission.

[0043] As shown in FIG. 1, the routing path of QKD includes, in sequence, a sending node, a first relay node, a second relay node, and a receiving node. The QKD process includes the following S11-S1.

[0044] S11, the sending node generates a quantum key and encrypts the quantum key using an available QKD key on the link between the sending node and the first relay node.

[0045] The available QKD key is a QKD key that can be used on the link between a QKD node (for example, a sending node, a first relay node, a second relay node, a receiving node, and other QKD-related nodes) and the next QKD node when the QKD node needs to encrypt and send a quantum key.

[0046] It should be noted that the key length of the QKD key used to encrypt the quantum key is the same as the key length of the quantum key, and the principle of "key length equal to plaintext length" is followed.

[0047] S12, the sending node sends the encrypted quantum key to the first relay node.

[0048] S13, the first relay node decrypts the encrypted quantum key and encrypts the quantum key using an available QKD key on the link between the first relay node and the second relay node.

[0049] S14, the first relay node sends the encrypted quantum key to the second relay node.

[0050] S15, the second relay node decrypts the encrypted quantum key, and encrypts the quantum key using the available QKD key on the link between the second relay node and the receiving node.

[0051] S16, the second relay node sends the encrypted quantum key to the receiving node.

[0052] S17, the receiving node decrypts the encrypted quantum key to obtain the quantum key.

[0053] In the relay process, the quantum key (i.e., the QKD key) shared between two adjacent QKD nodes is generated in advance by the QKD method and stored in the key management system of each QKD node. The longer the QKD key is stored in each QKD node, the greater the risk it faces, and the lower the security of the QKD key, the quantum key protected by the QKD key, and the QKD.

[0054] To this end, the embodiments of the present disclosure provide a technical solution that determines the key length of the quantum key to be sent and the receiving node; obtains the adjacency relationship of the QKD nodes in the QKD network, the generation time information of the available QKD keys on the link, and the corresponding key length; selects candidate links from the links of the QKD network according to the generation time information and the corresponding key length, the key length of the available QKD key generated after a preset time point on the candidate link is not less than the key length of the quantum key to be sent; and generates a target routing path for sending the quantum key to be sent to the receiving node according to the adjacency relationship and the candidate link.

[0055] Since the key length of the available QKD key generated after a preset time point on the candidate link is set to be not less than the key length of the quantum key to be sent, the available QKD key in the selected candidate link has a shorter generation time and thus has higher security. By using the candidate link to generate a target routing path for sending the quantum key to be sent to the receiving node, the QKD key used by the QKD nodes in the target routing path to encrypt the quantum key to be sent has higher security, thereby ensuring that the QKD performed by using the target routing path has higher security.

[0056] FIG. 2 shows a schematic diagram of a routing path generation system in an embodiment of the present disclosure, which can apply the routing path generation method or the routing path generation apparatus in various embodiments of the present disclosure.

[0057] As shown in FIG. 2, the routing path generation system can include a plurality of QKD nodes 21.

[0058] The plurality of QKD nodes 21 form a QKD network, and the different QKD nodes 21 can be in an adjacent relationship or a non-adjacent relationship. If two QKD nodes 21 are directly connected by a link, the two QKD nodes 21 are in an adjacent relationship. If two QKD nodes 21 are not directly connected by a link, the two QKD nodes 21 are in a non-adjacent relationship.

[0059] As shown in FIG. 3, each QKD node 21 is configured with a routing path generation apparatus, which has a neighbor management module 211, a link state management module 212, and a routing management module 213.

[0060] The neighbor management module 211 is configured to maintain a neighbor table, which is used to represent the adjacent relationship between the QKD nodes 21 in the QKD network. The link state management module 212 is configured to maintain link state information of the QKD nodes 21 in the QKD network, and the link state information includes the generation time information and the key length of the available QKD key on the link between the QKD node 21 and the adjacent QKD node 21 (the adjacent QKD nodes are in an adjacent relationship, that is, the two nodes have a direct connection link). The routing management module 213 is configured to generate a routing table according to the routing path generation method in any one of the embodiments of the present disclosure.

[0061] The QKD nodes 21 are connected in communication through a network, which can be a wired network or a wireless network.

[0062] Optionally, the wireless network or wired network described above uses standard communication techniques and / or protocols. The network is typically the Internet, but can also be any network, including, but not limited to, a Local Area Network (LAN), a Metropolitan Area Network (MAN), a Wide Area Network (WAN), a mobile, wired or wireless network, a private network, or any combination of the above networks. In some embodiments, techniques and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), and the like are used to represent data exchanged over the network. In addition, all or some links can be encrypted using conventional encryption technologies such as the Secure Socket Layer (SSL), Transport Layer Security (TLS), a Virtual Private Network (VPN), Internet Protocol Security (IPsec), and the like. In other embodiments, custom and / or proprietary data communication technologies can be employed in place of, or in addition to, the above techniques and technologies.

[0063] In one embodiment, the network is a wired network, and the wired network is an optical fiber.

[0064] The QKD node 21 can be various electronic devices, including but not limited to a smartphone, a tablet computer, a laptop computer, a desktop computer, and the like.

[0065] The QKD node 21 can also be a server. Optionally, the server can be a standalone physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and basic cloud computing services such as big data and artificial intelligence platforms.

[0066] Those skilled in the art can know that the number of QKD nodes 21 in FIG. 1 is only illustrative, and there can be any number of QKD nodes 21 according to actual needs. The embodiments of the present disclosure do not limit this.

[0067] The present example embodiment will be described in detail below in conjunction with the accompanying drawings and embodiments.

[0068] The method for generating a routing path provided in the embodiments of the present disclosure can be executed by any electronic device with computing processing capability. For example, the electronic device is a QKD node.

[0069] FIG. 4 shows a flowchart of a method for generating a routing path according to an embodiment of the present disclosure. As shown in FIG. 4, the method for generating a routing path provided in the embodiments of the present disclosure can include the following S401-S404.

[0070] S401, determine a key length of a quantum key to be sent and a receiving node.

[0071] The key length is used to measure the number of bytes of the quantum key. The specific size of the key length can be determined according to the corresponding quantum key to be sent. For example, the key length is 40 KB (KiloByte).

[0072] In an embodiment, when the QKD node is a sending node, the key length of the quantum key can be directly determined when the quantum key is generated. When the QKD node is a sending node, the receiving node can be directly determined according to the destination address of the quantum key to be sent.

[0073] S402, obtain the adjacency relationship of the QKD nodes in the QKD network, the generation time information of the available QKD keys on the link, and the corresponding key length.

[0074] When two QKD nodes are directly connected through a link, the two QKD nodes have an adjacency relationship. If two QKD nodes do not have a directly connected link, the two QKD nodes do not have an adjacency relationship.

[0075] The link in the QKD network is a link through which two QKD nodes with an adjacency relationship are directly connected. In an embodiment, the link can be implemented based on an optical fiber.

[0076] The generation time information of the available QKD key is used to indicate the generation time of the available QKD. Specifically, it can indicate the generation time point of the available QKD key or the time period in which the generation time point is located. The embodiments of the present disclosure do not limit what the generation time information is. In an embodiment, the generation time information can be a specific time point, that is, the generation time information is the generation time point. In another embodiment, the generation time information can be freshness, which can represent the time period in which the generation time point of the available QKD key is located, wherein the smaller the freshness, the later the corresponding time period. For example, a freshness of 1 corresponds to a time period of t1-current, and a freshness of 2 corresponds to a time period of t2-t1, where t2 is earlier than t1, for example, t2 is 8:00 on April 1, 2024, and t1 is 8:00 on April 2, 2024.

[0077] In one embodiment, the QKD nodes establish the adjacency relationship of the QKD nodes by sending a multicast probe message to other QKD nodes in the QKD network, and record and save the adjacency relationship between the QKD nodes in the form of a neighbor table, and can also periodically or non-periodically update and maintain the neighbor table to ensure the accuracy and comprehensiveness of the recorded adjacency relationship in the neighbor table. In one embodiment, obtaining the adjacency relationship of the QKD nodes in the QKD network can include obtaining the adjacency relationship of each QKD node from the neighbor table maintained by the QKD node.

[0078] In one embodiment, a neighbor management module is configured in the QKD node, which can maintain the neighbor table according to the messages fed back by other QKD nodes for the multicast probe message.

[0079] In another embodiment, obtaining the adjacency relationship of the QKD nodes in the QKD network can include sending a multicast probe message directly to other QKD nodes in the QKD network, and determining the adjacency relationship between the QKD nodes in the QKD network according to the messages fed back by other QKD nodes.

[0080] In one embodiment, the QKD node can send a multicast probe message to other QKD nodes in the QKD network, and other QKD nodes can return the locally stored link state information description after receiving the multicast probe message. The QKD node can compare the link state information description with the local link state information after receiving the link state information description, and determine the link state information that is not local. Then the QKD node sends a request to other QKD nodes to request the link state information that is not local. Other QKD nodes feed back the corresponding link state information to the QKD node after receiving the request. In addition, the QKD node can periodically or non-periodically update the stored link state information through the multicast probe message to ensure the accuracy of the stored link state information.

[0081] For example, the first QKD node sends a multicast probe message to the second QKD node, and the second QKD node can return the locally stored link state information description to the first QKD node after receiving the multicast probe message. The first QKD node can compare the link state information description with the local link state information after receiving the link state information description, and determine the link state information that is not local. Then the first QKD node sends a request to the second QKD node to request the link state information that is not local. The second QKD node feeds back the corresponding link state information to the first QKD node after receiving the request.

[0082] In one embodiment, the link state information comprises generation time information and corresponding key length of the available QKD key on the link. Taking the generation time information as the generation time point for example, the generation time information of the available QKD key can be time point 1, …, time point n, n is an integer not less than 1, the key length corresponding to the time point 1 is key length 1, …, the key length corresponding to the time point n is key length n. Wherein, the time point 1 and the corresponding key length 1 can indicate that part of the available QKD key on the link is generated at the time point 1, and the key length of the part of the available QKD key is key length 1.

[0083] In one embodiment, a link state management module is configured in the QKD node, which can maintain the local link state information according to the link state information fed back by other QKD nodes.

[0084] In one embodiment, obtaining the generation time information and the corresponding key length of the available QKD key on the link in the QKD network can comprise: directly obtaining the generation time information and the corresponding key length from the link state information maintained by the QKD node.

[0085] In another embodiment, obtaining the generation time information and the corresponding key length of the available QKD key on the link in the QKD network can comprise: sending an acquisition request to the QKD node in the QKD network; receiving the link state information fed back by the QKD node in the QKD network in response to the acquisition request, the link state information comprising the generation time information and the key length of the available QKD key on the link between the QKD node and the adjacent QKD node.

[0086] In the case of generation time information as freshness, the data amount of the link state information can be reduced, the frequency of updating the link state information can be reduced, and better applicability is achieved.

[0087] S403, according to the generation time information and the corresponding key length, selecting a candidate link from the links of the QKD network, the key length of the available QKD key generated after the preset time point on the candidate link is not less than the key length of the quantum key to be sent.

[0088] After limiting the key length of the available QKD key generated after the preset time point on the candidate link to be not less than the key length of the quantum key to be sent, the candidate link can be directly screened out through the generation time information and the corresponding key length of the available QKD key on the link.

[0089] The embodiments of the present disclosure do not limit the specific time point of the preset time point. In one embodiment, when the generation time information is the generation time point, the preset time point is an arbitrarily determined time point; when the generation time information is the freshness, the preset time point can be a time point for dividing the time period corresponding to the freshness, for example, the time period corresponding to the freshness 1 is t1-current, the time point corresponding to the freshness 2 is t2-t1, and the time point for dividing the time period corresponding to the freshness 1 and the time period corresponding to the freshness 2 is t1.

[0090] S404, generating a target routing path for sending the to-be-sent quantum key to the receiving node according to the adjacency relationship and the candidate link.

[0091] The target routing path for sending the to-be-sent quantum key to the receiving node can be generated by any routing path generation method through the adjacency relationship between the QKD nodes in the QKD network and the selected candidate link.

[0092] For example, a plurality of routing paths can be obtained by combining the candidate links, and a routing path capable of connecting the sending node and the receiving node is selected as the target routing path. For another example, the sending node and the receiving node can be taken as two ends of the routing path, and the candidate links can be combined to obtain the target routing path.

[0093] In one embodiment, the candidate links can be combined to form one or more routing paths connecting the sending node and the receiving node. At this time, generating the target routing path for sending the to-be-sent quantum key to the receiving node according to the adjacency relationship and the candidate link can include: generating a plurality of routing paths for sending the to-be-sent quantum key to the receiving node according to the adjacency relationship and the candidate link; and selecting one routing path from the plurality of routing paths as the target routing path.

[0094] The embodiments of the present disclosure do not limit how to select one routing path from the plurality of routing paths. In one embodiment, selecting one routing path from the plurality of routing paths as the target routing path can include: randomly selecting one routing path from the plurality of routing paths as the target routing path; or selecting one routing path from the plurality of routing paths as the target routing path according to a shortest path first routing strategy.

[0095] The way of selecting the target routing path from the plurality of routing paths for sending the to-be-sent quantum key to the receiving node by using the shortest path first routing strategy can make the distance of the routing path as short as possible on the basis of ensuring that the QKD has sufficient security, thereby improving the efficiency of the QKD.

[0096] The technical solution provided by the embodiments of the present disclosure can make the available QKD keys in the selected alternative link have a shorter generation time, thereby having higher security, by setting the key length of the available QKD keys generated after the preset time point on the alternative link to be no less than the key length of the quantum keys to be sent, and then selecting the alternative link from the QKD network. The use of the alternative link to generate the target routing path for sending the quantum keys to be sent to the receiving node can make the QKD keys used by the QKD nodes in the target routing path when encrypting the quantum keys to be sent have higher security, thereby ensuring that the QKD performed by using the target routing path has higher security compared with the QKD performed by using the routing path generated based on the shortest path priority routing strategy.

[0097] In one embodiment, the generation time information is a generation time point, and the process of selecting the alternative link can include S501-S503, that is, selecting the alternative link from the links of the QKD network according to the generation time information and the corresponding key length can include S501-S503.

[0098] S501, selecting an alternative link from the links of the QKD network according to the preset time point, the generation time information and the corresponding key length.

[0099] The key length of the available QKD keys generated after the preset time point on the alternative link is no less than the key length of the quantum keys to be sent.

[0100] S502, when the alternative link cannot form a routing path for sending the quantum keys to be sent to the receiving node, updating the preset time point, and the updated preset time point is earlier than the previous preset time point.

[0101] According to the selected alternative link, a plurality of routing paths are combined, and if the plurality of routing paths do not include a routing path for sending the quantum keys to be sent to the receiving node, it indicates that the alternative link cannot form a routing path for sending the quantum keys to be sent to the receiving node.

[0102] At this time, the preset time point needs to be updated, and by limiting the updated preset time point to be earlier than the previous preset time point, more alternative links can be re-selected so as to be able to combine the alternative links to obtain a routing path for sending the quantum keys to be sent to the receiving node.

[0103] The embodiments of the present disclosure do not limit how to update the preset time point. In one embodiment, updating the preset time point can be to move the preset time point forward by a preset time period based on the original preset time point. For example, the preset time period can be 5 hours, 6 hours, 24 hours, etc., and the embodiments of the present disclosure do not limit this.

[0104] The embodiments of the present disclosure do not limit how the first preset time point for performing the candidate link selection is determined. For example, the first preset time point for performing the candidate link selection can be configured as a time point before the current time point by a time period, and the embodiments of the present disclosure do not limit how long the time period is, for example, the time period is 1 day.

[0105] In another embodiment, a plurality of preset time points can be directly generated before the candidate link is selected, each preset time point corresponds to a round of candidate link selection, and the larger the round is applied, the greater the time difference between the preset time point and the current time point is.

[0106] S503, according to the updated preset time point, the generation time information and the corresponding key length, reselect the candidate link from the links of the QKD network.

[0107] The reselected candidate link still satisfies that the key length of the available QKD key generated after the preset time point is not less than the key length of the quantum key to be sent.

[0108] If the reselected candidate link can form a routing path for sending the quantum key to be sent to the receiving node, the routing path for sending the quantum key to be sent to the receiving node is taken as the target routing path. Otherwise, the preset time point is continuously updated to select more candidate links.

[0109] In one embodiment, the generation time information is freshness, and the smaller the freshness is, the later the corresponding time period is. The process of selecting the candidate link can include S601 to S604, that is, selecting the candidate link from the links of the QKD network according to the generation time information and the corresponding key length can include S601 to S604.

[0110] S601, determine a freshness threshold.

[0111] In one embodiment, a plurality of different freshness thresholds can be configured in the QKD node, and the plurality of different freshness thresholds are in an increasing relationship. When selecting the candidate link, the first freshness threshold can be used, and the freshness threshold with a larger value can be used one by one until the selected candidate link can form a routing path for sending the quantum key to be sent to the receiving node.

[0112] In another embodiment, a freshness threshold is configured in the QKD node, and in the selection of the candidate link, the first freshness threshold is the freshness threshold, and after each update of the freshness threshold, the last freshness threshold is increased by a set value (the set value can be determined according to the value of the interval between two adjacent freshnesses, for example, there is an interval of one freshness level between freshness 1 and freshness 2, and there is no intermediate freshness between freshness 1 and freshness 2, and the value of the interval between two adjacent freshnesses is 1), and the set value can be the same or different each time, and the embodiments of the present disclosure do not limit this. For example, the freshness threshold configured in the QKD node is 1, and the set value is 1.

[0113] The determination of the freshness threshold can include determining the freshness threshold to be used in the round in which the candidate link is currently selected.

[0114] S602, according to the freshness and the corresponding key length, selecting a candidate link from the links of the QKD network, and the key length of the available QKD key with a freshness not greater than the freshness threshold on the candidate link is not less than the key length of the quantum key to be sent.

[0115] S603, when the candidate link cannot form a routing path for sending the quantum key to be sent to the receiving node, updating the freshness threshold, and the updated freshness threshold is greater than the previous freshness threshold.

[0116] The embodiments of the present disclosure do not limit how to update the freshness threshold. In one embodiment, updating the freshness threshold can include increasing the value of the interval between two adjacent freshnesses each time based on the original freshness threshold. In another embodiment, the QKD node is configured with freshness thresholds for different rounds of selection of the candidate link, and then updating the freshness threshold can directly replace the freshness threshold used in the last round with the freshness threshold to be used in the current round.

[0117] By updating the freshness threshold and limiting the updated freshness threshold to be greater than the previous freshness threshold, more candidate links can be selected according to the updated freshness threshold, so that the reselected candidate links can form a routing path for sending the quantum key to be sent to the receiving node.

[0118] S604, according to the updated freshness threshold, the generation time information and the corresponding key length, reselecting a candidate link from the links of the QKD network.

[0119] The reselected candidate link still satisfies that the key length of the available QKD key with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent.

[0120] If the reselected candidate link still cannot form a routing path for sending the to-be-sent quantum key to the receiving node, the freshness threshold needs to be continuously updated until the selected candidate link can form a routing path for sending the to-be-sent quantum key to the receiving node.

[0121] To facilitate understanding of the routing path generation method in the embodiments of the present disclosure, the generation time information is taken as the freshness, and the method will be described in combination with FIG. 7. It should be noted that the smaller the value of the freshness, the later the time period corresponding to the freshness, that is, the closer to the current time.

[0122] There are four QKD nodes and four links in the QKD network shown in FIG. 7. Among them, the four QKD nodes are: QKD node 1, QKD node 2, QKD node 3, and QKD node 4. The four links are: the link between QKD node 1 and QKD node 2, the link between QKD node 1 and QKD node 3, the link between QKD node 2 and QKD node 4, and the link between QKD node 3 and QKD node 4.

[0123] Among them, the link between QKD node 1 and QKD node 2 has three levels of available QKD keys with different freshness, wherein the key length of the available QKD key with freshness 1 is 30 KB, the key length of the available QKD key with freshness 2 is 30 KB, and the key length of the available QKD key with freshness 3 is 10 KB, a total of 70 KB of available QKD keys.

[0124] The link between QKD node 1 and QKD node 3 has three levels of available QKD keys with different freshness, wherein the key length of the available QKD key with freshness 1 is 20 KB, the key length of the available QKD key with freshness 2 is 20 KB, and the key length of the available QKD key with freshness 3 is 660 KB, a total of 700 KB of available QKD keys.

[0125] The link between QKD node 2 and QKD node 4 has three levels of available QKD keys with different freshness, wherein the key length of the available QKD key with freshness 1 is 10 KB, the key length of the available QKD key with freshness 2 is 30 KB, and the key length of the available QKD key with freshness 3 is 30 KB, a total of 70 KB of available QKD keys.

[0126] The link between QKD node 3 and QKD node 4 has three levels of available QKD keys with different freshness, wherein the key length of the available QKD key with freshness 1 is 10 KB, the key length of the available QKD key with freshness 2 is 20 KB, and the key length of the available QKD key with freshness 3 is 870 KB, a total of 900 KB of available QKD keys.

[0127] When QKD node 1 needs to send quantum key with key length of 40KB to QKD node 4, QKD node 1 can obtain the freshness and corresponding key length of available QKD key on four links in FIG. 7 according to the link state information stored by the node. Then, the selection of the candidate link is performed with the freshness threshold of 1, the key length of the QKD node with freshness of 1 is compared with the required 40KB key length, and the key lengths of the four links are 30KB, 10KB, 20KB and 10KB respectively, all of which are less than 40KB, and the candidate link cannot be selected.

[0128] Then, the selection of the candidate link is performed with the freshness threshold of 2, and it can be seen from FIG. 7 that the freshness of the four links is 1 and 2, the sum of the key length of the links with freshness of 1 and 2 is compared with the required 40KB key length, and the key lengths of the four links are 60KB, 40KB, 40KB and 30KB respectively, wherein the two links in the routing path 1 are 60KB and 40KB respectively, which are greater than or equal to 40KB, and the remaining key length is sufficient. While the two links in the routing path 2 are 40KB and 30KB respectively, there is a link less than 40KB, and the remaining key length is insufficient. The routing path 1 is selected as the target routing path of QKD node 1 to send quantum key to QKD node 4, and QKD is performed.

[0129] Based on the same inventive concept, the disclosure embodiment also provides a routing path generation device, as described in the following embodiments. Since the principle of solving the problem of the device embodiment is similar to the above-mentioned method embodiment, the implementation of the device embodiment can be referred to the implementation of the above-mentioned method embodiment, and the repeated parts will not be described here.

[0130] FIG. 8 shows a schematic diagram of a routing path generation device in one embodiment of the disclosure, as shown in FIG. 8, the device comprises: a determination module 81 for determining the key length of the quantum key to be sent and the receiving node; an acquisition module 82 for acquiring the adjacency relationship of the QKD nodes in the QKD network, the generation time information and the corresponding key length of the available QKD key on the link; a selection module 83 for selecting candidate links from the links of the QKD network according to the generation time information and the corresponding key length, the key length of the available QKD key generated after the preset time point on the candidate link is not less than the key length of the quantum key to be sent; and a generation module 84 for generating the target routing path of sending the quantum key to be sent to the receiving node according to the adjacency relationship and the candidate link.

[0131] In an embodiment of the present disclosure, the generation time information is a generation time point; the selecting module 83 is configured to select candidate links from the links of the QKD network according to the preset time point, the generation time information, and the corresponding key length; when the candidate links cannot form a routing path for sending the to-be-sent quantum key to the receiving node, update the preset time point, and the updated preset time point is earlier than the previous preset time point; and select the candidate links from the links of the QKD network again according to the updated preset time point, the generation time information, and the corresponding key length.

[0132] In an embodiment of the present disclosure, the generation time information is freshness, the freshness represents a time period in which the generation time point of the available QKD key is located, and the smaller the freshness is, the later the corresponding time period is; the selecting module 83 is configured to determine a freshness threshold; select candidate links from the links of the QKD network according to the freshness and the corresponding key length, and the key length of the available QKD key with the freshness not greater than the freshness threshold on the candidate link is not less than the key length of the to-be-sent quantum key; when the candidate links cannot form a routing path for sending the to-be-sent quantum key to the receiving node, update the freshness threshold, and the updated freshness threshold is greater than the previous freshness threshold; and select the candidate links from the links of the QKD network again according to the updated freshness threshold, the generation time information, and the corresponding key length.

[0133] In an embodiment of the present disclosure, the generating module 84 is configured to generate a plurality of routing paths for sending the to-be-sent quantum key to the receiving node according to the adjacency relationship and the candidate links; and select one routing path from the plurality of routing paths as the target routing path.

[0134] In an embodiment of the present disclosure, the generating module 84 is configured to randomly select one routing path from the plurality of routing paths as the target routing path; or select one routing path from the plurality of routing paths as the target routing path according to a shortest path first routing strategy.

[0135] In an embodiment of the present disclosure, the obtaining module 82 is configured to send an obtaining request to a QKD node in the QKD network; and receive link state information fed back by the QKD node in the QKD network in response to the obtaining request, the link state information including generation time information and a key length of an available QKD key on a link between the QKD node and an adjacent QKD node.

[0136] The technical solution provided by the embodiment of the present disclosure can make the available QKD key in the selected alternative link have a shorter generation time, thereby having higher security, by setting the key length of the available QKD key generated after a preset time point on the alternative link to be not less than the key length of the quantum key to be sent, and then selecting the alternative link from the QKD network. The use of the alternative link to generate the target routing path for sending the quantum key to be sent to the receiving node can make the QKD key used by the QKD node in the target routing path when encrypting the quantum key to be sent have higher security, thereby ensuring that the QKD performed by using the target routing path has higher security compared with the QKD performed by using the routing path generated based on the shortest path priority routing strategy.

[0137] Those skilled in the art can understand that each aspect of the present disclosure can be implemented as a system, a method or a program product. Therefore, each aspect of the present disclosure can be specifically implemented as a complete hardware embodiment, a complete software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects, which can be collectively referred to as "circuitry", "module" or "system" here.

[0138] The electronic device 900 according to this embodiment of the present disclosure will be described below with reference to FIG. 9. FIG. 9 shows the electronic device 900 only as an example, and should not bring any limitation to the functions and use range of the embodiments of the present disclosure.

[0139] As shown in FIG. 9, the electronic device 900 is in the form of a general computing device. The components of the electronic device 900 can include, but are not limited to, the at least one processing unit 910 described above, the at least one storage unit 920 described above, and a bus 930 connecting different system components, including the storage unit 920 and the processing unit 910.

[0140] The storage unit stores program codes which can be executed by the processing unit 910, so that the processing unit 910 performs the steps according to various exemplary embodiments of the present disclosure described in the above "Detailed Description" section of the present specification.

[0141] The storage unit 920 can include a readable medium in the form of a volatile storage unit, such as a random access memory (RAM) 9201 and / or a cache memory unit 9202, and can further include a read-only memory (ROM) 9203.

[0142] The storage unit 920 can also include the programs / utilities 9204 having a set (at least one) of program modules 9205, such as an operating system, one or more application programs, other program modules, and program data, and each or a combination thereof can include an implementation of a network environment.

[0143] The bus 930 can be representative of one or more of several types of bus structures, including a storage unit bus or bus controller, a peripheral bus, a graphics acceleration port, a processing unit bus, or a local bus using any of a variety of bus architectures.

[0144] The electronic device 900 can also communicate with one or more external devices 940 such as a keyboard or pointing device, a Bluetooth device, etc.; other devices such as a storage device or an external effects device; and / or one or more devices that enable a user to interact with the electronic device 900; and / or one or more devices that enable the electronic device 900 to communicate with one or more other computing devices. Such communication can be facilitated by an Input / Output (I / O) interface 950. Still yet, the electronic device 900 can communicate with one or more networks, such as a local area network (LAN), a wide area network (WAN), and / or the public network, such as the Internet, via a network adapter 960. As depicted, the network adapter 960 communicates with the other components of the electronic device 900 via the bus 930. It should be appreciated that although the network adapter 960 is depicted as a single component, the network adapter 960 can comprise two or more components that operate together to facilitate the communication of the electronic device 900 with one or more networks. Although not shown, it should be understood that the electronic device 900 can include other hardware and / or software components, including but not limited to microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0145] Those skilled in the art will readily understand that the example embodiments described herein can be implemented by software and / or by software in combination with the necessary hardware. Thus, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash disk, a mobile hard disk, etc.) or a network, and includes a number of instructions to make a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) execute the methods according to the embodiments of the present disclosure.

[0146] In the exemplary embodiments of the present disclosure, a computer readable storage medium is also provided, which can be a readable signal medium or a readable storage medium. A program product is stored thereon, which can implement the method of the present disclosure. In some possible implementations, various aspects of the present disclosure can also be implemented in the form of a program product, which includes program codes for causing the terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the above “Detailed Description” section of the present specification, when the program product is run on the terminal device.

[0147] More specific examples of the computer readable storage medium in the present disclosure can include, but are not limited to, an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any appropriate combination of the foregoing.

[0148] In the present disclosure, the computer readable storage medium can include a data signal carried in the baseband or as a part of a carrier wave propagating through the program code, in which the readable program code is borne. Such a propagating data signal can take various forms, including but not limited to an electromagnetic signal, an optical signal, or any appropriate combination of the foregoing. The readable signal medium can also be any readable medium other than the readable storage medium, which can send, propagate or transmit programs for use by or in connection with an instruction execution system, apparatus or device.

[0149] Optionally, the program code contained in the computer readable storage medium can be transmitted by any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any appropriate combination of the foregoing.

[0150] In the implementation, the program code for performing the operations of the present disclosure can be written in any combination of one or more programming languages, including an object-oriented programming language, such as Java, C++, etc., and a conventional procedural programming language, such as the “C” language or a similar programming language. The program code can be executed entirely on the user computing device, partially on the user device, as an independent software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case involving a remote computing device, the remote computing device can be connected to the user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, through the Internet by connecting to an Internet service provider).

[0151] In an exemplary embodiment of the present disclosure, there is also provided a computer program product including a computer program or computer instructions, which is loaded and executed by a processor to make a computer implement the steps according to various exemplary embodiments of the present disclosure described in the above " " section of the present specification.

[0152] It should be noted that although several modules or units of the device for action execution are mentioned in the above detailed description, such division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into a plurality of modules or units for embodiment.

[0153] In addition, although the various steps of the methods in the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that the steps must be performed in this particular order, or that all of the steps shown must be performed to achieve the desired result. Additionally or alternatively, some steps can be omitted, a plurality of steps can be combined into one step, and / or one step can be divided into a plurality of steps, etc.

[0154] From the above description of the embodiments, those skilled in the art will readily appreciate that the example embodiments described herein can be implemented by software and / or by hardware combined with software necessary for the embodiments. Accordingly, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product. The software product can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or a network, and includes a number of instructions to make a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) execute the methods according to the embodiments of the present disclosure.

[0155] Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the aspects disclosed herein. The present disclosure is intended to cover any variations, uses, or adaptations of the present disclosure following, in general, the principles of the present disclosure and including such features that are evident to those skilled in the art or are known in the art and can be used in the practice of the present disclosure. The specification and examples given are considered exemplary only, with the true scope of the present disclosure being indicated by the appended claims.

Claims

1. A method of generating a routing path, characterized by, The method comprises the steps of: determining a key length of a quantum key to be sent and a receiving node; obtaining an adjacency relationship of a quantum key distribution (QKD) node in a QKD network, generation time information of available QKD keys on a link, and corresponding key lengths; selecting, according to the generation time information and the corresponding key lengths, candidate links from the links of the QKD network, wherein a key length of an available QKD key generated after a preset time point on the candidate links is not less than the key length of the quantum key to be sent; generating, according to the adjacency relationship and the candidate links, a target routing path for sending the quantum key to be sent to the receiving node.

2. The method of claim 1, wherein, The generation time information is a generation time point; and the step of selecting, according to the generation time information and the corresponding key lengths, candidate links from the links of the QKD network comprises the steps of: selecting, according to a preset time point, the generation time information and the corresponding key lengths, candidate links from the links of the QKD network; when the candidate links cannot form a routing path for sending the quantum key to be sent to the receiving node, updating the preset time point, wherein the updated preset time point is earlier than the previous preset time point; selecting, according to the updated preset time point, the generation time information and the corresponding key lengths, candidate links from the links of the QKD network again.

3. The method of claim 1, wherein, The generation time information is freshness, which represents a time period in which the generation time point of the available QKD key is located, and the smaller the freshness is, the later the corresponding time period is; The step of selecting, according to the generation time information and the corresponding key lengths, candidate links from the links of the QKD network comprises the steps of: determining a freshness threshold; selecting, according to the freshness and the corresponding key lengths, candidate links from the links of the QKD network, wherein a key length of an available QKD key with freshness not greater than the freshness threshold on the candidate links is not less than the key length of the quantum key to be sent; when the candidate links cannot form a routing path for sending the quantum key to be sent to the receiving node, updating the freshness threshold, wherein the updated freshness threshold is greater than the previous freshness threshold; selecting, according to the updated freshness threshold, the generation time information and the corresponding key lengths, candidate links from the links of the QKD network again.

4. The method of claim 1, wherein, The step of generating, according to the adjacency relationship and the candidate links, a target routing path for sending the quantum key to be sent to the receiving node comprises the steps of: generating, according to the adjacency relationship and the candidate links, multiple routing paths for sending the quantum key to be sent to the receiving node; selecting one of the multiple routing paths as the target routing path.

5. The method of claim 4, wherein, The step of selecting one of the multiple routing paths as the target routing path comprises the steps of: randomly selecting one of the multiple routing paths as the target routing path; or selecting one of the multiple routing paths as the target routing path according to a shortest path first routing strategy.

6. The method of claim 1, wherein, The step of obtaining the generation time information of the available QKD keys on the link in the QKD network and the corresponding key lengths comprises the steps of: sending a request for obtaining to a QKD node in a QKD network; receiving link state information fed back by a QKD node in the QKD network for the request for obtaining, the link state information including generation time information and key length of a QKD key available on a link between the QKD node and a neighboring QKD node.

7. A route path generating apparatus characterized by comprising: comprising: a determining module configured to determine a key length of a quantum key to be sent and a receiving node; an obtaining module configured to obtain an adjacency relationship of QKD nodes in a quantum key distribution (QKD) network, generation time information and corresponding key length of a QKD key available on a link; a selecting module configured to select, according to the generation time information and the corresponding key length, a candidate link from the links of the QKD network, the key length of a QKD key available on the candidate link and generated after a preset time point being not less than the key length of the quantum key to be sent; a generating module configured to generate, according to the adjacency relationship and the candidate link, a target routing path for sending the quantum key to be sent to the receiving node.

8. A route path generating apparatus characterized by comprising: comprising: a neighbor management module configured to maintain a neighbor table, the neighbor table being used to represent an adjacency relationship between QKD nodes in a quantum key distribution (QKD) network; a link state management module configured to maintain link state information of QKD nodes in the QKD network, the link state information including generation time information and key length of a QKD key available on a link between a QKD node and a neighboring QKD node; a routing management module configured to generate a routing table according to a routing path generation method such as any one of claims 1-6.

9. An electronic device, comprising: comprising: a processor; and a memory configured to store executable instructions of the processor; wherein the processor is configured to execute the routing path generation method of any one of claims 1-6 by executing the executable instructions.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the routing path generation method of any one of claims 1-6.

11. A computer program product, characterised in that, The computer program product comprises a computer program or computer instructions, which are loaded and executed by the processor to enable the computer to implement the routing path generation method of any one of claims 1-6. The computer program product comprises a computer program or computer instructions, which are loaded and executed by the processor to enable the computer to implement the routing path generation method of any one of claims 1-6.

Images