Quantum key distribution relay path determination method, device and system and medium

By determining the priority of the candidate path in the quantum key distribution network and selection of the highest priority path, the problem of difficulty in responding to the dynamic changes of the relay link and the dynamic changes in the network environment, improved the success rate and efficiency of key distribution Essence

CN119341739APending Publication Date: 2025-01-21CHINA TELECOM QUANTUM TECH CO LTD

Patent Information

Application Number
CN202411363572.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-27
Publication Date
2025-01-21

AI Technical Summary

Technical Problem

In the existing quantum key distribution technology, the performance of the relay link and dynamic changes in the network environment are difficult to respond in real time, resulting in the impact of the key distribution efficiency and success rate.

Method used

By determining the status parameters of the candidate path and the relay link in the quantum key to distribute, calculate the priority of the candidate path, and select the highest priority path as the target path to adapt to the dynamic changes of network conditions.

Benefits of technology

It improves the success rate and efficiency of quantum key distribution, ensuring that the routing strategy can be adjusted in time when network congestion or conditions fluctuate, and the optimal path can be selected for key distribution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119341739A_ABST
    Figure CN119341739A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a quantum key distribution relay path determination method, device and system and a medium, and the method comprises the steps: determining a source node and a destination node of quantum key distribution from a routing calculation request after the routing calculation request of key sending equipment of a quantum key distribution network is received; determining candidate paths for quantum key distribution and the number of relay links of the candidate paths according to the source node and the destination node, and obtaining state parameters of the relay links of the candidate paths; determining the priority of the candidate path according to the number of the relay links of the candidate path and the state parameters of the relay links; according to the method, the candidate path with the highest priority is used as the target path for quantum key distribution, so that the optimal path in the candidate paths can be selected for quantum key distribution according to the state of the relay link of the quantum key distribution network, and the quantum key distribution efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of quantum communication and network security technology, and in particular to a method, device, system, equipment and medium for determining a quantum key distribution relay path. Background Art

[0002] In order to solve the problem that the communication distance of QKD (Quantum Key Distribution) technology is limited due to the attenuation and noise of the quantum channel, relay nodes are introduced into QKD technology. However, the quantum key distribution path formed by the existing relay link is difficult to adapt to the dynamically changing network conditions, which leads to the efficiency and success rate of key distribution being affected when the network is congested or the conditions fluctuate. Moreover, the existing quantum key distribution path lacks the ability to respond in real time to the dynamic changes of the network environment and cannot adjust the routing strategy in time, which also affects the efficiency of key distribution. In addition, in a high-density QKD network, the performance of the relay node may also become a limiting factor affecting the transmission efficiency of the key data. There are still challenges in the existing technology when applying relay nodes to quantum key distribution networks. Summary of the invention

[0003] In order to solve the above problems, the embodiments of the present invention disclose a method, apparatus, system, device and medium for determining a quantum key distribution relay path.

[0004] In a first aspect, an embodiment of the present invention provides a method for determining a quantum key distribution relay path, the method comprising:

[0005] After receiving a route calculation request from a key sending device of a quantum key distribution network, determining a source node and a destination node of the quantum key distribution from the route calculation request;

[0006] Determine, according to the source node and the destination node, a candidate path for quantum key distribution and the number of relay links of the candidate path, and obtain state parameters of the relay links of the candidate path;

[0007] Determining the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links;

[0008] The candidate path with the highest priority is selected as the target path for quantum key distribution.

[0009] Optionally, the state parameter of the relay link includes at least one of a key remaining amount, a key generation rate, a key consumption rate, a network delay, and a predicted congestion probability, and determining the priority of the candidate path according to the number of relay links of the candidate path and the state parameter of the relay link includes:

[0010] Determining a key indicator of the relay link according to the remaining key amount, the key generation rate, and the key consumption rate;

[0011] Determining a network indicator of the relay link according to the network delay and the predicted congestion probability;

[0012] Determining a path length indicator of the candidate path according to the number of the relay links;

[0013] The weight coefficient of the candidate path is obtained, and the priority of the candidate path is determined according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path.

[0014] Optionally, determining the key indicator of the relay link according to the remaining key amount, the key generation rate, and the key consumption rate includes:

[0015] Acquire a key potential impact parameter and a preset key remaining amount of the relay link;

[0016] Determining a key potential index of the relay link according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter;

[0017] The key index of the relay link is determined according to the key potential index and the preset key remaining amount.

[0018] Optionally, according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter, the key potential index of the relay link is determined according to the following formula:

[0019] T x =K x +(G x -C x )×Δ t

[0020] Where x is the relay link, x∈R,T x is the key potential index of relay link x, K x is the remaining key amount of relay link x, G x is the key generation rate of relay link x, C x is the key consumption rate of relay link x, Δ t Potential impact parameters for keys;

[0021] According to the key potential index and the remaining amount of the preset key, the key index of the relay link is determined according to the following formula:

[0022]

[0023] Among them, E x is the key index of relay link x, K max The remaining amount of preset keys.

[0024] Optionally, determining the network indicator of the relay link according to the network delay and the predicted congestion probability includes:

[0025] Obtain a network delay impact parameter, and determine the network indicator of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter according to the following formula:

[0026]

[0027] Among them, N x is the network index of relay link x, α is the network delay impact parameter, D x is the network delay of relay link x, P x is the predicted congestion probability of relay link x.

[0028] Optionally, determining the path length indicator of the candidate path according to the number of the relay links includes:

[0029] Obtain a path length influencing parameter, and determine the path length index of the candidate path according to the number of the relay links and the path length influencing parameter according to the following formula:

[0030] L R =e -β×d

[0031] Among them, R is the candidate path, L R is the path length indicator of the candidate path R, β is the path length influence parameter, and d is the number of relay links of the candidate path R.

[0032] Optionally, the weight coefficient of the candidate path includes at least one of a key weight coefficient, a network weight coefficient and a length weight coefficient, and determining the priority of the candidate path according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path includes:

[0033] According to the weight coefficient of the candidate path, the key index of the relay link, the network index of the relay link and the path length index of the candidate path, the priority of the candidate path is determined according to the following formula:

[0034]

[0035] Among them, S R is the priority of candidate path R, w E is the key weight coefficient, w N is the network weight coefficient, w L is the length weight coefficient.

[0036] In a third aspect, an embodiment of the present invention provides a quantum key distribution relay path determination system, the system comprising: a quantum key distribution service device and a quantum key distribution network; the quantum key distribution network comprises a key sending device, a key receiving device, and at least one relay node device;

[0037] The quantum key distribution service device is used to determine the source node and destination node of the quantum key distribution from the route calculation request after receiving the route calculation request from the key sending device of the quantum key distribution network; determine the candidate path of the quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links; and use the candidate path with the highest priority as the target path of the quantum key distribution;

[0038] The key sending device is used to send a route calculation request to the quantum key distribution service device, receive a target path for quantum key distribution sent by the quantum key distribution service device, and send a quantum key to a relay node device in the target path;

[0039] The relay node device is configured to receive the quantum key sent by the key sending device according to the target path, and send the quantum key to the key receiving device;

[0040] The key receiving device is used to receive the quantum key sent by the relay node device.

[0041] In a third aspect, an embodiment of the present invention provides a device for determining a quantum key distribution relay path, the device comprising:

[0042] A path node determination module, configured to determine a source node and a destination node of quantum key distribution from the route calculation request after receiving a route calculation request from a key sending device of the quantum key distribution network;

[0043] A link parameter acquisition module, used to determine the candidate paths for quantum key distribution and the number of relay links of the candidate paths according to the source node and the destination node, and to acquire the state parameters of the relay links of the candidate paths;

[0044] A candidate path sorting module, used to determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links;

[0045] The target path determination module is used to select the candidate path with the highest priority as the target path for quantum key distribution.

[0046] Optionally, the state parameter of the relay link includes at least one of a remaining key amount, a key generation rate, a key consumption rate, a network delay, and a predicted congestion probability, and the candidate path sorting module includes:

[0047] A key index determination submodule, used to determine the key index of the relay link according to the remaining key amount, the key generation rate and the key consumption rate;

[0048] A network indicator determination submodule, used to determine the network indicator of the relay link according to the network delay and the predicted congestion probability;

[0049] A path length index determination submodule, used to determine the path length index of the candidate path according to the number of the relay links;

[0050] The candidate path sorting module submodule is used to obtain the weight coefficient of the candidate path and determine the priority of the candidate path according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path.

[0051] Optionally, the key indicator determination submodule includes:

[0052] A key indicator parameter acquisition unit, used to acquire a key potential impact parameter and a preset key remaining amount of the relay link;

[0053] A key potential index determination unit, configured to determine a key potential index of the relay link according to the remaining key amount, the key generation rate, the key consumption rate and the key potential influencing parameter;

[0054] The key index determination unit is used to determine the key index of the relay link according to the key potential index and the preset key remaining amount.

[0055] Optionally, according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter, the key potential index of the relay link is determined according to the following formula:

[0056] T x =K x +(G x -C x)×Δ t

[0057] Where x is the relay link, x∈R,T x is the key potential index of relay link x, K x is the remaining key amount of relay link x, G x is the key generation rate of relay link x, C x is the key consumption rate of relay link x, Δ t Potential impact parameters for keys;

[0058] According to the key potential index and the remaining amount of the preset key, the key index of the relay link is determined according to the following formula:

[0059]

[0060] Among them, E x is the key index of relay link x, K max The remaining amount of preset keys.

[0061] Optionally, the network indicator determination submodule includes:

[0062] Obtain a network delay impact parameter, and determine the network indicator of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter according to the following formula:

[0063]

[0064] Among them, N x is the network index of relay link x, α is the network delay impact parameter, D x is the network delay of relay link x, P x is the predicted congestion probability of relay link x.

[0065] Optionally, the path length indicator determination submodule includes:

[0066] Obtain a path length influencing parameter, and determine the path length index of the candidate path according to the number of the relay links and the path length influencing parameter according to the following formula:

[0067] L R =e -β×d

[0068] Among them, R is the candidate path, L R is the path length indicator of the candidate path R, β is the path length influence parameter, and d is the number of relay links of the candidate path R.

[0069] Optionally, the weight coefficient of the candidate path includes at least one of a key weight coefficient, a network weight coefficient and a length weight coefficient, and the candidate path sorting module submodule includes:

[0070] According to the weight coefficient of the candidate path, the key index of the relay link, the network index of the relay link and the path length index of the candidate path, the priority of the candidate path is determined according to the following formula:

[0071]

[0072] Among them, S R is the priority of candidate path R, w E is the key weight coefficient, w N is the network weight coefficient, w L is the length weight coefficient.

[0073] In a fourth aspect, the present invention shows an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned method for determining a quantum key distribution relay path when executing the computer program.

[0074] In a fifth aspect, the present invention shows a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned method for determining a quantum key distribution relay path are implemented.

[0075] The embodiments of the present invention include the following advantages:

[0076] The embodiment of the present invention can determine the source node and the destination node of quantum key distribution from the route calculation request after receiving the route calculation request of the key sending device of the quantum key distribution network; determine the candidate path of quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path, so as to monitor the state of the quantum key distribution network in real time, and fully consider the performance of the relay links between the relay nodes; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links, so as to adapt to the dynamic changes of network conditions and adjust the routing strategy in real time; take the candidate path with the highest priority as the target path of quantum key distribution, so as to select the best path among the candidate paths for quantum key distribution according to the state of the relay links of the quantum key distribution network, ensure that the best routing strategy is determined in time when the network is congested or the conditions fluctuate, and improve the success rate and efficiency of key distribution. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0078] Figure 1 It is a structural block diagram of a quantum key distribution relay path determination system according to an embodiment of the present invention;

[0079] Figure 2 It is a flowchart of the steps of a method for determining a quantum key distribution relay path according to an embodiment of the present invention;

[0080] Figure 3 is a flowchart of another method for determining a quantum key distribution relay path according to an embodiment of the present invention;

[0081] Figure 4 This is a schematic diagram of a path optimization for quantum key distribution according to an embodiment of the present invention;

[0082] Figure 5 It is a structural block diagram of a quantum key distribution relay path determination device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0083] The present invention proposes a method for determining a quantum key distribution relay path, the purpose of which is to improve the success rate and efficiency of quantum key distribution. To achieve this goal, the embodiment of the present invention selects the best path among candidate paths for quantum key distribution based on the state of the relay link of the quantum key distribution network, so that when the network is congested or the conditions fluctuate, the optimal routing strategy can be adjusted, thereby improving the success rate and efficiency of key distribution.

[0084] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0085] Reference Figure 1 , shows a structural block diagram of a quantum key distribution relay path determination system provided by an embodiment of the present invention, the system comprising: a quantum key distribution service device and a quantum key distribution network; the quantum key distribution network comprises a key sending device, a key receiving device, and at least one relay node device;

[0086] The quantum key distribution service device is used to determine the source node and destination node of the quantum key distribution from the route calculation request after receiving the route calculation request from the key sending device of the quantum key distribution network; determine the candidate path of the quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links; and use the candidate path with the highest priority as the target path of the quantum key distribution;

[0087] The key sending device is used to send a route calculation request to the quantum key distribution service device, receive a target path for quantum key distribution sent by the quantum key distribution service device, and send a quantum key to a relay node device in the target path;

[0088] The relay node device is configured to receive the quantum key sent by the key sending device according to the target path, and send the quantum key to the key receiving device;

[0089] The key receiving device is used to receive the quantum key sent by the relay node device.

[0090] In an embodiment of the present invention, a quantum key distribution relay path determination system includes a quantum key distribution service device and a quantum key distribution network; the quantum key distribution network includes a key sending device (i.e., a source node), a key receiving device (i.e., a destination node), and a plurality of relay node devices; a relay link is formed between adjacent relay nodes. The quantum key distribution service device includes: a data acquisition component, a data processing component, a data storage component, an algorithm execution component, a communication interface component, and a user interaction interface.

[0091] The data collection component is used to collect the initial data of the state parameters of the relay link in real time through the network management interface provided by the relay node device;

[0092] Data processing component, used to pre-process the initial data. The pre-processing process includes denoising, filtering outliers and noise, and using a smoothing algorithm to smooth the initial data to ensure the accuracy and real-time nature of the data, and obtain useful relay link status parameters, such as key generation rate, key consumption rate, key remaining amount, network delay, etc.

[0093] The data storage component is used to store the status parameters of the relay link and the historical records of the routing selection of the relay link for subsequent use and optimization; it also provides a data query function, and users can query historical data through the user interaction interface for analysis and optimization.

[0094] An algorithm execution component is used to determine a source node and a destination node of quantum key distribution from a route calculation request sent by a key sending device; determine a candidate path for quantum key distribution according to the source node and the destination node; determine a priority of path selection according to the number of relay links of the candidate path and the state parameters of the relay links; and use the candidate path with the highest priority as the target path for quantum key distribution;

[0095] A communication interface component is used to receive a routing calculation request from a key sending device of a quantum key distribution network, and send the target path determined by the algorithm execution component to the key sending device; the communication interface supports multiple communication protocols, including but not limited to RESTful (Representational State Transfer), SOAP (Simple Object Access Protocol), gRPC (Google Remote Procedure Call), MQTT (Message Queuing Telemetry Transport), etc.;

[0096] The user interaction interface is used to display the currently determined target path and the various indicator scores of the target path to the user; the user can input and adjust the algorithm parameters of the algorithm execution component, such as weight coefficients, optimization indicators, etc., based on the displayed results.

[0097] The quantum key distribution relay path determination system of the embodiment of the present invention can determine the target path for quantum key distribution between a key sending device and a key receiving device based on the state parameters of the relay link. The selection of the target path fully considers the performance of the relay link between relay nodes, thereby ensuring the success rate and efficiency of quantum key distribution when the network is congested or conditions fluctuate.

[0098] Reference Figure 2 , shows a flowchart of a method for determining a quantum key distribution relay path according to an embodiment of the present invention, and the method may specifically include the following steps:

[0099] Step 101, upon receiving a routing calculation request from a key sending device of a quantum key distribution network, determining a source node and a destination node of quantum key distribution from the routing calculation request;

[0100] In an embodiment of the present invention, when the communication interface component receives a routing calculation request from a key sending device of a quantum key distribution network, the algorithm execution component can determine the source node and the destination node of the quantum key distribution from the routing calculation request to determine the candidate path of the quantum key distribution and the number of relay links of the candidate path. Among them, the user node is a node in the QKD network that provides services for specific cryptographic applications.

[0101] Step 102: determining, according to the source node and the destination node, candidate paths for quantum key distribution and the number of relay links of the candidate paths, and acquiring state parameters of the relay links of the candidate paths;

[0102] In an embodiment of the present invention, the algorithm execution component can determine the source node and destination node of the quantum key distribution from the routing calculation request to determine the candidate path of the quantum key distribution and the number of relay links of the candidate path. The algorithm execution component can also obtain the state parameters of the relay link of the candidate path and the historical record of the route selection of the relay link from the data storage component, and ensure the optimality of the path selection by comprehensively considering various indicators of the quantum key distribution network. Among them, the relay link is the line connecting two relay nodes in the QKD network to realize the communication function, and the relay node is a node in the QKD network used to extend the key transmission distance.

[0103] Step 103, determining the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links;

[0104] In an embodiment of the present invention, the algorithm execution component can determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links. Specifically, the algorithm execution component can execute the dynamic routing optimization algorithm according to the state parameters of the relay links obtained after preprocessing, and calculate the key index, network index and path length index of each relay link. The algorithm execution component can calculate the priority of the candidate path according to the real-time network conditions, and select the candidate path with the highest priority as the target path of quantum key distribution according to the priority score to ensure the optimality of the path selection.

[0105] Step 104: Use the candidate path with the highest priority as the target path for quantum key distribution.

[0106] The embodiment of the present invention can determine the source node and the destination node of quantum key distribution from the route calculation request after receiving the route calculation request of the key sending device of the quantum key distribution network; determine the candidate path of quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path, so as to monitor the state of the quantum key distribution network in real time, and fully consider the performance of the relay links between the relay nodes; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links, so as to adapt to the dynamic changes of network conditions and adjust the routing strategy in real time; take the candidate path with the highest priority as the target path of quantum key distribution, so as to select the best path among the candidate paths for quantum key distribution according to the state of the relay links of the quantum key distribution network, ensure that the best routing strategy is determined in time when the network is congested or the conditions fluctuate, and improve the success rate and efficiency of key distribution.

[0107] Reference Figure 3 , shows a flowchart of another method for determining a quantum key distribution relay path according to an embodiment of the present invention, and the method may specifically include the following steps:

[0108] Step 201, upon receiving a routing calculation request from a key sending device of a quantum key distribution network, determining a source node and a destination node of quantum key distribution from the routing calculation request;

[0109] Step 202: determining, according to the source node and the destination node, candidate paths for quantum key distribution and the number of relay links of the candidate paths, and obtaining state parameters of the relay links of the candidate paths; the state parameters of the relay links include at least one of a remaining key amount, a key generation rate, a key consumption rate, a network delay, and a predicted congestion probability;

[0110] In an embodiment of the present invention, when the communication interface component receives a routing calculation request from a key sending device of a quantum key distribution network, the algorithm execution component can determine the source node and the destination node of the quantum key distribution from the routing calculation request to determine the candidate path of the quantum key distribution and the number of relay links of the candidate path. The algorithm execution component can also obtain the state parameters of the relay link of the candidate path and the historical record of the route selection of the relay link from the data storage component; the state parameters of the relay link include at least one of the remaining key amount, the key generation rate, the key consumption rate, the network delay, and the predicted congestion probability. By comprehensively considering various indicators of the quantum key distribution network, the optimality of the path selection is ensured. Among them, the remaining key amount indicates the number of quantum keys that have not been used or can be further distributed between nodes, the key generation rate refers to the rate at which new keys are generated between nodes, the key consumption rate indicates the rate at which keys are used or distributed between nodes, the network delay indicates the delay in the time required for key data to be transmitted between relay links, and the predicted congestion probability is used to predict the probability that the network may be congested at some point in the future.

[0111] Step 203, determining a key indicator of the relay link according to the remaining key amount, the key generation rate and the key consumption rate;

[0112] In one embodiment, the step of determining the key indicator of the relay link according to the remaining key amount, the key generation rate and the key consumption rate may further include the following sub-steps:

[0113] Sub-step S11, obtaining a key potential impact parameter and a preset key remaining amount of the relay link;

[0114] Sub-step S12, determining a key potential index of the relay link according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter;

[0115] The key potential index of the relay link is obtained according to the following formula:

[0116] T x =K x +(G x -C x )×Δ t

[0117] Where x is the relay link, x∈R,T x is the key potential index of relay link x, K x is the remaining key amount of relay link x, G x is the key generation rate of relay link x, C x is the key consumption rate of relay link x, Δ tPotential impact parameters for keys;

[0118] In the embodiment of the present invention, the algorithm execution component can determine the key potential index of the relay link according to the key remaining amount, key generation rate, key consumption rate and key potential impact parameter. Among them, the key potential impact parameter Δ t Used to adjust the key generation rate G in the calculation of key indicators x and the key consumption rate C x Net impact; Key potential indicator T x It can be understood as the preset remaining key amount of relay link x within a certain period of time after considering key generation and consumption.

[0119] Sub-step S13, determining the key index of the relay link according to the key potential index and the preset key remaining amount.

[0120] The key index of the relay link is obtained according to the following formula:

[0121]

[0122] Among them, E x is the key index of relay link x, K max The remaining amount of preset keys.

[0123] In the embodiment of the present invention, the algorithm execution component can determine the key index of the relay link according to the remaining key amount, the key generation rate and the key consumption rate. Specifically, firstly, the key potential index of the relay link is determined according to the remaining key amount, the key generation rate, the key consumption rate and the key potential influencing parameter, and then the key index of the relay link is determined according to the key potential index and the preset remaining key amount.

[0124] Among them, the preset key remaining amount K max is a normalization factor used to ensure that the key index E x The value of is between 0 and 1, the key index E x The specific value of can be determined according to the actual application scenario and the range of key state changes. Key potential index T x As the key indicator E x The numerator in the calculation comprehensively considers the current remaining key amount of relay link x and the key resources that can be obtained through key generation and consumption in the future. x Greater than K max , indicating that the key resource status of relay link x is very sufficient, and the maximum value is 1. If it is not greater than 0, it indicates that the key resource of relay link x is insufficient to support effective communication, and the minimum value is 0. In other cases, E x It is T x With K maxThe ratio reflects the ratio of the key resource status of relay link x to the preset remaining key amount of the maximum resource in the system.

[0125] Step 204, determining a network indicator of the relay link according to the network delay and the predicted congestion probability;

[0126] In one embodiment, the step of determining the network indicator of the relay link according to the network delay and the predicted congestion probability may further include the following sub-steps:

[0127] Obtain a network delay impact parameter, and determine the network indicator of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter according to the following formula:

[0128]

[0129] Among them, N x is the network index of relay link x, α is the network delay impact parameter, D x is the network delay of relay link x, P x is the predicted congestion probability of relay link x.

[0130] In the embodiment of the present invention, the algorithm execution component can determine the network index of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter. Among them, the network delay impact parameter α is a weight parameter used to adjust the network delay D x The impact on the priority of candidate paths, in the network index N x In the calculation of , it controls the degree of attenuation of delay on priority. Network indicator N x Taking into account the network delay D of the relay link x x and predicted congestion probability P x , using an exponential decay function To represent the impact of network delay on the priority of candidate paths.

[0131] Step 205, determining a path length indicator of the candidate path according to the number of the relay links;

[0132] In one embodiment, the step of determining the path length indicator of the candidate path according to the number of the relay links may further include the following sub-steps:

[0133] Obtain a path length influencing parameter, and determine the path length index of the candidate path according to the number of the relay links and the path length influencing parameter according to the following formula:

[0134] L R =e -β×d

[0135] Among them, R is the candidate path, L R is the path length indicator of the candidate path R, β is the path length influence parameter, and d is the number of relay links of the candidate path R.

[0136] In an embodiment of the present invention, the algorithm execution component can determine the path length index of the candidate path according to the number of relay links and the path length influencing parameter. Among them, the path length influencing parameter β is a weight parameter used to adjust the influence of the path length (the number of relay links d) on the priority of the candidate path R. In the calculation of the path length index, it controls the attenuation degree of the path length on the candidate path priority. The path length index also uses an exponential decay function to represent the influence of the path length on the candidate priority.

[0137] Step 206, obtaining the weight coefficient of the candidate path, and determining the priority of the candidate path according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path;

[0138] In one embodiment, the weight coefficient of the candidate path includes at least one of a key weight coefficient, a network weight coefficient, and a length weight coefficient, and the priority of the candidate path is obtained according to the following formula:

[0139]

[0140] Among them, S R is the priority of candidate path R, w E is the key weight coefficient, w N is the network weight coefficient, w L is the length weight coefficient.

[0141] In an embodiment of the present invention, the algorithm execution component can determine the priority of the candidate path based on the weight coefficient of the candidate path, the key index of the relay link, the network index of the relay link and the path length index of the candidate path. The priority of the candidate path combines the influence of the key index (key validity), the network index (network efficiency) and the path length index. For the key index, the key index of all relay links on the candidate path is summed and averaged to reflect the key status of the entire candidate path. For the network index, the product of the network index of all relay links is calculated to characterize that the low efficiency of any relay link may seriously affect the efficiency of the entire candidate path. The weight coefficient of the candidate path can be adjusted according to the actual situation to reflect the relative importance of different factors.

[0142] The algorithm execution component of the embodiment of the present invention can execute a dynamic routing optimization algorithm based on the state parameters of the relay link obtained after preprocessing, calculate the key index, network index and path length index of each relay link, and then determine the priority of the candidate path according to the weight coefficient of the candidate path. The algorithm execution component calculates the priority of the candidate path according to the real-time network conditions, and selects the candidate path with the highest priority as the target path of quantum key distribution according to the priority score, which can ensure the optimality of path selection, thereby improving the success rate and efficiency of key distribution.

[0143] Step 207: Use the candidate path with the highest priority as the target path for quantum key distribution.

[0144] The embodiment of the present invention can determine the source node and destination node of quantum key distribution from the route calculation request after receiving the route calculation request of the key sending device of the quantum key distribution network; determine the candidate path of quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path, so as to monitor the state of the quantum key distribution network in real time, and comprehensively consider multiple indicators such as the key remaining amount, key generation rate, key consumption rate, network delay, predicted congestion probability, etc. of the relay link; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay link, so as to adapt to the dynamic changes of network conditions, adjust the routing strategy in real time, and support the user to input parameter adjustment and result viewing; take the candidate path with the highest priority as the target path of quantum key distribution, so as to select the best path among the candidate paths for quantum key distribution according to the state of the relay links of the quantum key distribution network, ensure that the best routing strategy is determined in time when the network is congested or the conditions fluctuate, and improve the success rate and efficiency of key distribution.

[0145] Reference Figure 4 , shows a schematic diagram of a preferred path for quantum key distribution provided by an embodiment of the present invention. In order to enable those skilled in the art to better understand the embodiment of the present invention, the following is a schematic diagram of a preferred path for quantum key distribution provided by an embodiment of the present invention. Figure 4 Embodiments of the present invention are described.

[0146] exist Figure 4 There are four quantum networks in the system, each of which contains a quantum network edge node and at least two quantum key service nodes, where A represents the quantum network edge node and N represents the quantum key service node. Assuming that N1 is the source node and N9 is the destination node, the candidate paths for quantum key distribution may include: candidate path 1, N1-A1-A2-A4-N9 ( Figure 4 Candidate path 2, N1-A1-A3-A4-N9 ( Figure 4The number of relay links of candidate path 1 and candidate path 2 is 3.

[0147] Assume that the weight coefficients and optimization indicators of the candidate paths are as follows: Key weight coefficient w E =0.3; network weight coefficient w N =0.3; length weight coefficient w L =0.4; key potential influence parameter Δ t =10; preset key remaining amount K max =20; network delay influence parameter α=0.5; path length influence parameter β=0.2.

[0148] Assume that the state parameters of the relay link x of the candidate path R are as follows, R∈[1,2], x∈[1,6]:

[0149] Candidate Path 1:

[0150] Relay link 1: K1=10, G1=1, C1=0.6, D1=0.3, P1=0.05;

[0151] Relay link 2: K2=8, G2=1, C2=0.5, D2=0.2, P2=0.03;

[0152] Relay link 3: K3=5, G3=2, C3=1, D3=0.1, P3=0.02.

[0153] Candidate Path 2:

[0154] Relay link 4: K4=10, G4=2, C4=1.5, D4=0.3, P4=0.05;

[0155] Relay link 5: K5=8, G5=2.5, C5=2, D5=0.2, P5=0.03;

[0156] Relay link 6: K6=5, G6=2, C6=1.5, D6=0.1, P6=0.02.

[0157] The calculation process of the candidate path priority is as follows:

[0158] 1) Key index E of relay link x x :

[0159] Relay link 1:

[0160] Relay link 2:

[0161] Relay link 3:

[0162] Relay link 4:

[0163] Relay link 5:

[0164] Relay link 6:

[0165] 2) Network index N of relay link x x :

[0166] Relay link 1: N1 = e -0.5*0.3 *(1-0.05)≈0.818;

[0167] Relay link 2: N2 = e -0.5*0.2 *(1-0.03)≈0.878;

[0168] Relay link 3: N3 = e -0.5*0.1 *(1-0.02)≈0.932;

[0169] Relay link 4: N4 = e -0.5*0.3 *(1-0.05)≈0.818;

[0170] Relay link 5: N5 = e -0.5*0.2 *(1-0.03)≈0.878;

[0171] Relay link 6: N6 = e -0.5*0.1 *(1-0.02)≈0.932.

[0172] 3) Path length index L of candidate path R R :

[0173] Candidate path 1: L1 = e -0.2*3 ≈0.549; Candidate path 2: L2 = e -0.2*3 ≈0.549.

[0174] 4) The priority S of the candidate path R R :

[0175] Candidate Path 1:

[0176]

[0177] Candidate Path 2:

[0178]

[0179] From the above analysis, it can be seen that the priority score of candidate path 1 is 0.6304, and the priority score of candidate path 1 is 0.6104, which indicates that candidate path 1 has a higher priority under the comprehensive consideration of key validity, network efficiency and path length. Therefore, candidate path 1 can be used as the target path for quantum key distribution.

[0180] The embodiment of the present invention can determine the source node and destination node of quantum key distribution from the route calculation request after receiving the route calculation request of the key sending device of the quantum key distribution network; determine the candidate path of quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path, so as to monitor the state of the quantum key distribution network in real time, and comprehensively consider multiple indicators such as the key remaining amount, key generation rate, key consumption rate, network delay, predicted congestion probability, etc. of the relay link; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay link, so as to adapt to the dynamic changes of network conditions and adjust the routing strategy in real time; take the candidate path with the highest priority as the target path of quantum key distribution, so as to select the best path among the candidate paths for quantum key distribution according to the state of the relay links of the quantum key distribution network, ensure that the best routing strategy is determined in time when the network is congested or the conditions fluctuate, and improve the success rate and efficiency of key distribution.

[0181] It should be noted that, for the sake of simplicity, the method embodiments are described as a series of action combinations, but those skilled in the art should be aware that the embodiments of the present invention are not limited by the order of the actions described, because according to the embodiments of the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present invention.

[0182] Reference Figure 5 , shows a structural block diagram of a quantum key distribution relay path determination device provided by an embodiment of the present invention, which may specifically include the following modules:

[0183] A path node determination module 301 is used to determine a source node and a destination node of quantum key distribution from the route calculation request after receiving a route calculation request from a key sending device of a quantum key distribution network;

[0184] A link parameter acquisition module 302, used to determine the candidate path for quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and to obtain the state parameters of the relay links of the candidate path;

[0185] A candidate path sorting module 303, configured to determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links;

[0186] The target path determination module 304 is used to use the candidate path with the highest priority as the target path for quantum key distribution.

[0187] In the embodiment of the present invention, the state parameter of the relay link includes at least one of a remaining key amount, a key generation rate, a key consumption rate, a network delay, and a predicted congestion probability. The candidate path sorting module 303 includes:

[0188] A key index determination submodule, used to determine the key index of the relay link according to the remaining key amount, the key generation rate and the key consumption rate;

[0189] A network indicator determination submodule, used to determine the network indicator of the relay link according to the network delay and the predicted congestion probability;

[0190] A path length index determination submodule, used to determine the path length index of the candidate path according to the number of the relay links;

[0191] The candidate path sorting module submodule is used to obtain the weight coefficient of the candidate path and determine the priority of the candidate path according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path.

[0192] In the embodiment of the present invention, the key indicator determination submodule includes:

[0193] A key indicator parameter acquisition unit, used to acquire a key potential impact parameter and a preset key remaining amount of the relay link;

[0194] A key potential index determination unit, configured to determine a key potential index of the relay link according to the remaining key amount, the key generation rate, the key consumption rate and the key potential influencing parameter;

[0195] The key index determination unit is used to determine the key index of the relay link according to the key potential index and the preset key remaining amount.

[0196] In the embodiment of the present invention, the key potential index of the relay link is determined according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter according to the following formula:

[0197] T x =Kx +(G x -C x )×Δ t

[0198] Where x is the relay link, x∈R,T x is the key potential index of relay link x, K x is the remaining key amount of relay link x, G x is the key generation rate of relay link x, C x is the key consumption rate of relay link x, Δ t Potential impact parameters for keys;

[0199] According to the key potential index and the remaining amount of the preset key, the key index of the relay link is determined according to the following formula:

[0200]

[0201] Among them, E x is the key index of relay link x, K max The remaining amount of preset keys.

[0202] In an embodiment of the present invention, the network indicator determination submodule includes:

[0203] Obtain a network delay impact parameter, and determine the network indicator of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter according to the following formula:

[0204]

[0205] Among them, N x is the network index of relay link x, α is the network delay impact parameter, D x is the network delay of relay link x, P x is the predicted congestion probability of relay link x.

[0206] In an embodiment of the present invention, the path length indicator determination submodule includes:

[0207] Obtain a path length influencing parameter, and determine the path length index of the candidate path according to the number of the relay links and the path length influencing parameter according to the following formula:

[0208] L R =e -β×d

[0209] Among them, R is the candidate path, L R is the path length indicator of the candidate path R, β is the path length influence parameter, and d is the number of relay links of the candidate path R.

[0210] In an embodiment of the present invention, the weight coefficient of the candidate path includes at least one of a key weight coefficient, a network weight coefficient and a length weight coefficient, and the candidate path sorting module submodule includes:

[0211] According to the weight coefficient of the candidate path, the key index of the relay link, the network index of the relay link and the path length index of the candidate path, the priority of the candidate path is determined according to the following formula:

[0212]

[0213] Among them, S R is the priority of candidate path R, w E is the key weight coefficient, w N is the network weight coefficient, w L is the length weight coefficient.

[0214] The embodiment of the present invention can determine the source node and destination node of quantum key distribution from the route calculation request after receiving the route calculation request of the key sending device of the quantum key distribution network; determine the candidate path of quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path, so as to monitor the state of the quantum key distribution network in real time, and comprehensively consider multiple indicators such as the key remaining amount, key generation rate, key consumption rate, network delay, predicted congestion probability, etc. of the relay link; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay link, so as to adapt to the dynamic changes of network conditions and adjust the routing strategy in real time; take the candidate path with the highest priority as the target path of quantum key distribution, so as to select the best path among the candidate paths for quantum key distribution according to the state of the relay links of the quantum key distribution network, ensure that the best routing strategy is determined in time when the network is congested or the conditions fluctuate, and improve the success rate and efficiency of key distribution.

[0215] As for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0216] An embodiment of the present invention also provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned method for determining a quantum key distribution relay path when executing the computer program.

[0217] An embodiment of the present invention also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned method for determining a quantum key distribution relay path are implemented.

[0218] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0219] Those skilled in the art will appreciate that the embodiments of the embodiments of the present invention may be provided as methods, devices, or computer program products. Therefore, the embodiments of the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present invention may take the form of a computer program product implemented on one or more machine-readable media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0220] The embodiments of the present invention are described with reference to the flowcharts and / or block diagrams of the methods, terminal devices (systems), and computer program products according to the embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0221] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0222] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 A process or multiple processes and / or boxes Figure 1The steps for the functions specified in one or more boxes.

[0223] Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present invention.

[0224] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or terminal device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or terminal device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or terminal device including the elements.

[0225] The above is a detailed introduction to a quantum key distribution relay path determination method, device, system, equipment and medium provided by the present invention. Specific examples are used herein to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. A method for determining a quantum key distribution relay path, characterized in that: The method comprises: After receiving a route calculation request from a key sending device of a quantum key distribution network, determining a source node and a destination node of the quantum key distribution from the route calculation request; Determine, according to the source node and the destination node, a candidate path for quantum key distribution and the number of relay links of the candidate path, and obtain state parameters of the relay links of the candidate path; Determining the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links; The candidate path with the highest priority is selected as the target path for quantum key distribution.

2. The method according to claim 1, characterized in that The state parameter of the relay link includes at least one of a remaining key amount, a key generation rate, a key consumption rate, a network delay, and a predicted congestion probability, and determining the priority of the candidate path according to the number of relay links of the candidate path and the state parameter of the relay link includes: Determining a key indicator of the relay link according to the remaining key amount, the key generation rate, and the key consumption rate; Determining a network indicator of the relay link according to the network delay and the predicted congestion probability; Determining a path length indicator of the candidate path according to the number of the relay links; The weight coefficient of the candidate path is obtained, and the priority of the candidate path is determined according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path.

3. The method according to claim 2, characterized in that The determining the key indicator of the relay link according to the remaining key amount, the key generation rate and the key consumption rate includes: Acquire a key potential impact parameter and a preset key remaining amount of the relay link; Determining a key potential index of the relay link according to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter; The key index of the relay link is determined according to the key potential index and the preset key remaining amount.

4. The method according to claim 3, characterized in that According to the remaining key amount, the key generation rate, the key consumption rate and the key potential impact parameter, the key potential index of the relay link is determined according to the following formula: T x =K x +(G x -C x )×Δ t Where x is the relay link, x∈R,T x is the key potential index of relay link x, K x is the remaining key amount of relay link x, G x is the key generation rate of relay link x, C x is the key consumption rate of relay link x, Δ t Potential impact parameters for keys; According to the key potential index and the remaining amount of the preset key, the key index of the relay link is determined according to the following formula: Among them, E x is the key index of relay link x, K max The remaining amount of preset keys.

5. The method according to claim 4, characterized in that The determining, according to the network delay and the predicted congestion probability, a network indicator of the relay link comprises: Obtain a network delay impact parameter, and determine the network indicator of the relay link according to the network delay, the predicted congestion probability and the network delay impact parameter according to the following formula: Among them, N x is the network index of relay link x, α is the network delay impact parameter, D x is the network delay of relay link x, P x is the predicted congestion probability of relay link x.

6. The method according to claim 5, characterized in that The determining, according to the number of the relay links, a path length indicator of the candidate path includes: Obtain a path length influencing parameter, and determine the path length index of the candidate path according to the number of the relay links and the path length influencing parameter according to the following formula: THE R =and -β×d Among them, R is the candidate path, L R is the path length indicator of the candidate path R, β is the path length influence parameter, and d is the number of relay links of the candidate path R.

7. The method according to claim 6, characterized in that The weight coefficient of the candidate path includes at least one of a key weight coefficient, a network weight coefficient and a length weight coefficient, and determining the priority of the candidate path according to the weight coefficient of the candidate path, the key indicator of the relay link, the network indicator of the relay link and the path length indicator of the candidate path includes: According to the weight coefficient of the candidate path, the key index of the relay link, the network index of the relay link and the path length index of the candidate path, the priority of the candidate path is determined according to the following formula: Among them, S R is the priority of candidate path R, w E is the key weight coefficient, w N is the network weight coefficient, w L is the length weight coefficient.

8. A quantum key distribution relay path determination system, characterized in that: The system comprises: a quantum key distribution service device and a quantum key distribution network; the quantum key distribution network comprises a key sending device, a key receiving device, and at least one relay node device; The quantum key distribution service device is used to determine the source node and destination node of the quantum key distribution from the route calculation request after receiving the route calculation request from the key sending device of the quantum key distribution network; determine the candidate path of the quantum key distribution and the number of relay links of the candidate path according to the source node and the destination node, and obtain the state parameters of the relay links of the candidate path; determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links; and use the candidate path with the highest priority as the target path of the quantum key distribution; The key sending device is used to send a route calculation request to the quantum key distribution service device, receive a target path for quantum key distribution sent by the quantum key distribution service device, and send a quantum key to a relay node device in the target path; The relay node device is configured to receive the quantum key sent by the key sending device according to the target path, and send the quantum key to the key receiving device; The key receiving device is used to receive the quantum key sent by the relay node device.

9. A quantum key distribution relay path determination device, characterized in that: The device comprises: A path node determination module, configured to determine a source node and a destination node of quantum key distribution from the route calculation request after receiving a route calculation request from a key sending device of the quantum key distribution network; A link parameter acquisition module, used to determine the candidate paths for quantum key distribution and the number of relay links of the candidate paths according to the source node and the destination node, and to acquire the state parameters of the relay links of the candidate paths; A candidate path sorting module, used to determine the priority of the candidate path according to the number of relay links of the candidate path and the state parameters of the relay links; The target path determination module is used to select the candidate path with the highest priority as the target path for quantum key distribution.

10. An electronic device, characterized in that: include: A processor, a memory, and a computer program stored in the memory and capable of running on the processor, wherein when the computer program is executed by the processor, the steps of a method for determining a quantum key distribution relay path as described in any one of claims 1 to 7 are implemented.

11. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by the processor, the steps of a method for determining a quantum key distribution relay path are implemented as described in any one of claims 1 to 7.

Citation Information

Patent Citations

  • Quantum key relay method and apparatus based on centralized management and control network

    CN108023725A

  • Relay node deploying method, apparatus and device, and computer readable storage medium

    CN109194468A

  • Relay link selection method and device based on quantum cloud key negotiation and quantum cloud server

    CN114389797A

  • Route establishment method and system and quantum cryptography network

    CN116418492A

  • Quantum cryptography network key relay dynamic routing method, device and system

    CN117176345A

Cited By

  • Bottleneck link processing method and device, electronic equipment and computer storage medium

    CN120433938A

  • Bottleneck link processing method, device, electronic device and computer storage medium

    CN120433938B

  • Bottleneck link processing method and device, electronic equipment and computer storage medium

    CN120455005A

  • Bottleneck link processing method, device, electronic device and computer storage medium

    CN120455005B

  • Quantum key distribution method and device, electronic equipment and computer storage medium

    CN120602091A