Routing and resource optimization method and system for hybrid relay QKD optical network

Abstract

The invention relates to the technical field of quantum key division light-emitting network resource allocation, in particular to a routing and resource optimization method and system for a hybrid relay QKD (quantum key division light-emitting network), and the method comprises the steps: initializing a quantum key division light-emitting network; generating a group of service requests based on the quantum key sub-luminescence network; based on the service request, taking minimization of the frequency slot and time slot occupation number of the quantum key sub-luminescence network as a target, and constructing an optimization target function and a key rate constraint condition of the optimization target function; and solving the optimization objective function according to a key rate constraint condition to obtain routing, frequency spectrum and time slot allocation results. According to the method, the resource utilization efficiency of the quantum key distribution light-emitting network is remarkably improved and the security of data transmission is ensured by accurately evaluating the key rate demand of the service request, optimizing resource distribution, considering comprehensive constraint conditions and providing flexible routing selection and systematized solutions.

Description

Technical Field

[0001] The present invention relates to the technical field of quantum key distribution optical network resource allocation, and in particular to a routing and resource optimization method and system for a hybrid relay QKD optical network. Background Art

[0002] With the booming development of cloud computing, data centers and related services, the data traffic carried by optical networks has increased dramatically. At the same time, optical networks are increasingly becoming a key way to transmit private and sensitive data. However, the rapid improvement of computer performance has posed a severe challenge to encryption methods that traditionally rely on the complexity of mathematical calculations. Optical network communications are facing multiple security threats such as eavesdropping and data leakage. In this context, quantum key distribution (QKD) technology is gradually emerging as a powerful weapon to ensure the security of optical networks.

[0003] QKD technology makes full use of the unique principles of quantum mechanics to generate and distribute keys through the manipulation of light quantum states, showing excellent anti-eavesdropping potential. Therefore, QKD is recognized as one of the core technologies for achieving unconditional secure communications, and provides a new idea and means for the security protection of optical networks. In recent years, this field has made significant progress in both theoretical exploration and experimental verification, and has successfully achieved commercial application in a short period of time.

[0004] Despite this, independent point-to-point QKD links still face many limitations in terms of transmission distance and key rate. For long-distance key communication needs, the introduction of QKD relay technology is particularly important. Currently, there are three main solutions for QKD relay:

[0005] (1) QKD based on quantum relay: This solution uses the quantum entanglement effect to realize the storage and forwarding function of quantum states, thereby extending the transmission distance of quantum states. However, due to the lack of maturity of quantum storage technology, QKD based on quantum relay is still in the research and development stage.

[0006] (2) Trusted relay-based QKD: This scheme caches the key generated by the point-to-point QKD link in the trusted relay node and uses a one-time password (OTP) hop-by-hop encryption algorithm to achieve end-to-end key transmission. However, it is worth noting that the trusted relay node may become the focus of eavesdropping attacks in practical applications.

[0007] (3) Measurement-device-independent quantum key distribution (MDI-QKD): In the MDI-QKD scheme, a pair of users sends a signal to an MDI node in the middle for Bell state measurement. The user obtains a secure key after subsequent processing based on the measurement results published by the MDI node on a public channel. However, the key rate requirement of MDI-QKD limits the further expansion of its transmission distance.

[0008] Compared with the above three solutions, the QKD network based on hybrid relay shows higher adaptability in actual deployment. How to efficiently and reasonably use hybrid relay technology to achieve data transmission and key distribution, and perform routing planning for different business requests to improve the overall key rate and ensure the security of data encryption has become a key issue that needs to be solved urgently.

[0009] In addition, given the high cost of building quantum channels, how to reduce resource consumption and improve the utilization efficiency of spectrum and time slot resources to support more business requests using quantum keys for encryption protection is also an important issue that cannot be ignored. Summary of the invention

[0010] In order to solve the problems of resource waste and low key rate in the relay process of a hybrid relay QKD optical network, the present invention provides a routing and resource optimization method for a hybrid relay QKD optical network, the method comprising the following steps:

[0011] S1: Initialize the quantum key light distribution network G(N t ,N m ,L,W,Δ,T),N t represents the set of optical backbone nodes and trusted relay nodes, N m is a set of quantum key distribution nodes that are independent of the measurement device, L represents a set of fiber links in the network, two nodes i and j are connected by a fiber link (i, j), (i, j) ∈ L, W represents the set of available traditional data channels, Δ and T represent a set of quantum channels and a set of time slots on each quantum channel, respectively;

[0012] S2: Based on the quantum key distribution network, a set of service requests R(s, d, w, t, SKR)∈R is generated, where R is the service request set, s is the source node, d is the destination node, w is the required number of traditional data channels, t is the required number of time slots, and SKR is the minimum key rate threshold required for the encryption service request;

[0013] S3: Based on the service request, with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key distribution network, construct an optimization objective function and a key rate constraint condition of the optimization objective function;

[0014] S4: Based on the key rate constraint, the optimization objective function is solved to obtain routing, spectrum, and time slot allocation results.

[0015] In one embodiment of the present invention, in S3, the expression of the optimization objective function is as follows:

[0016]

[0017] in, and Both represent binary variables, (i, j) represents the optical fiber link from node i to node j, and Minimize represents the operation of minimizing the spectrum and time slot occupancy. When the service request from the source node s to the destination node d occupies the frequency slot numbered λ on the traditional data channel of the optical fiber link (i, j), otherwise When the service request from the source node s to the destination node d occupies the time slot t in the frequency slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise

[0018] In one embodiment of the present invention, the key rate constraint conditions include flow conservation constraints of service requests, spectrum and time slot continuity constraints, spectrum and time slot unique occupancy constraints, frequency slot and time slot identity constraints, and a constraint that the key generation rate of the key transmission path is greater than or equal to the minimum key rate requirement threshold of the service request.

[0019] In one embodiment of the present invention, the expression of the flow conservation constraint condition of the service request is as follows:

[0020]

[0021]

[0022]

[0023] When the service request from the source node s to the destination node d occupies the spectrum slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise

[0024] In one embodiment of the present invention, the spectrum and time slot continuity constraint condition is divided into a frequency slot continuity constraint condition and a time slot continuity constraint condition, as follows:

[0025] For spectrum resources, the frequency slot selected by each service request R(s,d,w,t,SKR) must satisfy the frequency slot continuity constraint, namely:

[0026] On traditional data channels, when and When the frequency slot numbered greater than or equal to λ+2 is not occupied by any other service request:

[0027]

[0028] when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR):

[0029]

[0030] On the quantum channel, when the binary variable and When λ is greater than or equal to λ+2, the frequency slots are not occupied by any service request:

[0031]

[0032] when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR):

[0033]

[0034] Among them, θ represents a preset positive integer, n (s,d) represents the number of frequency slots required for the service request from the source node s to the destination node d;

[0035] For time slot resources, the time slot selected by each service request R(s,d,w,t,SKR) must satisfy the time slot continuity constraint, namely:

[0036] When the binary variable and When t+2 is reached, the time slots with numbers greater than or equal to t+2 are not occupied by any other service requests:

[0037]

[0038] when The time slots with numbers less than t are occupied by service requests R(s,d,w,t,SKR):

[0039]

[0040] Among them, t (s,d) Represents the number of time slots required for a service request from source node s to destination node d.

[0041] In one embodiment of the present invention, the spectrum and time slot unique occupancy constraint condition is divided into a spectrum unique occupancy constraint condition and a time slot unique occupancy constraint condition;

[0042] The spectrum unique occupancy constraint condition means that a frequency slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time:

[0043]

[0044] The time slot unique occupancy constraint condition means that a time slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time:

[0045]

[0046] In one embodiment of the present invention, the frequency slot and time slot identity constraint means that for each service request R(s, d, w, t, SKR), the frequency slot occupied by its time slot and the spectrum used by the service request are the same frequency slot, that is:

[0047]

[0048]

[0049] Wherein, θ represents a preset positive integer.

[0050] In one embodiment of the present invention, the constraint condition that the key generation rate of the key transmission path is greater than or equal to the service request minimum key rate requirement threshold means that the key generation rate on the key transmission path of each service request at least reaches the service request minimum key rate requirement threshold, that is:

[0051]

[0052]

[0053]

[0054]

[0055]

[0056] Among them, KR (s,d) represents the minimum key rate threshold required for a service request R(s,d,w,t,SKR) from source node s to destination node d; Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise, Equal to a positive integer N.

[0057] In one embodiment of the present invention, the key generation rate KR on the key transmission path of the service request p :

[0058] KRp =min (i,j)∈p KR (i,j)

[0059] Among them, KR (i,j) represents the lower bound of the security key rate between nodes i and j, p is the entire key transmission path including the relay node, Q1 is the single-photon state gain, H2(x) is the binary Shannon information function, E is the quantum bit error rate, P0 is the vacuum state yield, γ is the misalignment of the optical element; Q is the channel gain, Q = P0 + 1-e -μθ , μ represents the average number of photons sent in a specified time interval.

[0060] Based on the same inventive concept, the present invention also provides a routing and resource optimization system for a hybrid relay QKD optical network, which is used to implement the routing and resource optimization method for the hybrid relay QKD optical network. The system includes the following modules:

[0061] Network initialization module, used to initialize the quantum key distribution network;

[0062] A service request generation module, used to generate a set of service requests based on the quantum key distribution network;

[0063] An objective function construction module, for constructing an optimization objective function and a key rate constraint condition of the optimization objective function based on the service request and with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key light-sharing network;

[0064] The resource allocation module is used to solve the optimization objective function based on the key rate constraint condition to obtain routing, spectrum and time slot allocation results.

[0065] The above technical solution of the present invention has the following advantages compared with the prior art:

[0066] The present invention mainly distributes routes to service requests and evaluates their key rates. The purpose of meeting the key rate requirement threshold of service requests is achieved, ensuring that service requests can have sufficient key encryption and guaranteeing their security requirements during the transmission process. At the same time, based on the spectrum and time slot requirements of the service requests, necessary spectrum and time slot resources are allocated to them to solve the routing, spectrum, and time slot allocation problems of service requests. Taking the minimization of spectrum and time slot resource occupancy as the target optimization function, the constraints of flow conservation, spectrum and time slot consistency, spectrum and time slot continuity, spectrum and time slot unique occupancy, spectrum and time slot identity, and the key generation rate of the key transmission path being greater than or equal to the minimum key rate requirement threshold of the service requests are met to obtain the optimal solution of spectrum and time slot resource occupancy of a set of known service requests, solve the optimal routing, spectrum, and time slot allocation problems based on key rate constraints, thereby improving the resource utilization efficiency of quantum key distribution networks. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] In order to make the content of the present invention more clearly understood, the present invention is further described in detail below according to specific embodiments of the present invention in conjunction with the accompanying drawings, wherein:

[0068] Figure 1 It is a flow chart of the routing and resource optimization method of the hybrid relay QKD optical network provided in the first embodiment of the present invention;

[0069] Figure 2 It is a specific flow chart of the routing and resource optimization method of the hybrid relay QKD optical network provided in the first embodiment of the present invention;

[0070] Figure 3 It is a schematic diagram of the key generation rate of the optical fiber link of the QKD optical network;

[0071] Figure 4 There are two business requests R(0,2,1,2,1.29×10 -4 ) and R(3,5,2,1,1.32×10 -4 )'s optimal solution for routing, spectrum, and time slot allocation;

[0072] Figure 5 It is a schematic diagram of the structure of the routing and resource optimization system of the hybrid relay QKD optical network provided in the second embodiment of the present invention;

[0073] Description of the accompanying drawings in the specification: 10. Network initialization module; 20. Service request generation module; 30. Objective function construction module; 40. Resource allocation module. DETAILED DESCRIPTION

[0074] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments so that those skilled in the art can better understand the present invention and implement it, but the embodiments are not intended to limit the present invention.

[0075] Embodiment 1

[0076] Reference Figure 1 and Figure 2 As shown, the present invention provides a routing and resource optimization method for a hybrid relay QKD optical network, the method comprising the following steps:

[0077] S1: Initialize the quantum key distribution network G(N t ,N m ,L,W,Δ,T),N t represents the set of optical backbone nodes and trusted relay nodes, N m is a set of quantum key distribution nodes that are independent of the measurement device, L represents a set of fiber links in the network, two nodes i and j are connected by a fiber link (i, j), (i, j) ∈ L, W represents the set of available traditional data channels, Δ and T represent a series of quantum channels and a set of time slots on each quantum channel, respectively; |N t |、|N m |, |L|, |W|, |Δ|, and |T| represent the number of optical backbone nodes and trusted relay nodes in the quantum key distribution network, the number of MDI-QKD nodes, the number of optical fiber links, the number of traditional data channels, the number of quantum channels, and the number of time slots in the quantum channels, respectively;

[0078] S2: Based on the quantum key distribution network, a set of service requests R(s, d, w, t, SKR)∈R is generated, where R is the service request set, s is the source node, d is the destination node, w is the required number of traditional data channels, t is the required number of time slots, and SKR is the minimum key rate threshold required for the encryption service request;

[0079] S3: Based on the service request, with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key distribution network, construct an optimization objective function and a key rate constraint condition of the optimization objective function;

[0080] S4: Based on the key rate constraint, the optimization objective function is solved to obtain routing, spectrum, and time slot allocation results.

[0081] In this embodiment, in S3, the expression of the optimization objective function is as follows:

[0082]

[0083] in, and Both represent binary variables, (i, j) represents the optical fiber link from node i to node j, and Minimize represents the operation of minimizing the spectrum and time slot occupancy. On the one hand, when the service request from the source node s to the destination node d occupies the frequency slot numbered λ on the traditional data channel of the optical fiber link (i, j), otherwise On the other hand, when the service request from the source node s to the destination node d occupies the time slot t in the frequency slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise

[0084] Furthermore, the key rate constraint conditions include flow conservation constraints of service requests, spectrum and time slot continuity constraints, spectrum and time slot unique occupancy constraints, frequency slot and time slot identity constraints, and a constraint that the key generation rate of the key transmission path is greater than or equal to the minimum key rate requirement threshold of the service request.

[0085] Specifically, the expression of the flow conservation constraint condition of the service request is as follows:

[0086]

[0087]

[0088]

[0089] When the service request from the source node s to the destination node d occupies the spectrum slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise

[0090] The spectrum and time slot continuity constraint conditions are divided into frequency slot continuity constraint conditions and time slot continuity constraint conditions, as follows:

[0091] For spectrum resources, the frequency slot selected by each service request R(s,d,w,t,SKR) must satisfy the frequency slot continuity constraint, namely:

[0092] On traditional data channels, when and When the frequency slot numbered greater than or equal to λ+2 is not occupied by any other service request:

[0093]

[0094] when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR):

[0095]

[0096] On the quantum channel, when the binary variable and When λ is greater than or equal to λ+2, the frequency slots are not occupied by any service request:

[0097]

[0098] when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR):

[0099]

[0100] Among them, θ represents a preset very large positive integer, n (s,d) represents the number of frequency slots required for the service request from the source node s to the destination node d;

[0101] For time slot resources, the time slot selected by each service request R(s,d,w,t,SKR) must satisfy the time slot continuity constraint, namely:

[0102] When the binary variable and When t+2 is reached, the time slots with numbers greater than or equal to t+2 are not occupied by any other service requests:

[0103]

[0104] when The time slots with numbers less than t are occupied by service requests R(s,d,w,t,SKR):

[0105]

[0106] Among them, t (s,d) Represents the number of time slots required for a service request from source node s to destination node d.

[0107] The spectrum and time slot unique occupancy constraint condition is divided into a spectrum unique occupancy constraint condition and a time slot unique occupancy constraint condition;

[0108] The spectrum unique occupancy constraint condition means that a frequency slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time:

[0109]

[0110] The time slot unique occupancy constraint condition means that a time slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time:

[0111]

[0112] The frequency slot and time slot identity constraint means that for each service request R(s,d,w,t,SKR), the frequency slot occupied by its time slot is the same as the spectrum used by the service request, that is:

[0113]

[0114]

[0115] Wherein, θ represents a preset positive integer.

[0116] The constraint condition that the key generation rate of the key transmission path is greater than or equal to the service request minimum key rate requirement threshold means that the key generation rate on the key transmission path of each service request at least reaches the service request minimum key rate requirement threshold, that is:

[0117]

[0118]

[0119]

[0120]

[0121]

[0122] Among them, KR (s,d) represents the minimum key rate threshold required for a service request R(s,d,w,t,SKR) from source node s to destination node d; Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise, Equal to a positive integer N.

[0123] Among them, the key generation rate KR on the key transmission path of the service request p :

[0124] KR p =min (i,j)∈p KR (i,j) (20)

[0125] Among them, KR (i,j)represents the lower bound of the security key rate between nodes i and j, p is the entire key transmission path including the relay node, Q1 is the single-photon state gain, H2(x) is the binary Shannon information function, E is the quantum bit error rate, P0 is the vacuum state yield, γ is the misalignment of the optical element; Q is the channel gain, Q = P0 + 1-e -μθ , μ represents the average number of photons sent in a specified time interval.

[0126] In order to achieve the goal of minimizing the spectrum time slot resources occupied by a group of service requests, we firstly t ,N m , L, W, Δ, T) is initialized, including the network topology information, the network's optical backbone nodes and trusted relay nodes, MDI-QKD nodes, optical fiber links, traditional data channels, quantum channels and time slots; secondly, a group of service requests are generated, including the source node, destination node, spectrum and time slot requirements, and the minimum required key rate threshold of the service request; finally, based on the optimization function of the key rate constraint, the flow conservation of the service request of the optimization function, the continuity of the spectrum and time slot, the unique occupancy of the spectrum and time slot, the identity of the spectrum and time slot, and the key generation rate of the key transmission path greater than or equal to the minimum key rate requirement threshold of the service request are satisfied, and the optimal solution of the spectrum and time slot resource occupancy is obtained. The specific embodiments are as follows:

[0127] First, initialize Figure 3 In the quantum key distribution network shown, each fiber optic link is bidirectional, the value on the fiber optic link represents unavailability, the number of traditional data channels of each fiber optic link is set to 3, the number of quantum channels is set to 2, and the number of time slots on each quantum channel is set to 3.

[0128] Secondly, based on the above quantum key distribution network, a set of service requests R (0, 2, 1, 2, 1.29 × 10 -4 ) and R(3,5,2,2,1.32×10 -4 ).

[0129] Then, the optimization function of the dedicated protection routing, spectrum, and time slot allocation method based on the key rate constraint is executed to meet the flow conservation constraints of the service request, the spectrum and time slot continuity constraints, the time slot unique occupancy constraints, the spectrum and time slot identity constraints, and the key generation rate of the working path is greater than or equal to the minimum key rate requirement threshold of the service request.

[0130] Finally, the solution of the optimization function based on the key rate constraint is 16, that is, the minimum required time slot to meet the key rate constraint is 16. Figure 4 As shown, the business request R(0,2,1,2,1.29×10 -4) and R(3,5,2,2,1.32×10 -4 ) The selected data transmission paths are: (0-1-2) and (3-4-5), and the corresponding traditional data channels are numbered 1 and 1, 2. The selected key transmission paths are: (0-5-1-2) and (3-4-5), and the corresponding traditional data channels are numbered 1, 2 and 1, 2. According to the optimization goal of minimizing spectrum and time slot occupancy, path (0-1-2) should be selected as the data transmission path and key transmission path. Due to the constraint that the key generation rate of the key transmission path is greater than or equal to the minimum key rate requirement threshold of the service request, the key generation rate of path (0-1-2) is 8.51×10 -5 , cannot meet the business request R(0,2,1,2,1.29×10 -4 ) is required to meet the minimum key rate requirement. Therefore, it is necessary to find the path (0-5-1-2) that occupies the least spectrum and time slot resources under the constraint. Using formula (20), the service request R (0,2,1,2,1.29×10 -4 ) The key generation rate of the key transmission path selected is 1.69×10 -4 , which is greater than the minimum key requirement rate of this service request, 1.32×10 -4 , then the key transmission path (0-5-1-2) established by this service request satisfies the constraint that the key generation rate of the key transmission path is greater than or equal to the service request minimum key rate requirement threshold, and finally this path is selected for key transmission. Similarly, using formula (20), the service request R (3,5,2,2,1.32×10 -4 The minimum key generation rate requirement for the selected data transmission path and key transmission path is 1.36×10 -4 The data transmission path and key transmission path (3-4-5) established by this service request also meet the key generation rate requirement threshold of 1.32×10 -4 constraints.

[0131] Embodiment 2

[0132] Based on the same inventive concept as that of the first embodiment, the present invention also provides a routing and resource optimization system for a hybrid relay QKD optical network, which is used to implement the routing and resource optimization method for the hybrid relay QKD optical network described in the first embodiment. Figure 5 As shown, the system includes the following modules:

[0133] A network initialization module 10 is used to initialize the quantum key light distribution network;

[0134] A service request generation module 20, configured to generate a set of service requests based on the quantum key distribution network;

[0135] An objective function construction module 30 is used to construct an optimization objective function and a key rate constraint condition of the optimization objective function based on the service request and with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key distribution network;

[0136] Among them, the objective function construction module 30 also includes a service request flow conservation constraint submodule, a spectrum and time slot continuity constraint submodule, a spectrum and time slot unique occupancy constraint submodule, a spectrum and time slot identity constraint submodule, a working path key rate calculation module and a service minimum required key rate threshold constraint submodule. The implementation functions of each module are the same as the key rate constraint conditions and the key generation rate KR on the key transmission path of the service request described in the first embodiment. p The implementation process is the same, so I won’t go into details here;

[0137] The resource allocation module 40 is used to solve the optimization objective function based on the key rate constraint condition to obtain routing, spectrum and time slot allocation results.

[0138] The present embodiment proposes a routing and resource optimization system for a hybrid relay QKD optical network, which is used to implement the aforementioned routing and resource optimization method for a hybrid relay QKD optical network. Therefore, the specific implementation method of the routing and resource optimization system for a hybrid relay QKD optical network can be seen in the embodiment part of the aforementioned routing and resource optimization method for a hybrid relay QKD optical network. For example, the network initialization module 10, the service request generation module 20, the objective function construction module 30 and the resource allocation module 40 are respectively used to correspond to the steps S1, S2, S3 and S4 in the routing and resource optimization method for the hybrid relay QKD optical network in the first embodiment. Therefore, its specific implementation method can refer to the description of the corresponding embodiments of each part. In order to avoid redundancy, it will not be repeated here.

[0139] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0140] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes 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 device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing 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.

[0141] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising 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.

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

[0143] Obviously, the above embodiments are merely examples for clear explanation and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived from these are still within the protection scope of the invention.

Claims

1. A method for routing and resource optimization of a hybrid relay QKD optical network, characterized in that: The following steps are involved: S1: Initialize the quantum key distribution network G(N t ,N m ,L,W,Δ,T),N t represents the set of optical backbone nodes and trusted relay nodes, N m is a set of quantum key distribution nodes that are independent of the measurement device, L represents a set of fiber links in the network, two nodes i and j are connected by a fiber link (i, j), (i, j) ∈ L, W represents the set of available traditional data channels, Δ and T represent a set of quantum channels and a set of time slots on each quantum channel, respectively; S2: Based on the quantum key distribution network, a set of service requests R(s, d, w, t, SKR)∈R is generated, where R is the service request set, s is the source node, d is the destination node, w is the required number of traditional data channels, t is the required number of time slots, and SKR is the minimum key rate threshold required for the encryption service request; S3: Based on the service request, with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key distribution network, construct an optimization objective function and a key rate constraint condition of the optimization objective function; S4: Based on the key rate constraint, the optimization objective function is solved to obtain routing, spectrum, and time slot allocation results.

2. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 1, characterized in that: In S3, the expression of the optimization objective function is as follows: in, and Both represent binary variables, (i, j) represents the optical fiber link from node i to node j, and Minimize represents the operation of minimizing the spectrum and time slot occupancy. When the service request from the source node s to the destination node d occupies the frequency slot numbered λ on the traditional data channel of the optical fiber link (i, j), otherwise When the service request from the source node s to the destination node d occupies the time slot t in the frequency slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise 3. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 2, characterized in that: The key rate constraint conditions include the flow conservation constraint conditions of the service request, the spectrum and time slot continuity constraint conditions, the spectrum and time slot unique occupancy constraint conditions, the frequency slot and time slot identity constraint conditions, and the key generation rate of the key transmission path is greater than or equal to the minimum key rate requirement threshold of the service request.

4. The method for optimizing routing and resources of a hybrid relay QKD optical network according to claim 3, characterized in that: The expression of the flow conservation constraint condition of the service request is as follows: When the service request from the source node s to the destination node d occupies the spectrum slot numbered λ on the quantum channel of the optical fiber link (i, j), otherwise 5. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 3, characterized in that: The spectrum and time slot continuity constraint conditions are divided into frequency slot continuity constraint conditions and time slot continuity constraint conditions, as follows: For spectrum resources, the frequency slot selected by each service request R(s,d,w,t,SKR) must satisfy the frequency slot continuity constraint, namely: On traditional data channels, when and When the frequency slot numbered greater than or equal to λ+2 is not occupied by any other service request: when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR): On the quantum channel, when the binary variable and When λ is greater than or equal to λ+2, the frequency slots are not occupied by any service request: when The frequency slots with numbers less than λ are occupied by service requests R(s,d,w,t,SKR): Among them, θ represents a preset positive integer, n (s,d) represents the number of frequency slots required for the service request from the source node s to the destination node d; For time slot resources, the time slot selected by each service request R(s,d,w,t,SKR) must satisfy the time slot continuity constraint, namely: When the binary variable and When t+2 is reached, the time slots with numbers greater than or equal to t+2 are not occupied by any other service requests: when The time slots with numbers less than t are occupied by service requests R(s,d,w,t,SKR): Among them, t (s,d) Represents the number of time slots required for a service request from source node s to destination node d.

6. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 3, characterized in that: The spectrum and time slot unique occupancy constraint condition is divided into a spectrum unique occupancy constraint condition and a time slot unique occupancy constraint condition; The spectrum unique occupancy constraint condition means that a frequency slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time: The time slot unique occupancy constraint condition means that a time slot can only be occupied by one service request and cannot be occupied by two or more service requests at the same time:

7. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 3, characterized in that: The frequency slot and time slot identity constraint means that for each service request R(s,d,w,t,SKR), the frequency slot occupied by its time slot is the same as the spectrum used by the service request, that is: Wherein, θ represents a preset positive integer.

8. The method for optimizing routing and resources of a hybrid relay QKD optical network according to claim 3, characterized in that: The constraint condition that the key generation rate of the key transmission path is greater than or equal to the service request minimum key rate requirement threshold means that the key generation rate on the key transmission path of each service request at least reaches the service request minimum key rate requirement threshold, that is: Among them, KR (s,d) represents the minimum key rate threshold required for a service request R(s,d,w,t,SKR) from a source node s to a destination node d; Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise Represents a binary variable. When the optical fiber link (i, j) on the key transmission path is used by a service request, otherwise, Equal to a positive integer N.

9. The method for routing and resource optimization of a hybrid relay QKD optical network according to claim 8, characterized in that: The key generation rate KR on the key transmission path of the service request p : KR p =my (i,j)∈p KR (i,j) Among them, KR (i,j) represents the lower bound of the security key rate between nodes i and j, p is the entire key transmission path including the relay node, Q1 is the single-photon state gain, H2(x) is the binary Shannon information function, E is the quantum bit error rate, P0 is the vacuum state yield, γ is the misalignment of the optical element; Q is the channel gain, Q = P0 + 1-e -μθ , μ represents the average number of photons sent in a specified time interval.

10. A routing and resource optimization system for a hybrid relay QKD optical network, characterized in that: A method for implementing routing and resource optimization of a hybrid relay QKD optical network as claimed in any one of claims 1 to 9, wherein the system comprises the following modules: Network initialization module, used to initialize the quantum key distribution network; A service request generation module, used to generate a set of service requests based on the quantum key distribution network; An objective function construction module, for constructing an optimization objective function and a key rate constraint condition of the optimization objective function based on the service request and with the goal of minimizing the number of frequency slots and time slots occupied by the quantum key distribution network; The resource allocation module is used to solve the optimization objective function based on the key rate constraint condition to obtain routing, spectrum and time slot allocation results.

Images