Routing method suitable for quantum key distribution network and related equipment

Abstract

The invention provides a routing method suitable for a quantum key distribution network and related equipment, and relates to the technical field of quantum communication. The method comprises the following steps: determining a source key node and a target key node in the quantum key distribution network; obtaining a plurality of key relay paths between the source key node and the target key node according to the topological information of the quantum key distribution network; for each secret key relay path, calculating a composite routing metric value of the secret key relay path according to the minimum value of the residual secret key quantity of each link on the secret key relay path, the minimum value of the reliability metric value of each link and the secret key exchange rate of all secret key nodes; and determining a target key relay path from the plurality of key relay paths according to the calculated composite routing metric value. According to the method, the composite routing metric value of the key relay path is defined, the security, stability and transmission efficiency of the path can be comprehensively and accurately reflected, the method is suitable for a large-scale quantum key distribution network, and the routing accuracy is improved.

Description

Background Art

[0002] The Quantum Key Distribution (QKD) network is based on QKD technology. It establishes end-to-end services by connecting one or more relay nodes using QKD links between source and sink nodes, providing users with quantum keys to ensure the security of end-to-end user communications.

[0003] In the related art, static routing methods are used to implement routing of QKD networks. However, as the scale of QKD networks continues to expand, the cumbersome static routing method 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 above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0005] The present disclosure provides a routing method applicable to a QKD network, a routing device applicable to a QKD network, an electronic device, a computer-readable storage medium, and a computer program product.

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

[0007] According to one aspect of the present disclosure, there is provided a routing method applicable to a QKD network, comprising: determining a source key node and a destination key node in the QKD network; acquiring a plurality of key relay paths between the source key node and the destination key node according to topology information of the QKD network; for each key relay path in the plurality of key relay paths, calculating a composite routing metric value of the key relay path according to a path evaluation parameter of the key relay path; the path evaluation parameters of the key relay path comprising: a minimum value of the amount of remaining keys of each link on the key relay path, a minimum value of the reliability metric value of each link on the key relay path, and a key exchange rate of all key nodes on the key relay path; and determining a target key relay path from the plurality of key relay paths according to the composite routing metric values ​​of all the key relay paths in the plurality of key relay paths.

[0008] In some embodiments of the present disclosure, the calculation of 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 amount 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 value based on the first ratio; calculating a second ratio between a second preset parameter and the minimum value of the remaining key amount of each link on the key relay path; calculating the reciprocal sum 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 reciprocal sum; calculating a second metric value 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 value and the second metric value.

[0009] In some embodiments of the present disclosure, calculating the second metric value 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 value.

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

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

[0012] In some embodiments of the present disclosure, determining a target key relay path from the multiple key relay paths based on the composite routing metric values ​​of all the key relay paths in the multiple key relay paths includes: selecting a minimum routing metric value from the composite routing metric values ​​of all the key relay paths in the multiple 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 multiple 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 the present disclosure, the number of the target key relay paths is multiple; wherein the method further includes: after receiving the key relay request, determining the traffic balancing method according to the composite routing metric value of the multiple target key relay paths; if the traffic balancing method is equal-cost load balancing, then evenly distributing the key relay traffic to the multiple target key relay paths for transmission; if the traffic balancing method is non-equal-cost load balancing, then determining the traffic distribution ratio according to the minimum value of the remaining key amount of each link on the multiple target key relay paths, and distributing the key relay traffic to the multiple target key relay paths for transmission according to the traffic distribution ratio.

[0014] In some embodiments of the present disclosure, the traffic balancing method is determined based on the composite routing metric values ​​of the multiple target key relay paths, including: 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, 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, determining that the traffic balancing method is unequal-cost load balancing.

[0015] According to another aspect of the present disclosure, there is also provided a routing device suitable for a QKD network, 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 a plurality of key relay paths between the source key node and the destination key node according to the topology information of the QKD network; a metric calculation module, configured to calculate a composite routing metric of the key relay path for each key relay path in the plurality of key relay paths according to the path evaluation parameters of the key relay path; the path evaluation parameters of the key relay path include: a minimum value of the amount of remaining keys of each link on the key relay path, a minimum value of the reliability metric of each link on the key relay path, and a key exchange rate of all key nodes on the key relay path; a path determination module, configured to determine a target key relay path from the plurality of key relay paths according to the composite routing metric of all the key relay paths in the plurality of key relay paths.

[0016] According to another aspect of the present disclosure, an electronic device is also provided, which includes: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-mentioned routing method applicable to the QKD network by executing the executable instructions.

[0017] According to another aspect of the present disclosure, a computer-readable storage medium is also provided, on which a computer program is stored. When the computer program is executed by a processor, the routing method applicable to the QKD network is implemented.

[0018] According to another aspect of the present disclosure, a computer program product is also provided, including: a computer program or instructions, which implement the above-mentioned routing method applicable to the QKD network when executed by a processor.

[0019] In the routing method applicable to the QKD network provided by the embodiment of the present disclosure, the source key node and the destination key node of the end-to-end service in the QKD network are first determined, and then the topological information of the QKD network is used to obtain multiple key relay paths between the source key node and the destination key node, and then each key relay path is evaluated. In the evaluation process, the minimum value of the remaining 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 the key node are comprehensively considered to calculate the composite routing metric value of each key relay path, and finally, according to the calculated composite routing metric value, the target key relay path is selected from multiple key relay paths. It can be seen that the embodiment of the present disclosure provides a dynamic routing method applicable to the QKD network, defines the composite routing metric value of the key relay path in the QKD network, and the composite routing metric value takes into account factors such as the remaining key amount of the link, the key exchange rate of the node, and the link reliability metric value. This metric value can fully and accurately reflect the security, stability and transmission efficiency of the path, is applicable to large-scale QKD networks, and improves routing accuracy.

[0020] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0022] Figure 1 A schematic diagram of the structure of a distributed QKD network according to an embodiment of the present disclosure is shown; Figure 2 A schematic diagram of the structure of a centralized QKD network according to an embodiment of the present disclosure is shown; Figure 3 A flowchart showing a routing method applicable to a QKD network in an embodiment of the present disclosure is shown; Figure 4 A process diagram showing the calculation of the composite routing metric value of the key relay path according to the path evaluation parameter of the key relay path in an embodiment of the present disclosure is shown; Figure 5 A process diagram of determining a target key relay path in an embodiment of the present disclosure is shown; Figure 6 A flow chart showing a method for processing key relay traffic in an embodiment of the present disclosure; Figure 7 A diagram showing a QKD network topology information diagram maintained by a QKD network controller in an embodiment of the present disclosure is shown; Figure 8 A structural block diagram of a routing device applicable to a QKD network in an embodiment of the present disclosure is shown; Fig. 9 A structural block diagram of an electronic device in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0023] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts of the example 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.

[0024] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

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

[0026] For ease of understanding, before introducing the embodiments of the present disclosure, the terms involved in the embodiments of the present disclosure are first explained as follows: Quantum Key Distribution (QKD) is based on the basic principles of quantum mechanics to ensure that the two communicating parties can generate a string of identical random numbers that cannot be obtained by attackers as a shared key.

[0027] Key management-quantum key distribution (key management-QKD, KM-QKD), that is, applying QKD technology to key management.

[0028] QKD network Link State Advertisement (QLSA), including information about KM-QKD neighbor nodes and links.

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

[0030] The specific implementation of the embodiment of the present disclosure is described in detail below with reference to the accompanying drawings.

[0031] Figure 1 FIG. 4 shows a schematic diagram of the structure of a distributed QKD network according to an embodiment of the present disclosure. Figure 1 As shown, the distributed QKD network includes a QKD network management system and multiple first QKD nodes, each of which includes a QKD network controller, a key management (Key Management, KM) and a QKD module. The first QKD nodes distribute keys through quantum channels and transmit encrypted data through classical channels.

[0032] For a distributed QKD network, adjacent first QKD nodes periodically send messages to each other in order to establish and maintain neighbor relationships and determine the topology of the QKD network. Each neighbor node exchanges QLSA update packets at a certain time interval. In addition, when the state of a first QKD node changes (such as the QKD device is offline or the QKD network link state changes), a QLSA update packet is also sent to its neighbor QKD node. Among them, the QLSA update packet contains the remaining link key amount, the node key exchange rate, the link reliability metric, and other content.

[0033] Figure 2 FIG. 4 shows a schematic diagram of the structure of a centralized QKD network according to an embodiment of the present disclosure. Figure 2As shown, the centralized QKD network includes a QKD network management system, a QKD network controller and multiple second QKD nodes, each of which includes a KM and a QKD module. The second QKD nodes distribute keys through a quantum channel and transmit encrypted data through a classical channel.

[0034] For a centralized QKD network, the QKD network management system is responsible for establishing and maintaining neighbor relationships and determining the topology of the QKD network. The QKD network management system sends QLSA update packages to the QKD network controller at certain time intervals. In addition, when the QKD network management system detects a change in the network status (such as the QKD device is offline or the QKD network link status changes), it will also send a QLSA update package to the QKD controller. The QLSA update package contains the remaining link key amount, the key exchange rate of the node, the link reliability metric, and other content. The QKD network controller is responsible for maintaining the QLSDB.

[0035] Those skilled in the art will know that Figure 1 The number of the first QKD nodes in Figure 2 The number of the second QKD nodes in is only illustrative, and any number of nodes may be provided according to actual needs. This disclosure embodiment does not limit this.

[0036] The present disclosure provides a routing method applicable to a QKD network, which can be executed by any electronic device with computing and processing capabilities.

[0037] In some embodiments, the QKD network method provided in the embodiments of the present disclosure can be executed by the QKD network controller in the above-mentioned QKD network; in other embodiments, the QKD network method provided in the embodiments of the present disclosure can be executed by the QKD network management system in the above-mentioned QKD network; in other embodiments, the QKD network method provided in the embodiments of the present disclosure can be implemented by the QKD network controller and the QKD network management system in the above-mentioned QKD network through interaction.

[0038] Figure 3 A flowchart of a routing method applicable to a QKD network in an embodiment of the present disclosure is shown. Figure 3 As shown, the routing method applicable to the QKD network provided in the embodiment of the present disclosure includes the following steps.

[0039] Step S310, determining the source key node and the destination key node in the QKD network.

[0040] In the routing method applicable to the QKD network provided in the embodiment of the present disclosure, the source key node and the destination key node of the end-to-end service in the QKD network are first determined.

[0041] Step S320, obtaining multiple key relay paths between the source key node and the destination key node according to the topology information of the QKD network.

[0042] In the disclosed embodiment, the topology information of the QKD network includes the connection relationship between nodes in the network, link characteristics, etc. Specifically, the neighbor relationship between KM-QKD nodes is established and maintained to determine the topology structure of the QKD network.

[0043] Taking a centralized QKD network as an example, the QKD network management system sends QLSA update packages to the QKD network controller at certain time intervals. When the QKD network management system detects changes in the network status, such as the QKD device being offline or the QKD network link status changing, it will also send a QLSA update package to the QKD network controller. Among them, the QLSA update package contains the remaining key amount of the link, the key exchange rate of the node, the link reliability metric, and other content. After the QKD network is deployed, the QKD network controller can obtain the topology of the QKD network from the QKD network management system.

[0044] In step S320, after the source key node and the destination key node are determined, all possible key relay paths from the source key node to the destination key node can be obtained by using the known topology information of the QKD network.

[0045] Step S330: For each key relay path in the multiple key relay paths, a composite routing metric value of the key relay path is calculated according to the path evaluation parameter of the key relay path.

[0046] In the disclosed embodiment, 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 is used to compare the advantages of different paths.

[0047] In the disclosed embodiment, 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 amount 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.

[0048] The minimum value of the remaining key amount of each link on the key relay path refers to the key amount of the link with the least remaining key amount among all links on the key relay path. Among them, a link refers to the communication channel between two adjacent nodes, and the remaining key amount refers to the number of currently available and unconsumed keys in the link. In a QKD network, if the remaining key amount of a link is insufficient, it may cause the link to face security risks when transmitting keys. Therefore, selecting the link with the smallest remaining key amount as the evaluation criterion can ensure the key transmission security of the entire path.

[0049] The minimum value of the reliability metric of each link on the key relay path refers to the reliability metric of the link with the smallest reliability metric among all links on the key relay path. Among them, the link reliability metric refers to the ability of the link to maintain secure and stable transmission when transmitting keys, which is usually related to multiple factors such as the physical characteristics of the link, transmission technology, and network environment. In a QKD network, insufficient reliability of any link may affect the security of the entire key transmission process. Therefore, selecting the link with the smallest reliability metric as the evaluation criterion can ensure the transmission stability of the entire path.

[0050] The key exchange rate of all key nodes on the key relay path refers to the rate at which all key nodes perform key exchange on the key relay path. Among them, the key exchange rate refers to the speed at which keys are transmitted between key nodes, which is usually related to multiple factors such as the processing power of the nodes, the transmission protocol, and the network environment. In the QKD network, the key exchange rate affects the efficiency and real-time performance of key transmission. If the key exchange rate is too low, it may cause delays in key transmission, which in turn affects the performance of the entire QKD network. Therefore, choosing a path with a higher key exchange rate can ensure the efficiency and real-time performance of key transmission.

[0051] In step S330, after obtaining multiple key relay paths, each key relay path is analyzed, and the minimum value of the remaining key amount 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 value of the key relay path.

[0052] Step S340: determining a target key relay path from the multiple key relay paths according to the composite routing metrics of all the key relay paths in the multiple key relay paths.

[0053] After the composite routing metric value of each key relay path is calculated, the composite routing metric values ​​of all key relay paths are analyzed to select a target key relay path.

[0054] In the routing method applicable to the QKD network provided by the embodiment of the present disclosure, the source key node and the destination key node of the end-to-end service in the QKD network are first determined, and then the topological information of the QKD network is used to obtain multiple key relay paths between the source key node and the destination key node, and then each key relay path is evaluated. In the evaluation process, the minimum value of the remaining 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 the key node are comprehensively considered to calculate the composite routing metric value of each key relay path, and finally, according to the calculated composite routing metric value, the target key relay path is selected from multiple key relay paths. It can be seen that the embodiment of the present disclosure provides a dynamic routing method applicable to the QKD network, defines the composite routing metric value of the key relay path in the QKD network, and the composite routing metric value takes into account factors such as the remaining key amount of the link, the key exchange rate of the node, and the link reliability metric value. This metric value can fully and accurately reflect the security, stability and transmission efficiency of the path, is applicable to large-scale QKD networks, and improves routing accuracy.

[0055] Figure 4 FIG. 2 shows a process diagram of calculating the composite routing metric value of the key relay path according to the path evaluation parameter of the key relay path in an embodiment of the present disclosure. Figure 4 As shown, for each key relay path, the composite routing metric value of the key relay path can be calculated according to the following steps.

[0056] Step S401, obtaining the minimum value of the remaining key amount 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.

[0057] In the embodiment of the present disclosure, the minimum value of the remaining key amount of each link on the key relay path It refers to the key amount of the link with the least amount of remaining keys among all links on the key relay path, and the unit can be Mb.

[0058] In the embodiment of the present disclosure, the minimum value of the reliability metric of each link on the key relay path It refers to the reliability metric value of the link with the smallest 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 interval [0,255], where 255 indicates that the link has the highest reliability.

[0059] In the embodiment of the present disclosure, 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 perform key exchange. It is the key exchange rate of the i-th intermediate node on the key relay path, and the unit can be Mbps.

[0060] Step S402: Calculate a first ratio between a first preset parameter and a minimum value of reliability metrics of each link on the key relay path, and determine a first metric value according to the first ratio.

[0061] In the embodiment of the present disclosure, the first preset parameter Refers to the parameters pre-set according to the requirements of the QKD network. Calculate the first preset parameter The minimum reliability metric of each link on the key relay path The first ratio between , then the first ratio Add 1 to get the first metric value .

[0062] Step S403, calculating a second ratio between the second preset parameter and the minimum value of the remaining key amount of each link on the key relay path.

[0063] In the embodiment of the present disclosure, the second preset parameter Refers to the parameters preset according to the requirements of the QKD network. Calculate the second preset parameter The minimum value of the remaining key amount of each link on the key relay path The second ratio between .

[0064] Step S404, calculating the reciprocal sum of the key exchange rates of all key nodes on the key relay path, and calculating a first product between the third preset parameter and the reciprocal sum.

[0065] In the embodiment of the present disclosure, the sum of the inverse of the key exchange rate of all key nodes on the key relay path is calculated. That is, for the key exchange rate of each key node on the key relay path, calculate the inverse of the rate, and then sum the inverses of the key exchange rates of all key nodes on the key relay path to obtain the sum of the inverses of the key exchange rates of all key nodes on the key relay path. .

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

[0067] Step S405: Calculate a second metric value according to the second ratio and the first product.

[0068] In some implementations of the present disclosure, calculating the second metric value according to 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 value.

[0069] In the embodiment of the present disclosure, the second ratio With the first product Sum and get the second metric value .

[0070] Step S406: Calculate a composite routing metric of the key relay path according to the first metric and the second metric.

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

[0072]

[0073] In the routing method suitable for QKD networks provided by the embodiments of the present disclosure, factors such as the amount of remaining link keys, link reliability metrics, and key node exchange rate are taken into consideration during the evaluation of each key relay path, so that the calculated metrics can fully and accurately reflect the security, stability, and transmission efficiency of the path. This not only ensures that the selected path achieves the optimal balance in key resources, reliability, and communication efficiency, and effectively avoids the risks of resource exhaustion and communication interruption, but also can flexibly adjust the preset parameters according to actual needs to adapt to different network environments and application scenarios.

[0074] In some embodiments of the present disclosure, a second metric value is calculated based on the second ratio and the first product, including: summing the second ratio and the first product to obtain a sum result; and multiplying a preset expansion factor by the sum result to obtain the second metric value.

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

[0076]

[0077] In formula (2), is the composite routing metric of the key relay path with the expansion factor introduced. Comparing formula (1) and formula (2), 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 the sum is calculated to obtain the second metric , where the recommended value for the expansion factor is 10 8 .

[0078] In the routing method suitable for QKD networks provided by the embodiments of the present disclosure, factors such as the amount of remaining link keys, link reliability and key node exchange rate are taken into consideration during the evaluation of each key relay path. An expansion factor is also introduced so that the evaluation process can 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.

[0079] In some embodiments of the present disclosure, the path evaluation parameter of the key relay path also includes: a target path evaluation parameter. The method further includes: calculating a second product between the 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.

[0080] In the disclosed embodiment, the target path evaluation parameter refers to parameters other than the minimum value of the remaining key amount 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, such as the link key generation rate 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).

[0081]

[0082] In formula (3), is the composite routing metric of the key relay path taking into account the target path evaluation parameter, other factor1 is the target path evaluation parameter, The fourth preset parameter corresponding to the target path evaluation parameter is a parameter preset according to the requirements of the QKD network.

[0083] In the disclosed embodiments, QKD nodes in the same QKD network have the same preset parameter values ​​and can be identified as neighbor nodes. Different routing behaviors are generated by setting different values ​​of the preset parameters, reflecting the specific characteristics of the QKD network and the diversified needs of the services.

[0084] In the routing method suitable for QKD networks provided by the embodiments of the present disclosure, factors such as the amount of remaining link keys, link reliability and key node exchange rate are taken into consideration during the evaluation of each key relay path. A target path evaluation parameter is also introduced, so that the evaluation process can 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.

[0085] It should be noted that when calculating the composite routing metric value of each key relay path, the embodiment of the present disclosure takes into account factors such as the remaining link key amount, link reliability and key node exchange rate, and can also introduce expansion factors and target path evaluation parameters at the same time, which is not limited by the embodiment of the present disclosure.

[0086] Figure 5 A process diagram for determining a target key relay path in an embodiment of the present disclosure is shown. Figure 5 The invention shows a process of determining a target key relay path from multiple key relay paths according to the composite routing metric values ​​of all key relay paths in the multiple key relay paths, which specifically includes the following steps.

[0087] Step S501: Select a minimum routing metric from the composite routing metric values ​​of all key relay paths in a plurality of key relay paths.

[0088] After the composite metric of each key relay path is calculated, the composite metric of all key relay paths is compared, and the minimum routing metric min metric is selected therefrom.

[0089] Step S502: Calculate a routing metric reference value according to preset path parameter information and a minimum routing metric value.

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

[0091] Step S503: Select a 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 a target key relay path.

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

[0093] In the routing method applicable to the QKD network provided by the embodiment of the present disclosure, preset path parameter information is introduced and multiplied with the minimum routing metric value to calculate the routing metric reference value. This step enhances the flexibility of routing selection and can dynamically adjust the routing metric reference value according to actual needs and the status of the QKD network; the key relay path with a composite routing metric value less than or equal to the routing metric reference value is selected as the target path, which ensures the performance superiority of the selected path, improves the accuracy of routing selection, and enhances the adaptability and flexibility of the network, which helps to improve the performance and security of the overall network.

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

[0095] Figure 6 A flow chart showing a method for processing key relay traffic in an embodiment of the present disclosure. Figure 6 It shows how to split the key relay traffic when there are multiple target key relay paths, which specifically includes the following steps.

[0096] Step S610, after receiving the key relay request, determine the traffic balancing method according to the composite routing metric values ​​of multiple target key relay paths.

[0097] In the disclosed embodiment, if the number of target key relay paths is one, the key relay traffic is allocated to the target relay path for transmission.

[0098] In an embodiment of the present disclosure, if there are multiple target key relay paths, the multiple target key relay paths are analyzed to determine a traffic balancing method, and the traffic is subsequently distributed and transmitted based on the traffic balancing method. In some embodiments of the present disclosure, the traffic balancing method is determined according to the composite routing metric values ​​of the multiple target key relay paths, including: 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, 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, determining that the traffic balancing method is non-equal-cost load balancing.

[0099] In the embodiment of the present disclosure, if the composite routing metrics of multiple target key relay paths are the same, it means that these paths are equivalent in transmission efficiency and security, and the key relay traffic can be evenly distributed to these paths to achieve equal-cost load balancing. Based on this, when the composite routing metrics of multiple target key relay paths are the same, the traffic balancing method is determined to be equal-cost load balancing.

[0100] In the embodiment of the present disclosure, if the composite routing metrics of multiple target key relay paths are different, it means that these paths have differences in transmission efficiency and security, and the key relay traffic can be allocated according to these differences to achieve non-equivalent load balancing. Based on this, when the composite routing metrics of multiple target key relay paths are different, the traffic balancing method is determined to be non-equivalent load balancing.

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

[0102] 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 to ensure that each path bears the same traffic load, avoiding the situation where some paths are overloaded while other paths are idle.

[0103] Step S630: If the traffic balancing method is non-equivalent load balancing, the traffic distribution ratio is determined according to the minimum value of the remaining key amount of each link on multiple target key relay paths, and the key relay traffic is distributed to multiple target key relay paths for transmission according to the traffic distribution ratio.

[0104] If the traffic balancing method is determined to be non-equivalent load balancing, the traffic distribution ratio is determined based on the minimum value of the remaining key amount of each link on each target key relay path. In other words, the traffic ratio that each target key relay path should bear is calculated based on the minimum value of the remaining key amount of each link on each target key relay path. This ratio is proportional to the quality of the path, so that a better key relay path will bear more traffic.

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

[0106] In the routing method applicable to the QKD network provided by the embodiment of the present disclosure, the composite routing metric value of the target key relay path is taken into account, and two key relay traffic segmentation methods, namely, equivalent load balancing and non-equivalent load balancing, are provided. In the non-equivalent load balancing segmentation method, the traffic distribution ratio is determined according to the remaining key amount, thereby improving the key resource utilization on the key relay path link, avoiding the exhaustion of key resources on a single path, and improving the robustness and fault tolerance of the QKD network.

[0107] To facilitate understanding, specific embodiments are provided to illustrate the routing method and traffic segmentation method applicable to the QKD network of the embodiments of the present disclosure.

[0108] After the QKD network deployment is completed and the equipment is started, the QKD network controller can obtain the topology of the QKD network from the QKD network management system. The QKD network management system sends QLSA update packages to the QKD network controller at certain time intervals. In addition, when the QKD network management system detects changes in the network status, such as the QKD device being offline or the QKD network link status changing, it will also send a QLSA update package to the QKD controller. The QLSA update package contains the remaining key amount of the link, the key exchange rate of the node, the link reliability, and other content. The QKD network controller is responsible for maintaining the link status database of the entire network, which records the QKD network topology information as shown in the figure below. Figure 7 shown.

[0109] Figure 7 FIG. 2 shows a QKD network topology information diagram maintained by the QKD network controller in an embodiment of the present disclosure. Figure 7 As shown, the QKD network includes 8 QKD nodes, namely A, B, C, D, E, F, G and H, node A is the source key node and node D is the destination key node.

[0110] Among them, the remaining key amount of the link between node A and node B is 200Mb, and the reliability measurement value is 255; the remaining key amount of the link between node B and node C is 100Mb, and the reliability measurement value is 192; the remaining key amount of the link between node C and node D is 160Mb, and the reliability measurement value is 255; the remaining key amount of the link between node A and node E is 80Mb, and the reliability measurement value is 200; the remaining key amount of the link between node E and node D is 180Mb, and the reliability measurement value is 222 ; The remaining key amount of the link between node A and node F is 100Mb, and the reliability measurement value is 215; the remaining key amount of the link between node F and node D is 150Mb, and the reliability measurement value is 240; the remaining key amount of the link between node A and node G is 200Mb, and the reliability measurement value is 200; the remaining key amount of the link between node G and node H is 220Mb, and the reliability measurement value is 246; the remaining key amount of the link between node H and node D is 180Mb, and the reliability measurement value is 255.

[0111] 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.

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

[0113] When determining the target key relay path among multiple key relay paths, assuming that the preset multipath parameter information variance=3, all paths whose path composite metric values ​​are 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 target key relay paths and updated to the routing table of the QKD network controller as the basis for key relay.

[0114] Since the composite routing metrics of the three paths AED, AFD, and AGHD are different, when performing key relay, the key relay traffic is divided according to the Specifically, the path AED , path AFD , path AGHD The ratio of key relay traffic on these three paths is 4:5:9. According to this traffic ratio, the key relay traffic is distributed to these three paths for transmission.

[0115] In the routing method applicable to the QKD network provided by the embodiment of the present disclosure, factors such as the amount of remaining key in the link, the key exchange rate of the node, and the reliability of the link are taken into account, and the composite routing metric value of the key relay path in the QKD network is defined, thereby improving the routing accuracy. In addition, corresponding preset parameters can be set when calculating the composite routing metric value of the key relay path, and the routing principle can be flexibly determined according to the specific characteristics of the QKD network and the diversified needs of the business. In addition, when performing key relay, the composite routing metric value of the path is taken into account, and two key relay traffic segmentation methods of equivalent load balancing and non-equivalent load balancing are given, and in the non-equivalent load balancing segmentation method, the traffic distribution ratio is determined according to the remaining key amount, thereby improving the utilization rate of key resources on the key relay path link, avoiding the exhaustion of key resources on a single path, and improving the robustness and fault tolerance of the QKD network.

[0116] Based on the same inventive concept, the present disclosure also provides a routing device suitable for a QKD network in the following embodiments. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0117] Figure 8 FIG. 2 shows a structural block diagram of a routing device suitable for a QKD network in an embodiment of the present disclosure. Figure 8 As shown, the device includes: a node determination module 810, a path acquisition module 820, a metric value calculation module 830 and a path determination module 840.

[0118] 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 according to the topology information of the QKD network. The metric calculation module 830 is configured to calculate the composite routing metric of the key relay path for each key relay path in the multiple key relay paths according to the path evaluation parameters of the key relay path. The path evaluation parameters of the key relay path include the minimum value of the remaining key amount 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. The path determination module 840 is configured to determine the target key relay path from the multiple key relay paths according to the composite routing metric of all key relay paths in the multiple key relay paths.

[0119] In some embodiments of the present disclosure, the metric calculation module 830 is also configured to: obtain the minimum value of the remaining key amount 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 a second ratio between a second preset parameter and the minimum value of the remaining key amount of each link on the key relay path; calculate the reciprocal sum 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 reciprocal sum; calculate a second metric value based on the second ratio and the first product; and calculate a composite routing metric value of the key relay path based on the first metric value and the second metric value.

[0120] In some embodiments of the present disclosure, the metric value 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.

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

[0122] In some embodiments of the present disclosure, the path evaluation parameter of the key relay path also includes: a target path evaluation parameter. The metric value calculation module 830 is further configured to: calculate a second product between the 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.

[0123] In some embodiments of the present disclosure, the path determination module 840 is further configured to: select a minimum routing metric value from the composite routing metric values ​​of all key relay paths in multiple 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 multiple key relay paths as the target key relay path.

[0124] In some embodiments of the present disclosure, the number of target key relay paths is multiple. Figure 8 As shown, the device 800 also includes a traffic processing module 850, which is configured to: after receiving a key relay request, determine the traffic balancing method according to the composite routing metric value of multiple target key relay paths; if the traffic balancing method is equal-cost load balancing, then evenly distribute the key relay traffic to multiple target key relay paths for transmission; if the traffic balancing method is non-equal-cost load balancing, then determine the traffic distribution ratio according to the minimum value of the remaining key amount of each link on the multiple target key relay paths, and distribute the key relay traffic to multiple target key relay paths for transmission according to the traffic distribution ratio.

[0125] In some embodiments of the present disclosure, the traffic processing module 850 is also 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 unequal-cost load balancing.

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

[0127] Those skilled in the art will appreciate that various aspects of the present disclosure may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or an implementation that combines hardware and software aspects, which may be collectively referred to herein as a "circuit," "module," or "system."

[0128] Based on the same inventive concept, an electronic device is also provided in an embodiment of the present disclosure, the electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute any of the above-mentioned routing methods applicable to the QKD network by executing the executable instructions. Since the principle of solving the problem in the electronic device embodiment is similar to that in the above-mentioned method embodiment, the implementation of the electronic device embodiment can refer to the implementation of the above-mentioned method embodiment, and the repeated parts will not be repeated.

[0129] Refer to the following Fig. 9 The electronic device 900 according to this embodiment of the present disclosure is described. Fig. 9 The electronic device 900 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0130] like Fig. 9 As shown, the electronic device 900 is in the form of a general 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 the storage unit 920 and the processing unit 910).

[0131] The storage unit stores a program code, and the program code can be executed by the processing unit 910, so that the processing unit 910 executes the steps according to various exemplary embodiments of the present disclosure described in the above "Exemplary Method" section of this specification. For example, the processing unit 910 can execute 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 according to the topology information of the QKD network; step S330, for each key relay path in the multiple key relay paths, according to the path evaluation parameters of the key relay path, calculating the composite routing metric value of the key relay path, wherein the path evaluation parameters of the key relay path include: the minimum value of the remaining key amount 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, according to the composite routing metric value of all key relay paths in the multiple key relay paths, determining the target key relay path from the multiple key relay paths.

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

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

[0134] Bus 930 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0135] The electronic device 900 may also communicate with one or more external devices 940 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 900, and / or communicate with any device that enables the electronic device 900 to communicate with one or more other computing devices (e.g., routers, modems, etc.). This communication may be performed through an input / output (I / O) interface 950. In addition, the electronic device 900 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter 960. As shown, the network adapter 960 communicates with other modules of the electronic device 900 through a bus 930. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the 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, etc.

[0136] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation 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 drive, a mobile hard disk, etc.) or on a network, and includes a number of instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0137] Based on the same inventive concept, a computer-readable storage medium is also provided in the embodiment of the present disclosure, on which a computer program is stored, and when the computer program is executed by a processor, any of the above-mentioned routing methods applicable to a QKD network is implemented. Since the principle of solving the problem in the embodiment of the computer-readable storage medium is similar to that in the above-mentioned method embodiment, the implementation of the embodiment of the computer-readable storage medium can refer to the implementation of the above-mentioned method embodiment, and the repeated parts will not be repeated.

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

[0139] In the present disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0140] Alternatively, the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0141] In specific implementation, the program code for performing the operation of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" language or similar programming languages. The program code may 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 of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet).

[0142] Based on the same inventive concept, a computer program product is also provided in the embodiments of the present disclosure, including a computer program product, including: a computer program or an instruction, wherein when the computer program or the instruction is executed by a processor, the routing method applicable to the QKD network in any one of the above method embodiments is implemented. Since the principle of solving the problem in the computer program product embodiment is similar to that in the above method embodiment, the implementation of the computer program product embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0143] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this 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. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0144] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0145] Through the description of the above implementation modes, it is easy for those skilled in the art to understand that the example implementation modes described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation mode 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 drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation mode of the present disclosure.

[0146] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A routing method suitable for a quantum key distribution network, characterized in that: include: Determining a source key node and a destination key node in the quantum key distribution network; Acquire 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 of the plurality of key relay paths, calculating a composite routing metric value of the key relay path according to a path evaluation parameter of the key relay path; The path evaluation parameters of the key relay path include: the minimum value of the remaining key amount 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; A target key relay path is determined from the multiple key relay paths according to the composite routing metric values ​​of all the key relay paths in the multiple key relay paths.

2. The method according to claim 1, characterized in that: The calculating the composite routing metric value of the key relay path according to the path evaluation parameter of the key relay path includes: Obtaining a minimum value of the amount of remaining keys of each link on the key relay path, a minimum value of the reliability metric of each link on the key relay path, and a key exchange rate of all key nodes on the key relay path; Calculating a first ratio between a first preset parameter and a minimum value of reliability metrics of each link on the key relay path, and determining a first metric value according to the first ratio; Calculating a second ratio between a second preset parameter and a minimum value of the amount of remaining keys of each link on the key relay path; Calculating the reciprocal sum 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 reciprocal sum; Calculating a second metric value according to the second ratio and the first product; A composite routing metric of the key relay path is calculated according to the first metric and the second metric.

3. The method according to claim 2, characterized in that The calculating a second metric value according to the second ratio and the first product includes: Summing the second ratio and the first product to obtain a summation result; The summation result is determined as the second metric value.

4. The method according to claim 2, characterized in that: The calculating a second metric value according to the second ratio and the first product includes: Summing the second ratio and the first product to obtain a summation result; A preset expansion factor is multiplied by the summation result to obtain the second metric value.

5. The method according to any one of claims 2 to 4, characterized in that: The path evaluation parameters of 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 be combined with the second ratio and the first product to jointly calculate the second metric value.

6. The method according to claim 1, characterized in that Determining a target key relay path from the multiple key relay paths according to the composite routing metrics of all the key relay paths in the multiple key relay paths comprises: Selecting a minimum routing metric value from the composite routing metric values ​​of all the key relay paths in the multiple key relay paths; Calculating a routing metric reference value according to the preset path parameter information and the minimum routing metric value; From the multiple key relay paths, a 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.

7. The method according to claim 1, characterized in that The number of the target key relay paths is multiple; Wherein, the method further comprises: After receiving the key relay request, determining a traffic balancing method according to the composite routing metric values ​​of the plurality of target key relay paths; If the traffic balancing method is equal-cost load balancing, the key relay traffic is evenly distributed to a plurality of target key relay paths for transmission; If the traffic balancing method is non-equivalent load balancing, the traffic distribution ratio is determined according to the minimum value of the remaining key amount of each link on the multiple target key relay paths, and the key relay traffic is distributed to the multiple target key relay paths for transmission according to the traffic distribution ratio.

8. The method according to claim 7, characterized in that Determining the traffic balancing method according to the composite routing metric values ​​of the plurality of target key relay paths includes: Determining whether the composite routing metric values ​​of the plurality of target key relay paths are the same; If the composite routing metrics of the plurality of target key relay paths are the same, determining that the traffic balancing mode is equal-cost load balancing; If the composite routing metrics of the plurality of target key relay paths are different, it is determined that the traffic balancing mode is non-equal-cost load balancing.

9. A routing device suitable for a quantum key distribution network, characterized in that: include: A node determination module, configured to determine a source key node and a destination key node in the quantum key distribution network; A path acquisition module, configured to acquire 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; a metric value calculation module configured to calculate, for each key relay path in the plurality of key relay paths, a composite routing metric value of the key relay path according to a path evaluation parameter of the key relay path; The path evaluation parameters of the key relay path include: the minimum value of the remaining key amount 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; The path determination module is configured to determine a target key relay path from the multiple key relay paths according to the composite routing metric values ​​of all the key relay paths in the multiple key relay paths.

10. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the routing method applicable to a quantum key distribution network as described in any one of claims 1 to 8 by executing the executable instructions.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the routing method applicable to a quantum key distribution network as described in any one of claims 1 to 8 is implemented.

12. A computer program product comprising: A computer program or instruction, characterized in that when the computer program or instruction is executed by a processor, it implements the routing method applicable to a quantum key distribution network as described in any one of claims 1 to 8.

Images