A routing method and related device suitable for a quantum key distribution network

Abstract

The present disclosure provides a routing method and related equipment suitable for a quantum key distribution network, and relates to the technical field of quantum communication. The method comprises: determining a source key node and a destination key node in the quantum key distribution network; obtaining a plurality of key relay paths between the source key node and the destination key node according to the topology information of the quantum key distribution network; for each key relay path, calculating a composite routing metric value of the key relay path according to the minimum value of the residual key amount of each link on the key relay path, the minimum value of the reliability metric value of each link and the key exchange rate of all key nodes; and determining a target key relay path from the plurality of key relay paths according to the calculated composite routing metric value. The method defines the composite routing metric value of the key relay path, which can comprehensively and accurately reflect the security, stability and transmission efficiency of the path, is suitable for large-scale quantum key distribution networks, and improves the routing accuracy.

Description

Technical Field

[0001] This disclosure relates to the field of quantum communication technology, and in particular to a routing method, routing device, electronic device, computer-readable storage medium, and computer program product suitable for quantum key distribution networks. Background Technology

[0002] Quantum Key Distribution (QKD) networks are based on QKD technology. They establish end-to-end services by connecting one or more relay nodes between source and destination nodes using QKD links, and provide users with quantum keys to ensure the security of end-to-end user communication.

[0003] In related technologies, static routing methods are used to implement routing in QKD networks. However, as the scale of QKD networks continues to expand, the cumbersome configuration of static routing methods is no longer suitable, and a dynamic routing method suitable for large-scale QKD networks is needed.

[0004] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0005] This disclosure provides a routing method, a routing apparatus, an electronic device, a computer-readable storage medium, and a computer program product suitable for QKD networks.

[0006] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0007] According to one aspect of this disclosure, a routing method applicable to a QKD network is provided, comprising: determining a source key node and a destination key node in the QKD network; obtaining multiple key relay paths between the source key node and the destination key node based on the topology information of the QKD network; for each of the multiple key relay paths, calculating a composite routing metric value of the key relay path based on path evaluation parameters of the key relay path; the path evaluation parameters of the key relay path include: the minimum remaining key quantity of each link on the key relay path, the minimum reliability metric value of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; and determining a target key relay path from the multiple key relay paths based on the composite routing metric value of all the key relay paths in the multiple key relay paths.

[0008] In some embodiments of this disclosure, calculating the composite routing metric of the key relay path based on the path evaluation parameters of the key relay path includes: obtaining the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; calculating a first ratio between a first preset parameter and the minimum value of the reliability metric of each link on the key relay path, and determining a first metric based on the first ratio; calculating a second ratio between a second preset parameter and the minimum value of the remaining key quantity of each link on the key relay path; calculating the sum of the reciprocals of the key exchange rates of all key nodes on the key relay path, and calculating a first product between a third preset parameter and the sum of the reciprocals; calculating a second metric based on the second ratio and the first product; and calculating the composite routing metric of the key relay path based on the first metric and the second metric.

[0009] In some embodiments of this disclosure, calculating the second metric based on the second ratio and the first product includes: summing the second ratio and the first product to obtain a summation result; and determining the summation result as the second metric.

[0010] In some embodiments of this disclosure, calculating the second metric based on the second ratio and the first product includes: summing the second ratio and the first product to obtain a summation result; and multiplying the summation result by a preset expansion factor to obtain the second metric.

[0011] In some embodiments of this disclosure, the path evaluation parameters of the key relay path further include: target path evaluation parameters; wherein, the method further includes: calculating a second product between a fourth preset parameter and the target path evaluation parameters; the second product is used to combine with the second ratio and the first product to jointly calculate the second metric value.

[0012] In some embodiments of this disclosure, determining a target key relay path from the plurality of key relay paths based on the composite routing metric value of all the key relay paths includes: selecting the minimum routing metric value from the composite routing metric values ​​of all the key relay paths in the plurality of key relay paths; calculating a routing metric reference value based on preset path parameter information and the minimum routing metric value; and selecting a key relay path from the plurality of key relay paths whose composite routing metric value is less than or equal to the routing metric reference value as the target key relay path.

[0013] In some embodiments of this disclosure, the number of target key relay paths is multiple; wherein, the method further includes: after receiving a key relay request, determining a traffic balancing method based on the composite routing metric value of the multiple target key relay paths; if the traffic balancing method is equal-cost load balancing, then the key relay traffic is evenly distributed to the multiple target key relay paths for transmission; if the traffic balancing method is non-equal-cost load balancing, then a traffic allocation ratio is determined based on the minimum value of the remaining key quantity on each link of the multiple target key relay paths, and the key relay traffic is allocated to the multiple target key relay paths for transmission according to the traffic allocation ratio.

[0014] In some embodiments of this disclosure, determining the traffic balancing method based on the composite routing metric values ​​of the multiple target key relay paths includes: determining whether the composite routing metric values ​​of the multiple target key relay paths are the same; if the composite routing metric values ​​of the multiple target key relay paths are the same, then determining that the traffic balancing method is equal-cost load balancing; if the composite routing metric values ​​of the multiple target key relay paths are different, then determining that the traffic balancing method is non-equal-cost load balancing.

[0015] According to another aspect of this disclosure, a routing apparatus suitable for a QKD network is also provided, comprising: a node determination module configured to determine a source key node and a destination key node in the QKD network; a path acquisition module configured to acquire multiple key relay paths between the source key node and the destination key node based on the topology information of the QKD network; a metric calculation module configured to calculate a composite routing metric value of the key relay path for each of the multiple key relay paths based on path evaluation parameters of the key relay path; the path evaluation parameters of the key relay path include: the minimum remaining key quantity of each link on the key relay path, the minimum reliability metric value of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; and a path determination module configured to determine a target key relay path from the multiple key relay paths based on the composite routing metric value of all the key relay paths in the multiple key relay paths.

[0016] According to another aspect of this disclosure, an electronic device is also provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-described routing method for QKD networks by executing the executable instructions.

[0017] According to another aspect of this disclosure, a computer-readable storage medium is also provided, on which a computer program is stored, which, when executed by a processor, implements the above-described routing method applicable to QKD networks.

[0018] According to another aspect of this disclosure, a computer program product is also provided, comprising: a computer program or instructions that, when executed by a processor, implement the above-described routing method applicable to QKD networks.

[0019] The routing method for QKD networks provided in this disclosure first determines the source and destination key nodes for end-to-end services in the QKD network. Then, it uses the QKD network topology information to obtain multiple key relay paths between the source and destination key nodes. Each key relay path is then evaluated, taking into account the minimum remaining key quantity on each link, the minimum reliability metric of each link, and the key exchange rate of the key nodes to calculate a composite routing metric for each key relay path. Finally, based on the calculated composite routing metric, the target key relay path is selected from the multiple key relay paths. Therefore, this disclosure provides a dynamic routing method for QKD networks, defining a composite routing metric for key relay paths in the QKD network. This composite routing metric considers factors such as the remaining key quantity on the links, the key exchange rate of the nodes, and the link reliability metric. This metric comprehensively and accurately reflects the security, stability, and transmission efficiency of the path, making it suitable for large-scale QKD networks and improving routing accuracy.

[0020] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description

[0021] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0022] Figure 1 A schematic diagram of the structure of a distributed QKD network according to an embodiment of the present disclosure is shown;

[0023] Figure 2 A schematic diagram of the structure of a centralized QKD network according to an embodiment of the present disclosure is shown;

[0024] Figure 3A flowchart illustrating a routing method applicable to a QKD network according to an embodiment of this disclosure is shown;

[0025] Figure 4 This diagram illustrates the process of calculating the composite routing metric of a key relay path based on the path evaluation parameters of the key relay path in an embodiment of this disclosure.

[0026] Figure 5 This diagram illustrates the process of determining the target key relay path in an embodiment of this disclosure.

[0027] Figure 6 A flowchart illustrating a method for processing key relay traffic in an embodiment of this disclosure is provided.

[0028] Figure 7 This diagram illustrates the QKD network topology information maintained by the QKD network controller in this embodiment of the present disclosure.

[0029] Figure 8 This diagram illustrates a structural block diagram of a routing device suitable for a QKD network according to an embodiment of the present disclosure;

[0030] Figure 9 A structural block diagram of an electronic device according to an embodiment of the present disclosure is shown. Detailed Implementation

[0031] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0032] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0033] It should be noted that the acquisition, storage, use, and processing of data in this disclosed technical solution comply with the relevant provisions of national laws and regulations. The various types of data, such as personal identity data, operational data, and behavioral data related to individuals, customers, and groups, obtained in the embodiments of this disclosure have all been authorized.

[0034] To facilitate understanding, before introducing the embodiments of this disclosure, the terms involved in the embodiments of this disclosure are explained as follows:

[0035] Quantum Key Distribution (QKD) is based on the fundamental principles of quantum mechanics to ensure that two communicating parties can generate an identical string of random numbers that cannot be obtained by an attacker, which can then be used as a shared key.

[0036] Key management - quantum key distribution (QKD, KM-QKD) is the application of QKD technology to key management.

[0037] QKD network link state advertisements (QLSAs) include information about KM-QKD neighbor nodes and links.

[0038] The QKD Link State Database (QLSDB) is a link state database applied to QKD networks, used to store and manage the state information of nodes and links in the QKD network.

[0039] The specific implementation methods of the embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0040] Figure 1 A schematic diagram of the structure of a distributed QKD network according to an embodiment of this disclosure is shown. Figure 1 As shown, the distributed QKD network includes a QKD network management system and multiple first QKD nodes. Each first QKD node includes a QKD network controller, a key management (KM) module, and a QKD module. First QKD nodes distribute keys via a quantum channel and transmit encrypted data via a classical channel.

[0041] In a distributed QKD network, adjacent first-order QKD nodes periodically send messages to establish and maintain neighbor relationships and determine the QKD network topology. Neighboring nodes exchange QLSA update packets at regular time intervals. Furthermore, when the state of a first-order QKD node changes (e.g., a QKD device goes offline or the QKD network link state changes), it also sends QLSA update packets to its neighboring QKD nodes. These QLSA update packets contain information such as the remaining key quantity on the link, the node's key exchange rate, and link reliability metrics.

[0042] Figure 2A schematic diagram of a centralized QKD network according to an embodiment of the present disclosure is shown. Figure 2 As shown, the centralized QKD network includes a QKD network management system, a QKD network controller, and multiple second QKD nodes. Each second QKD node includes a KM and a QKD module. Key distribution between the second QKD nodes is performed via a quantum channel, and encrypted data is transmitted via a classical channel.

[0043] For centralized QKD networks, the establishment and maintenance of neighbor relationships and the determination of the QKD network topology are the responsibility of the QKD network management system. The QKD network management system sends QLSA update packets to the QKD network controller at regular intervals. Additionally, when the QKD network management system detects a change in network status (such as QKD devices going offline or changes in QKD network link status), it also sends a QLSA update packet to the QKD controller. This QLSA update packet contains information such as the remaining key quantity for the link, the key exchange rate of the nodes, and link reliability metrics. The QKD network controller is responsible for maintaining the QLSDB.

[0044] Those skilled in the art will know that Figure 1 The number of the first QKD nodes and Figure 2 The number of the second QKD nodes is merely illustrative; any number of nodes can be used as needed. This disclosure does not limit this.

[0045] This disclosure provides a routing method suitable for QKD networks, which can be executed by any electronic device with computing power.

[0046] In some embodiments, the method applicable to QKD networks provided in this disclosure can be executed by the QKD network controller in the QKD network; in other embodiments, the method applicable to QKD networks provided in this disclosure can be executed by the QKD network management system in the QKD network; in still other embodiments, the method applicable to QKD networks provided in this disclosure can be implemented by the QKD network controller and the QKD network management system in the QKD network through interaction.

[0047] Figure 3 A flowchart illustrating a routing method applicable to a QKD network according to an embodiment of this disclosure is shown, such as... Figure 3 As shown, the routing method for QKD networks provided in this embodiment includes the following steps.

[0048] Step S310: Determine the source key node and destination key node in the QKD network.

[0049] In the routing method for QKD networks provided in this embodiment, the source key node and destination key node for end-to-end services in the QKD network are first determined.

[0050] Step S320: Based on the topology information of the QKD network, obtain multiple key relay paths between the source key node and the destination key node.

[0051] In this embodiment of the disclosure, the topology information of the QKD network includes the connection relationships and link characteristics between nodes in the network. Specifically, it involves establishing and maintaining neighbor relationships between KM-QKD nodes to determine the topology of the QKD network.

[0052] Taking a centralized QKD network as an example, the QKD network management system sends QLSA update packets to the QKD network controller at regular intervals. When the QKD network management system detects a change in network status, such as a QKD device going offline or a change in the QKD network link status, it also sends a QLSA update packet to the QKD network controller. This QLSA update packet contains information such as the remaining key quantity for the link, the key exchange rate of the nodes, and link reliability metrics. After the QKD network deployment is complete, the QKD network controller can obtain the QKD network topology from the QKD network management system.

[0053] In step S320, after determining the source key node and the destination key node, the known topology information of the QKD network can be used to obtain all possible key relay paths between the source key node and the destination key node.

[0054] Step S330: For each key relay path among multiple key relay paths, calculate the composite routing metric of the key relay path based on the path evaluation parameters of the key relay path.

[0055] In this embodiment of the disclosure, the composite routing metric of the key relay path refers to an indicator used to evaluate the path performance of the key relay path and to compare the advantages of different paths.

[0056] In this embodiment of the disclosure, the path evaluation parameters of the key relay path refer to the parameters used to calculate the composite routing metric value of the key relay path, including the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric value of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path.

[0057] The minimum remaining key quantity on each link of a key relay path refers to the link with the fewest remaining key quantity among all links on the key relay path. Here, a link refers to the communication channel between two adjacent nodes, and the remaining key quantity refers to the number of currently available, unused keys in that link. In a QKD network, if the remaining key quantity on a link is insufficient, it may lead to security risks when transmitting keys. Therefore, selecting the link with the smallest remaining key quantity as the evaluation criterion ensures the security of key transmission throughout the entire path.

[0058] The minimum reliability metric value of all links on a key relay path refers to the link with the lowest reliability metric value among all links on the key relay path. The link reliability metric refers to the link's ability to maintain secure and stable transmission of keys, and is typically related to various factors such as the link's physical characteristics, transmission technology, and network environment. In a QKD network, insufficient reliability of any link can affect the security of the entire key transmission process. Therefore, selecting the link with the lowest reliability metric value as the evaluation standard ensures the transmission stability of the entire path.

[0059] The key exchange rate across all key nodes on a key relay path refers to the rate at which all key nodes exchange keys along that path. The key exchange rate is the speed at which keys are transmitted between key nodes, and it is typically related to various factors such as node processing capabilities, transmission protocols, and network environment. In a QKD network, the key exchange rate significantly impacts the efficiency and real-time performance of key transmission. A low key exchange rate can lead to key transmission delays, thus affecting the overall performance of the QKD network. Therefore, selecting a path with a high key exchange rate ensures efficient and real-time key transmission.

[0060] In step S330, after obtaining multiple key relay paths, each key relay path is analyzed. The minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link, and the key exchange rate of all key nodes are calculated to obtain the composite routing metric of the key relay path.

[0061] Step S340: Determine the target key relay path from the multiple key relay paths based on the composite routing metric value of all key relay paths in the multiple key relay paths.

[0062] After calculating the composite routing metric for each key relay path, the composite routing metric for all key relay paths is analyzed to select the target key relay path.

[0063] The routing method for QKD networks provided in this disclosure first determines the source and destination key nodes for end-to-end services in the QKD network. Then, it uses the QKD network topology information to obtain multiple key relay paths between the source and destination key nodes. Each key relay path is then evaluated, taking into account the minimum remaining key quantity on each link, the minimum reliability metric of each link, and the key exchange rate of the key nodes to calculate a composite routing metric for each key relay path. Finally, based on the calculated composite routing metric, the target key relay path is selected from the multiple key relay paths. Therefore, this disclosure provides a dynamic routing method for QKD networks, defining a composite routing metric for key relay paths in the QKD network. This composite routing metric considers factors such as the remaining key quantity on the links, the key exchange rate of the nodes, and the link reliability metric. This metric comprehensively and accurately reflects the security, stability, and transmission efficiency of the path, making it suitable for large-scale QKD networks and improving routing accuracy.

[0064] Figure 4 This diagram illustrates the process of calculating the composite routing metric of a key relay path based on path evaluation parameters in an embodiment of this disclosure. For example... Figure 4 As shown, for each key relay path, the composite routing metric can be calculated by following these steps.

[0065] Step S401: Obtain the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path.

[0066] In this embodiment of the disclosure, the minimum value of the remaining key quantity on each link of the key relay path. It refers to the key quantity of the link with the fewest remaining keys among all links in the key relay path, and the unit can be Mb.

[0067] In this embodiment of the disclosure, the minimum value of the reliability metric for each link on the key relay path is... This refers to the reliability metric of the link with the lowest reliability metric value among all links on the key relay path. In one possible implementation, It is a dynamic metric parameter determined by the QKD network management system based on the error rate reported by the QKD network interface hardware or firmware. The value of is an integer in the range [0, 255], where 255 represents the link with the highest reliability.

[0068] In this embodiment of the disclosure, the key exchange rate of all key nodes on the key relay path refers to the rate at which all key nodes exchange keys on the key relay path. It is the key exchange rate of the i-th intermediate node on the key relay path, and the unit can be Mbps.

[0069] Step S402: Calculate the first ratio between the first preset parameter and the minimum value of the reliability metric of each link on the key relay path, and determine the first metric value based on the first ratio.

[0070] In this embodiment of the disclosure, the first preset parameter These refer to parameters pre-set according to the requirements of the QKD network. Calculate the first pre-set parameters. The minimum value of the reliability metric of each link on the key relay path The first ratio between Then the first ratio Add 1 to obtain the first metric value. .

[0071] Step S403: Calculate the second ratio between the second preset parameter and the minimum value of the remaining key quantity on each link of the key relay path.

[0072] In this embodiment of the disclosure, the second preset parameter These refer to parameters pre-set according to the requirements of the QKD network. Calculate the second pre-set parameters. The minimum amount of remaining key on each link of the key relay path The second ratio between .

[0073] Step S404: Calculate the reciprocal sum of the key exchange rates of all key nodes on the key relay path, and calculate the first product between the third preset parameter and the reciprocal sum.

[0074] In this embodiment of the disclosure, the reciprocal sum of the key exchange rates of all key nodes on the key relay path is calculated. In other words, for each key node on the key relay path, calculate the reciprocal of that key exchange rate, then sum the reciprocals of the key exchange rates of all key nodes on the key relay path to obtain the sum of the reciprocals of the key exchange rates of all key nodes on the key relay path. .

[0075] Calculate the third preset parameter The sum of the reciprocals of the key exchange rates of all key nodes on the key relay path The first product between Among them, the third preset parameter These are parameters that are pre-set according to the requirements of the QKD network.

[0076] Step S405: Calculate the second metric value based on the second ratio and the first product.

[0077] In some embodiments of this disclosure, calculating a second metric based on a second ratio and a first product includes: summing the second ratio and the first product to obtain a summation result; and determining the summation result as the second metric.

[0078] In this embodiment of the disclosure, the second ratio with the first product Summing yields the second metric. .

[0079] Step S406: Calculate the composite routing metric of the key relay path based on the first metric and the second metric.

[0080] In this embodiment of the disclosure, the first metric value is calculated. With the second metric The product of the two is used to obtain the composite routing metric of the key relay path, as shown in formula (1).

[0081]

[0082] In the routing method for QKD networks provided in this disclosure, the evaluation process for each key relay path considers factors such as the remaining key quantity of the link, the link reliability metric, and the key node exchange rate. This ensures that the calculated metrics can comprehensively and accurately reflect the security, stability, and transmission efficiency of the path. It not only ensures that the selected path achieves an optimal balance in key resources, reliability, and communication efficiency, effectively avoiding the risks of resource exhaustion and communication interruption, but also allows for flexible adjustment of preset parameters according to actual needs to adapt to different network environments and application scenarios.

[0083] In some embodiments of this disclosure, calculating a second metric based on a second ratio and a first product includes: summing the second ratio and the first product to obtain a summation result; and multiplying a preset expansion factor by the summation result to obtain the second metric.

[0084] In this embodiment of the disclosure, when calculating the composite routing metric of the key relay path, an extension factor s is also introduced, as shown in formula (2).

[0085]

[0086] In formula (2), This is the composite routing metric for the key relay path with an expansion factor introduced. Comparing formulas (1) and (2), we can see that after obtaining the second ratio and the first product, the second ratio is multiplied by the expansion factor s, and the first product is multiplied by the expansion factor s, and then summed to obtain the second metric. The suggested value for the expansion factor is 10. 8 .

[0087] In the routing method for QKD networks provided in this disclosure, the evaluation process for each key relay path considers factors such as the remaining key quantity of the link, link reliability, and key node exchange rate. An extension factor is also introduced to enable the evaluation process to more comprehensively consider the QKD network status and requirements, thereby selecting a target key relay path that better meets the network conditions and requirements from multiple key relay paths.

[0088] In some embodiments of this disclosure, the path evaluation parameters for the key relay path further include: target path evaluation parameters. The method further includes: calculating a second product between a fourth preset parameter and the target path evaluation parameters; the second product is used to combine with a second ratio and a first product to jointly calculate a second metric value.

[0089] In this embodiment of the disclosure, the target path evaluation parameter refers to parameters other than those such as the minimum remaining key quantity of each link on the key relay path, the minimum reliability metric of each link, and the key exchange rate of all key nodes, such as the key generation rate of the links on the key relay path. When calculating the composite routing metric of the key relay path, the target path evaluation parameter can be added, as shown in formula (3).

[0090]

[0091] In formula (3), For the composite routing metric of the key relay path that takes into account the target path evaluation parameters, other factor1 is the target path evaluation parameter. The fourth preset parameter, corresponding to the target path evaluation parameters, is a parameter pre-set according to the requirements of the QKD network.

[0092] In this embodiment of the disclosure, QKD nodes within the same QKD network that have the same preset parameter values ​​can be identified as neighboring nodes. By setting different preset parameter values, different routing behaviors are generated, reflecting the specific characteristics of the QKD network and the diversified needs of services.

[0093] In the routing method for QKD networks provided in this disclosure, the evaluation process for each key relay path considers factors such as the remaining key quantity of the link, link reliability, and key node exchange rate. Target path evaluation parameters are also introduced, enabling the evaluation process to more comprehensively consider the QKD network status and requirements, thereby selecting a target key relay path that better meets the network conditions and requirements from among multiple key relay paths.

[0094] It should be noted that, in calculating the composite routing metric for each key relay path, the embodiments of this disclosure consider factors such as the remaining key quantity of the link, the link reliability, and the key node exchange rate. They may also introduce the expansion factor and the target path evaluation parameter. The embodiments of this disclosure do not limit this.

[0095] Figure 5 This diagram illustrates the process of determining the target key relay path in an embodiment of this disclosure. Figure 5 The process of determining a target key relay path from multiple key relay paths based on the composite routing metric of all key relay paths is illustrated, and specifically includes the following steps.

[0096] Step S501: Select the minimum routing metric value from the composite routing metric values ​​of all key relay paths in the multiple key relay paths.

[0097] After calculating the composite metric for each key relay path, the composite metric for all key relay paths is compared, and the minimum routing metric, min metric, is selected.

[0098] Step S502: Calculate the route metric reference value based on the preset path parameter information and the minimum route metric value.

[0099] In this embodiment of the disclosure, the path parameter information variance is preset and multiplied by the minimum routing metric minmetric to obtain the routing metric reference value (variance * min metric).

[0100] Step S503: Select the key relay path whose composite routing metric value is less than or equal to the routing metric reference value from multiple key relay paths as the target key relay path.

[0101] For each key relay path among multiple key relay paths, if the composite routing metric value of that key relay path is less than or equal to the routing metric reference value (variance * min metric), then that key relay path is confirmed as the target key relay path. After analyzing each key relay path, the target key relay path among the multiple key relay paths is obtained.

[0102] In the routing method for QKD networks provided in this disclosure, a routing metric reference value is calculated by multiplying preset path parameter information by the minimum routing metric value. This step enhances the flexibility of routing selection and allows for dynamic adjustment of the routing metric reference value based on actual needs and the QKD network status. Selecting a key relay path with a composite routing metric value less than or equal to the routing metric reference value as the target path ensures the superior performance of the selected path. This not only improves the accuracy of routing selection but also enhances the adaptability and flexibility of the network, contributing to improved overall network performance and security.

[0103] In some embodiments of this disclosure, after obtaining the target key relay path, the target key relay path is updated in the routing table of the QKD network controller as the basis for key relay, so that key relay is performed according to the routing table of the QKD network controller when key relay is performed.

[0104] Figure 6 A flowchart illustrating a method for processing key relay traffic in an embodiment of this disclosure is shown. Figure 6 This demonstrates how to segment key relay traffic when there are multiple target key relay paths, specifically including the following steps.

[0105] Step S610: After receiving the key relay request, determine the traffic balancing method based on the composite routing metric value of multiple target key relay paths.

[0106] In this embodiment of the disclosure, if there is only one target key relay path, the key relay traffic is allocated to that target relay path for transmission.

[0107] In this embodiment of the disclosure, if there are multiple target key relay paths, the multiple target key relay paths are analyzed to determine a traffic balancing method, and traffic is subsequently allocated and transmitted based on this traffic balancing method. In some embodiments of this disclosure, determining the traffic balancing method based on the composite routing metric value of multiple target key relay paths includes: determining whether the composite routing metric values ​​of multiple target key relay paths are the same; if the composite routing metric values ​​of multiple target key relay paths are the same, the traffic balancing method is determined to be equal-cost load balancing; if the composite routing metric values ​​of multiple target key relay paths are different, the traffic balancing method is determined to be non-equal-cost load balancing.

[0108] In this embodiment of the disclosure, if the composite routing metric values ​​of multiple target key relay paths are the same, it indicates that these paths are comparable in transmission efficiency and security. Key relay traffic can be evenly distributed across these paths to achieve equal-cost load balancing. Therefore, when the composite routing metric values ​​of multiple target key relay paths are the same, the traffic balancing method is determined to be equal-cost load balancing.

[0109] In this embodiment of the disclosure, if the composite routing metric values ​​of multiple target key relay paths are different, it indicates that these paths differ in transmission efficiency and security. Key relay traffic can be allocated based on these differences to achieve non-equivalent load balancing. Therefore, when the composite routing metric values ​​of multiple target key relay paths are different, the traffic balancing method is determined to be non-equivalent load balancing.

[0110] Step S620: If the traffic balancing method is equal-cost load balancing, then the key relay traffic is evenly distributed to multiple target key relay paths for transmission.

[0111] If the traffic balancing method is determined to be equal-cost load balancing, the key relay traffic is evenly distributed to all target key relay paths, ensuring that each path bears the same traffic load and avoiding the situation where some paths are overloaded while other paths are idle.

[0112] Step S630: If the traffic balancing method is non-equivalent load balancing, then the traffic allocation ratio is determined based on the minimum value of the remaining key quantity on each link of the multiple target key relay paths, and the key relay traffic is allocated to the multiple target key relay paths for transmission according to the traffic allocation ratio.

[0113] If the traffic balancing method is determined to be non-equivalent load balancing, the traffic allocation ratio is determined based on the minimum remaining key quantity on each link of each target key relay path. In other words, the proportion of traffic that each target key relay path should handle is calculated based on the minimum remaining key quantity on each link of each target key relay path. This proportion is directly proportional to the quality of the path, ensuring that better key relay paths handle more traffic.

[0114] After determining the traffic allocation ratio, the key relay traffic is distributed to each target key relay path according to the determined traffic allocation ratio, ensuring that the traffic is allocated according to the quality of the path, thereby improving the overall transmission efficiency and security.

[0115] The routing method for QKD networks provided in this disclosure considers the composite routing metric of the target key relay path, and gives two key relay traffic segmentation methods: equal-cost load balancing and non-equal-cost load balancing. In the non-equal-cost load balancing segmentation method, the traffic allocation ratio is determined based on the remaining key quantity, which improves the utilization rate of key resources on the key relay path link, avoids the exhaustion of key resources on a single path, and enhances the robustness and fault tolerance of the QKD network.

[0116] To facilitate understanding, specific embodiments are provided to illustrate the routing method and traffic segmentation method applicable to QKD networks according to the embodiments of this disclosure.

[0117] After QKD network deployment is complete and devices are powered on, the QKD network controller can obtain the QKD network topology from the QKD network management system. The QKD network management system sends QLSA update packets to the QKD network controller at regular intervals. Additionally, when the QKD network management system detects changes in network status, such as QKD devices going offline or changes in QKD network link status, it will also send QLSA update packets to the QKD controller. The QLSA update packets contain information such as the remaining key quantity for the link, the key exchange rate of the nodes, and link reliability. The QKD network controller is responsible for maintaining a link state database for the entire network, which records the QKD network topology information as shown in the image. Figure 7 As shown.

[0118] Figure 7 This diagram illustrates the QKD network topology maintained by the QKD network controller in an embodiment of this disclosure. For example... Figure 7 As shown, the QKD network includes eight QKD nodes: A, B, C, D, E, F, G, and H. Node A is the source key node, and node D is the destination key node.

[0119] Specifically, the remaining key quantity for the link between node A and node B is 200Mb, and the reliability metric value is 255; the remaining key quantity for the link between node B and node C is 100Mb, and the reliability metric value is 192; the remaining key quantity for the link between node C and node D is 160Mb, and the reliability metric value is 255; the remaining key quantity for the link between node A and node E is 80Mb, and the reliability metric value is 200; and the remaining key quantity for the link between node E and node D is 180Mb, and the reliability metric value is 222. The remaining key quantity for the link between node A and node F is 100Mb, and the reliability metric is 215; the remaining key quantity for the link between node F and node D is 150Mb, and the reliability metric is 240; the remaining key quantity for the link between node A and node G is 200Mb, and the reliability metric is 200; the remaining key quantity for the link between node G and node H is 220Mb, and the reliability metric is 246; the remaining key quantity for the link between node H and node D is 180Mb, and the reliability metric is 255.

[0120] The key exchange rate of node B is 6 Mbps, the key exchange rate of node C is 10 Mbps, the key exchange rate of node E is 8 Mbps, the key exchange rate of node F is 15 Mbps, the key exchange rate of node G is 20 Mbps, and the key exchange rate of node H is 8 Mbps.

[0121] Figure 7In the above, the paths between node A and node D are: ABCD, AED, AFD, AGHD. The composite routing metric is given by formula (2) above. If we take s=10 8 The comprehensive metric values ​​for each path in ABCD, AED, AFD, and AGHD can be calculated to be 27.8, 13.8, 7.70, and 18.15, respectively.

[0122] When determining the target key relay path among multiple key relay paths, assuming the pre-set multi-path parameter information variance=3, all paths with a path composite metric value less than or equal to 3 * 7.70 are selected. Analysis shows that the three paths AED, AFD, and AGHD all meet the requirements. These three paths are determined as the target key relay paths and updated in the routing table of the QKD network controller as the basis for key relay.

[0123] Because the composite routing metric values ​​for the three paths AED, AFD, and AGHD are different, key relay traffic is allocated according to the metric values ​​of each path during key relay. The proportions are divided across different paths. Specifically, the path AEDs... Path AFD Path AGHD The key relay traffic on these three paths is distributed in a ratio of 4:5:9, and the key relay traffic is allocated to these three paths for transmission according to this ratio.

[0124] The routing method for QKD networks provided in this disclosure considers factors such as the remaining key quantity on the link, the key exchange rate of nodes, and link reliability, and defines a composite routing metric for key relay paths in the QKD network, thereby improving routing accuracy. Furthermore, corresponding preset parameters can be set when calculating the composite routing metric for key relay paths, allowing for flexible determination of routing principles based on the specific characteristics of the QKD network and the diverse needs of services. Additionally, when performing key relay, the composite routing metric for the path is considered, and two key relay traffic segmentation methods—equal-cost load balancing and unequal-cost load balancing—are provided. In the unequal-cost load balancing segmentation method, the traffic allocation ratio is determined based on the remaining key quantity, improving the utilization rate of key resources on key relay path links, preventing the exhaustion of key resources on a single path, and enhancing the robustness and fault tolerance of the QKD network.

[0125] Based on the same inventive concept, this disclosure also provides a routing device suitable for QKD networks, as described in the following embodiments. Since the principle by which this device embodiment solves the problem is similar to that of the above-described method embodiments, the implementation of this device embodiment can refer to the implementation of the above-described method embodiments, and repeated details will not be elaborated further.

[0126] Figure 8 This diagram illustrates a structural block diagram of a routing device suitable for a QKD network according to an embodiment of this disclosure. Figure 8 As shown, the device includes: a node determination module 810, a path acquisition module 820, a metric calculation module 830, and a path determination module 840.

[0127] The node determination module 810 is configured to determine the source key node and the destination key node in the QKD network. The path acquisition module 820 is configured to acquire multiple key relay paths between the source key node and the destination key node based on the topology information of the QKD network. The metric calculation module 830 is configured to calculate a composite routing metric for each key relay path based on the path evaluation parameters of the key relay path. The path evaluation parameters of the key relay path include: the minimum remaining key quantity on each link of the key relay path, the minimum reliability metric of each link of the key relay path, and the key exchange rate of all key nodes on the key relay path. The path determination module 840 is configured to determine the target key relay path from the multiple key relay paths based on the composite routing metric of all key relay paths in the multiple key relay paths.

[0128] In some embodiments of this disclosure, the metric calculation module 830 is further configured to: obtain the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; calculate a first ratio between a first preset parameter and the minimum value of the reliability metric of each link on the key relay path, and determine a first metric based on the first ratio; calculate a second ratio between a second preset parameter and the minimum value of the remaining key quantity of each link on the key relay path; calculate the sum of the reciprocals of the key exchange rates of all key nodes on the key relay path, and calculate a first product between a third preset parameter and the sum of the reciprocals; calculate a second metric based on the second ratio and the first product; and calculate a composite routing metric of the key relay path based on the first metric and the second metric.

[0129] In some embodiments of this disclosure, the metric calculation module 830 is further configured to: sum the second ratio and the first product to obtain a summation result; and determine the summation result as the second metric value.

[0130] In some embodiments of this disclosure, the metric calculation module 830 is further configured to: sum the second ratio and the first product to obtain a summation result; and multiply the summation result by a preset expansion factor to obtain a second metric value.

[0131] In some embodiments of this disclosure, the path evaluation parameters of the key relay path further include: target path evaluation parameters. The metric calculation module 830 is further configured to: calculate a second product between a fourth preset parameter and the target path evaluation parameters; the second product is used to combine with a second ratio and a first product to jointly calculate a second metric.

[0132] In some embodiments of this disclosure, the path determination module 840 is further configured to: select the minimum routing metric value from the composite routing metric values ​​of all key relay paths in a plurality of key relay paths; calculate a routing metric reference value based on preset path parameter information and the minimum routing metric value; and select a key relay path whose composite routing metric value is less than or equal to the routing metric reference value from the plurality of key relay paths as the target key relay path.

[0133] In some embodiments of this disclosure, the number of target key relay paths is multiple. For example... Figure 8 As shown, the device 800 also includes a traffic processing module 850, configured to: upon receiving a key relay request, determine a traffic balancing method based on the composite routing metric of multiple target key relay paths; if the traffic balancing method is equal-cost load balancing, then distribute the key relay traffic evenly across the multiple target key relay paths for transmission; if the traffic balancing method is non-equal-cost load balancing, then determine the traffic allocation ratio based on the minimum remaining key quantity of each link on the multiple target key relay paths, and allocate the key relay traffic across the multiple target key relay paths for transmission according to the traffic allocation ratio.

[0134] In some embodiments of this disclosure, the traffic processing module 850 is further configured to: determine whether the composite routing metric values ​​of multiple target key relay paths are the same; if the composite routing metric values ​​of multiple target key relay paths are the same, determine that the traffic balancing method is equal-cost load balancing; if the composite routing metric values ​​of multiple target key relay paths are different, determine that the traffic balancing method is non-equal-cost load balancing.

[0135] It should be noted that the examples and application scenarios implemented by the modules in the above device embodiments and the corresponding steps in the method embodiments are the same, but are not limited to the content disclosed in the above method embodiments. It should also be noted that the above modules, as part of the device, can be executed in a computer system such as a set of computer-executable instructions.

[0136] Those skilled in the art will understand that various aspects of this disclosure can be implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, which can be collectively referred to herein as a "circuit", "module" or "system".

[0137] Based on the same inventive concept, this disclosure also provides an electronic device, which includes: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the routing method applicable to QKD networks described above by executing the executable instructions. Since the principle by which this electronic device embodiment solves the problem is similar to that of the above method embodiments, the implementation of this electronic device embodiment can refer to the implementation of the above method embodiments, and repeated details will not be described again.

[0138] The following reference Figure 9 To describe an electronic device 900 according to such an embodiment of the present disclosure. Figure 9 The electronic device 900 shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments disclosed herein.

[0139] like Figure 9 As shown, the electronic device 900 is manifested in the form of a general-purpose computing device. The components of the electronic device 900 may include, but are not limited to: at least one processing unit 910, at least one storage unit 920, and a bus 930 connecting different system components (including storage unit 920 and processing unit 910).

[0140] The storage unit stores program code that can be executed by the processing unit 910, causing the processing unit 910 to perform the steps described in the "Exemplary Methods" section of this specification according to various exemplary embodiments of this disclosure. For example, the processing unit 910 can perform the following steps of the above method embodiment: Step S310, determining the source key node and the destination key node in the QKD network; Step S320, obtaining multiple key relay paths between the source key node and the destination key node based on the topology information of the QKD network; Step S330, for each key relay path in the multiple key relay paths, calculating the composite routing metric value of the key relay path based on the path evaluation parameters of the key relay path, wherein the path evaluation parameters of the key relay path include: the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric value of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; Step S340, determining the target key relay path from the multiple key relay paths based on the composite routing metric value of all key relay paths in the multiple key relay paths.

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

[0142] The storage unit 920 may also include a program / utility 9204 having a set (at least one) program module 9205, such program module 9205 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0143] Bus 930 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0144] Electronic device 900 can also communicate with one or more external devices 940 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 900, and / or with any device that enables electronic device 900 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 950. Furthermore, electronic device 900 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 960. As shown, network adapter 960 communicates with other modules of electronic device 900 via bus 930. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0145] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, terminal device, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0146] Based on the same inventive concept, this disclosure also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements any of the above-described routing methods applicable to QKD networks. Since the principle by which this computer-readable storage medium embodiment solves the problem is similar to that of the above-described method embodiments, the implementation of this computer-readable storage medium embodiment can refer to the implementation of the above-described method embodiments, and repeated details will not be elaborated further.

[0147] More specific examples of computer-readable storage media in this disclosure may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0148] In this disclosure, a computer-readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting a program for use by or in connection with an instruction execution system, apparatus, or device.

[0149] Optionally, the program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0150] In practical implementation, program code for performing the operations of this disclosure can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0151] Based on the same inventive concept, this disclosure also provides a computer program product, including a computer program or instructions, which, when executed by a processor, implements a routing method suitable for QKD networks according to any one of the above method embodiments. Since the principle by which this computer program product embodiment solves the problem is similar to that of the above method embodiments, the implementation of this computer program product embodiment can refer to the implementation of the above method embodiments, and repeated details will not be elaborated further.

[0152] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this 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 and embodied by multiple modules or units.

[0153] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.

[0154] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0155] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims.

Claims

1. A routing method suitable for quantum key distribution networks, characterized in that, include: Determine the source key node and destination key node in the quantum key distribution network; Based on the topology information of the quantum key distribution network, multiple key relay paths between the source key node and the destination key node are obtained; For each of the multiple key relay paths, obtain the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path; Calculate a first ratio between a first preset parameter and the minimum value of the reliability metric of each link on the key relay path, and determine a first metric value based on the first ratio; Calculate the second ratio between the second preset parameter and the minimum value of the remaining key quantity on each link of the key relay path; Calculate the reciprocal sum of the key exchange rates of all key nodes on the key relay path, and calculate the first product between the third preset parameter and the reciprocal sum; calculate the second metric value based on the second ratio and the first product; calculate the composite routing metric value of the key relay path based on the first metric value and the second metric value; the minimum reliability metric value of each link on the key relay path refers to the reliability metric value of the link with the smallest reliability metric value among all links on the key relay path; The key exchange rate of all key nodes on the key relay path refers to the rate at which all key nodes on the key relay path exchange keys. The target key relay path is determined from the plurality of key relay paths based on the composite routing metric value of all the key relay paths in the plurality of key relay paths.

2. The method according to claim 1, characterized in that, The step of calculating the second metric value based on the second ratio and the first product includes: Summing the second ratio and the first product yields the summation result. The summation result is determined as the second metric.

3. The method according to claim 1, characterized in that, The step of calculating the second metric value based on the second ratio and the first product includes: Summing the second ratio and the first product yields the summation result. The second metric is obtained by multiplying the preset expansion factor by the summation result.

4. The method according to any one of claims 1 to 3, characterized in that, The path evaluation parameters for the key relay path also include: target path evaluation parameters; The method further includes: calculating a second product between a fourth preset parameter and the target path evaluation parameter; the second product is used to combine with the second ratio and the first product to jointly calculate the second metric value.

5. The method according to claim 1, characterized in that, The step of determining the target key relay path from the plurality of key relay paths based on the composite routing metric value of all the key relay paths includes: Select the minimum routing metric value from the composite routing metric values ​​of all the key relay paths in the plurality of key relay paths; Calculate the route metric reference value based on the preset path parameter information and the minimum route metric value; From the plurality of key relay paths, the key relay path whose composite routing metric value is less than or equal to the routing metric reference value is selected as the target key relay path.

6. The method according to claim 1, characterized in that, The number of target key relay paths is multiple; The method further includes: Upon receiving a key relay request, the traffic balancing method is determined based on the composite routing metric of multiple target key relay paths. If the traffic balancing method is equal-cost load balancing, then the key relay traffic will be evenly distributed to multiple target key relay paths for transmission. If the traffic balancing method is non-equivalent load balancing, then the traffic allocation ratio is determined based on the minimum value of the remaining key quantity on each link of the multiple target key relay paths, and the key relay traffic is allocated to the multiple target key relay paths for transmission according to the traffic allocation ratio.

7. The method according to claim 6, characterized in that, The step of determining the traffic balancing method based on the composite routing metric value of multiple target key relay paths includes: Determine whether the composite routing metric values ​​of multiple target key relay paths are the same; If the composite routing metric values ​​of multiple target key relay paths are the same, then the traffic balancing method is determined to be equal-cost load balancing. If the composite routing metric values ​​of multiple target key relay paths are different, then the traffic balancing method is determined to be non-equivalent load balancing.

8. A routing device suitable for quantum key distribution networks, characterized in that, include: The node determination module is configured to determine the source key node and the destination key node in the quantum key distribution network. The path acquisition module is configured to acquire multiple key relay paths between the source key node and the destination key node based on the topology information of the quantum key distribution network. The metric calculation module is configured to, for each of the plurality of key relay paths, obtain the minimum value of the remaining key quantity of each link on the key relay path, the minimum value of the reliability metric of each link on the key relay path, and the key exchange rate of all key nodes on the key relay path. Calculate a first ratio between a first preset parameter and the minimum value of the reliability metric of each link on the key relay path, and determine a first metric value based on the first ratio; Calculate the second ratio between the second preset parameter and the minimum value of the remaining key quantity on each link of the key relay path; Calculate the reciprocal sum of the key exchange rates of all key nodes on the key relay path, and calculate the first product between the third preset parameter and the reciprocal sum; calculate the second metric value based on the second ratio and the first product; calculate the composite routing metric value of the key relay path based on the first metric value and the second metric value; the minimum reliability metric value of each link on the key relay path refers to the reliability metric value of the link with the smallest reliability metric value among all links on the key relay path; The key exchange rate of all key nodes on the key relay path refers to the rate at which all key nodes on the key relay path exchange keys. The path determination module is configured to determine a target key relay path from the plurality of key relay paths based on a composite routing metric value of all the key relay paths in the plurality of key relay paths.

9. An electronic device, characterized in that, include: processor; as well as Memory for storing the executable instructions of the processor; The processor is configured to execute the routing method for quantum key distribution networks according to any one of claims 1 to 7 by executing the executable instructions.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the routing method for quantum key distribution networks as described in any one of claims 1 to 7.

11. A computer program product, comprising: A computer program or instruction, characterized in that, when executed by a processor, the computer program or instruction implements the routing method for quantum key distribution networks as described in any one of claims 1 to 7.

Images