Path management method, quantum communication network, server and storage medium

Abstract

The application relates to the technical field of quantum communication, and discloses a path management and control method, a quantum communication network, a server and a storage medium. A routing management and control strategy of a to-be-managed path is determined based on acquired management and control requirements. The to-be-managed path comprises a source node, a plurality of first quantum key relay routes and a destination node. A target path is determined according to the to-be-managed path, the routing management and control strategy and a preset path generation algorithm. The target path comprises the source node, a plurality of second quantum key relay routes and the destination node. The plurality of first quantum key relay routes are not completely identical to the plurality of second quantum key relay routes. The target path is sent to each route and node in the target path. The application selects a target path different from the to-be-managed path in the quantum communication network, reduces the number of same relay routes passed by different end-to-end communication paths, improves the utilization rate of routes in the network, reduces the carrying capacity of the same relay routes and improves the reliability of the routes.

Description

Technical Field

[0001] This application relates to the field of quantum communication technology, and in particular to a path control method, a quantum communication network, a server, and a storage medium. Background Technology

[0002] With the improvement of computing power and the emergence of quantum computers, information networks face increasingly severe security threats. Quantum Key Distribution (QKD) can provide reliable keys for encryption in end-to-end communication, achieving information security. However, since the key generation rate of QKD decreases with increasing distance, to achieve key sharing between remote QKD nodes, trusted relays must be set up along the path or other quantum nodes must be borrowed as relays.

[0003] In existing technologies, routing calculations are performed using a preset algorithm to obtain and store end-to-end communication paths in the network, with each pair of end-to-end connections corresponding to a specific communication path. However, while existing technologies can achieve path selection between two user nodes, they also result in a waste of quantum keys in suboptimal paths that are not selected, leading to low routing utilization in the network. In particular, different end-to-end communication paths all pass through the same relay route, which has a very high capacity and is prone to various problems, resulting in reduced reliability. Summary of the Invention

[0004] The purpose of this application is to provide a path control method, a quantum communication network, a server, and a storage medium to improve the utilization and reliability of routing in the network.

[0005] To address the aforementioned technical problems, embodiments of this application provide a path control method, comprising: determining a routing control strategy for a path to be controlled based on acquired control requirements; wherein the path to be controlled includes: a source node, multiple first quantum key relay routes, and a destination node; determining a target path according to the path to be controlled, the routing control strategy, and a preset path generation algorithm; wherein the target path includes: the source node, multiple second quantum key relay routes, and the destination node; the multiple first quantum key relay routes are not entirely identical to the multiple second quantum key relay routes; and sending the target path to each route and node in the target path.

[0006] Embodiments of this application also provide a path control method. When the routing control strategy includes a strategy of increasing the number of routing hops, the step of determining a target path based on the path to be controlled, the routing control strategy, and a preset path generation algorithm includes: determining specific quantum key relay routing pairs in the path to be controlled according to the routing control strategy; increasing the preset number of hops between the specific quantum key relay routing pairs in the path to be controlled; and determining the target path based on the preset path generation algorithm and the path to be controlled after increasing the preset number of hops.

[0007] Embodiments of this application also provide a path control method. When the routing control strategy includes a strategy for modifying the next hop, the step of determining a target path based on the path to be controlled, the routing control strategy, and a preset path generation algorithm includes: determining a specific quantum key relay route in the path to be controlled according to the routing control strategy; setting the next hop of the specific quantum key relay route in the path to be controlled as a preset quantum key relay route; and determining the target path based on the preset path generation algorithm, the path to be controlled, and the next hop preset quantum key relay route of the second specific quantum key relay route.

[0008] Embodiments of this application also provide a path control method. When the routing control policy includes a policy containing subdomains, the step of determining a target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: determining the domains traversed by the target path based on the routing control policy; and determining the target path based on the preset path generation algorithm, the domains traversed by the target path, and the path to be controlled.

[0009] Embodiments of this application also provide a path control method. When the routing control policy includes a policy that does not include subdomains, the step of determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: determining the domains that the target path does not pass through based on the routing control policy; and determining the target path based on the preset path generation algorithm, the domains that the target path does not pass through, and the path to be controlled.

[0010] Embodiments of this application also provide a path management method. When the routing management strategy includes a policy containing routes, the step of determining a target path based on the path to be managed, the routing management strategy, and a preset path generation algorithm includes: determining the routes traversed by the target path based on the routing management strategy; and determining the target path based on the preset path generation algorithm, the routes traversed by the target path, and the path to be managed.

[0011] Embodiments of this application also provide a path control method. When the routing control strategy includes a strategy that does not include routes, the step of determining a target path based on the path to be controlled, the routing control strategy, and a preset path generation algorithm includes: determining routes that the target path does not traverse based on the routing control strategy; and determining the target path based on the preset path generation algorithm, the routes that the target path does not traverse, and the path to be controlled.

[0012] Embodiments of this application also provide a quantum communication network, including: a quantum key control server, a backbone network, a metropolitan area network (MAN), a source node, and a target node; wherein, the number of backbone networks is greater than or equal to one, and the number of MANs is greater than one; when the number of backbone networks is greater than one, multiple backbone networks are interconnected, and the MAN is connected to a designated backbone network among the multiple backbone networks; when the number of backbone networks is equal to one, the MAN is connected to the backbone network; the MAN is connected to the source node or the target node; the quantum key control server is connected to the backbone network and the MAN; the backbone network contains multiple interconnected routes, and the MAN contains multiple interconnected routes or one route; the quantum key control server is used to execute the above-described path management method.

[0013] Embodiments of this application also provide a quantum key control server, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to execute the above-described path control method.

[0014] Embodiments of this application also provide a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described path control method.

[0015] In this application, based on the existing path (path to be managed) generated by the prior art, different routing management strategies are selected according to management requirements. In the quantum communication network, a target path different from the existing path is selected to reduce the number of the same relay routes that different end-to-end communication paths pass through, thereby improving the utilization rate of the network routes and reducing the carrying capacity of the same relay routes to improve the reliability of the routes. Attached Figure Description

[0016] One or more embodiments are illustrated by way of example with reference to the accompanying drawings, and these illustrative descriptions do not constitute a limitation on the embodiments.

[0017] Figure 1 This is a schematic diagram of a quantum communication network provided in an embodiment of this application;

[0018] Figure 2 This is a schematic diagram of another quantum communication network provided in an embodiment of this application;

[0019] Figure 3 This is a flowchart of a path control method provided in an embodiment of this application;

[0020] Figure 4 This is a schematic diagram of the structure of a quantum key control server provided in an embodiment of this application. Detailed Implementation

[0021] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the various embodiments of this application will be described in detail below with reference to the accompanying drawings. However, those skilled in the art will understand that many technical details are presented in the various embodiments of this application to facilitate a better understanding of the application. However, the technical solutions claimed in this application can be implemented even without these technical details and various variations and modifications based on the following embodiments. The division of the various embodiments below is for ease of description and should not constitute any limitation on the specific implementation of this application. The various embodiments can be combined with and referenced by each other without contradiction.

[0022] Embodiments of this application relate to a quantum communication network. Figure 1 This is a schematic diagram of a quantum communication network provided in an embodiment of this application. Figure 2 This is a schematic diagram of another quantum communication network provided in an embodiment of this application, as shown below. Figure 1 and Figure 2 As shown, the quantum communication network includes: a quantum key control server, a backbone network, a metropolitan area network, source nodes, and target nodes.

[0023] Backbone Network: A quantum-secured communication network connecting the capital, provincial capitals, municipalities, and autonomous region capitals. Backbone network nodes include relay stations and backbone stations. Metropolitan Area Network (MAN): A quantum-secured communication network connecting the city and its subordinate counties. The main function of the MAN is to enable users to access the network from the nearest location. MAN nodes include control stations, aggregation stations, and user stations. Quantum Key Control Server: Provides key routing calculations for the quantum key relay process of key management terminal devices. It is responsible for coordinating with other quantum key control service systems to control a larger-scale network and manage cross-domain key relay routing and key application sessions.

[0024] The number of backbone networks is greater than or equal to 1. Since the source node and the target node are each connected to a metropolitan area network, the number of metropolitan area networks is greater than 1.

[0025] When the number of backbone networks is greater than 1, such as Figure 1As shown, multiple backbone networks are interconnected, and each backbone network contains multiple interconnected routes. In this embodiment, backbone network 1 includes routes 4, 5, and 6, with route 4 connected to route 5 and route 5 also connected to route 6. Backbone network 2 includes routes 1, 2, and 3, with route 1 connected to route 2 and route 2 also connected to route 3. The interconnection of multiple backbone networks is achieved through route connections. Specifically, route 4 connects to route 1, and route 6 connects to route 3, thus achieving the interconnection between backbone network 1 and backbone network 2.

[0026] When the number of backbone networks is greater than one, the metropolitan area network (MAN) connects to a designated backbone network among the multiple backbone networks. Specifically, a designated route in the MAN connects to a designated route in the designated backbone network among the multiple backbone networks. For example... Figure 1 As shown, metropolitan area network 1 contains route 11, metropolitan area network 2 contains route 31, route 11 in metropolitan area network 1 is connected to route 1 in backbone network 2 among multiple backbone networks, and route 31 in metropolitan area network 2 is connected to route 3 in backbone network 2 among multiple backbone networks.

[0027] When the number of backbone networks is equal to 1, such as Figure 2 As shown, this backbone network contains multiple interconnected routes. In this embodiment, the backbone network includes routes 1 to 9.

[0028] When the number of backbone networks is equal to one, the metropolitan area network (MAN) is connected to that single backbone network. Specifically, a designated route in the MAN is connected to a designated route in that single backbone network. For example... Figure 2 As shown, the designated route in metropolitan area network 1 is route 14, and the designated route in metropolitan area network 2 is route 31. Route 14 in metropolitan area network 1 is connected to route 1 in the backbone network, and route 31 in metropolitan area network 2 is connected to route 3 in the backbone network.

[0029] like Figure 1 As shown, a metropolitan area network can contain a route, such as... Figure 2 As shown, a metropolitan area network can also contain multiple interconnected routes.

[0030] like Figure 1 and Figure 2 As shown, each metropolitan area network (MAN) connects to at least one user node, which can be either a source node or a destination node; that is, the MAN is connected to either a source node or a destination node. For example, ... Figure 1 As shown, when user node 1 and user node 2 require quantum key relay, user node 1 can act as the source node and user node 2 can act as the destination node; as Figure 2 As shown, user node 11 can act as a source node, and user node 22 can act as a destination node. In this embodiment, the source node and the destination node are connected to different metropolitan area networks.

[0031] The quantum key control server connects to the backbone network and the metropolitan area network. Specifically, the quantum key control server connects to each router in each backbone network and each router in each metropolitan area network, enabling the quantum key control server to control the connection information and routing information of the routers in each backbone network and each metropolitan area network.

[0032] In this embodiment of the application, the numbers on the connection lines between routes in the backbone network represent the hop count between two interconnected routes.

[0033] In this embodiment of the application, the routing in the quantum communication network can be a KM (Quantum Key Distribution) device.

[0034] Based on the above Figure 1 and Figure 2 This application provides a quantum communication network, and its embodiments include a path control method. Figure 3 This is a flowchart of a path control method provided in an embodiment of this application, such as... Figure 3 As shown, this path control method can be applied to the quantum key control server in the aforementioned quantum communication network, and specifically includes the following steps.

[0035] Step 301: Based on the obtained control requirements, determine the routing control strategy for the path to be controlled.

[0036] If, according to the preset path generation algorithm, different end-to-end communication paths all pass through the same relay route, such as... Figure 2 In the network, user nodes 1 to 2, 11 to 22, and N to M all traverse routes 1, 2, and 3. At this point, routes 1, 2, and 3, acting as quantum key relay routes, have high capacity. Meanwhile, other routes in the backbone network, such as routes 4, 5, and 6, are not selected, resulting in a waste of quantum keys on routes 4, 5, and 6. Therefore, at least one path needs to be selected from different end-to-end communication paths traversing the same relay routes as the path to be managed and adjusted.

[0037] When selecting at least one path to be managed from different end-to-end communication paths that pass through the same relay route, a preset number of paths can be randomly selected, or users can select at least one path based on the actual network conditions. Alternatively, paths with bandwidth close to full load, high latency, or high packet loss rate can be selected as paths to be managed based on factors such as bandwidth utilization, latency, and packet loss rate.

[0038] The path to be managed includes: a source node, multiple first quantum key relay routes, and a destination node. For example... Figure 1As shown, there may be a path to be managed: User node 1 (source node), first quantum key relay route 11, first quantum key relay route 1, first quantum key relay route 2, first quantum key relay route 3, first quantum key relay route 31, user node 2 (destination node).

[0039] In the embodiments of this application, the routing control policy includes: a policy of increasing the number of routing hops, and / or a policy of modifying the next hop, and / or a policy that includes a subdomain, and / or a policy that does not include a subdomain, and / or a policy that includes routing, and / or a policy that does not include routing.

[0040] If the path to be managed suffers from insufficient bandwidth, increased latency, or severe packet loss, and the management requirement is to optimize transmission quality, or to update the dynamic routing protocol, or if the network administrator has set policies, priority requirements, or security compliance requirements, then the routing management strategy for the path to be managed can be determined to be a strategy that increases the number of hops. Of course, other management requirements can also be used to determine the routing management strategy for the path to be managed to increase the number of hops; this application embodiment does not impose specific limitations.

[0041] If the control requirement is a dynamic routing protocol update, a route unreachable condition, or a next-hop policy set by the network administrator, then this control requirement can be used to determine that the routing control policy for the path to be controlled is a policy to modify the next hop. Of course, other control requirements can also be used to determine that the routing control policy for the path to be controlled is a policy to modify the next hop; this application embodiment does not impose specific limitations.

[0042] If the control requirement is to monitor and audit through a specific subdomain (such as a firewall or intrusion detection system), or if the control requirement is network security and data isolation, or if the control requirement is that the network administrator has set up a specific subdomain, then the routing control policy for the path to be controlled can be determined to be a policy that includes the subdomain based on this control requirement. Of course, other control requirements can also be used to determine the routing control policy for the path to be controlled to be a policy that includes the subdomain; no specific limitations are made in this embodiment.

[0043] If the control requirement is security, high performance, compliance, or a specific dangerous subdomain set by the network administrator, then the routing control policy for the path to be controlled can be determined to be a policy that does not include subdomains. Of course, other control requirements can also be used to determine that the routing control policy for the path to be controlled is a policy that does not include subdomains; no specific limitations are imposed in this embodiment.

[0044] If the control requirement is for high service quality, security and compliance, or a network administrator's requirement that certain types of traffic must pass through a specific route, then the routing control policy for the path to be controlled can be determined to be a policy that includes routing, based on this control requirement. Of course, other control requirements can also be used to determine the routing control policy for the path to be controlled to be a policy that includes routing; this application embodiment does not impose specific limitations.

[0045] If the management requirement is to address performance bottlenecks, or if the management requirement is for security or access control, or if the management requirement is that the network administrator demands that the path not be traversed via a specific route, then the routing management policy for the path to be managed can be determined to be a policy that does not include routing, based on this management requirement. Of course, other management requirements can also be used to determine that the routing management policy for the path to be managed is a policy that does not include routing; no specific restrictions are imposed in this embodiment.

[0046] In other cases, the routing control strategy for the path to be controlled can be determined by combining the routing information in the path to be controlled and the control requirements. No specific restrictions are imposed in this embodiment.

[0047] In other cases, the routing control policy can be any routing control policy entered by the network administrator, and no specific restrictions are imposed in the embodiments of this application.

[0048] Step 302: Determine the target path based on the path to be managed, the routing management policy, and the preset path generation algorithm.

[0049] The target path includes: a source node, multiple second quantum key relay routes, and a destination node; the multiple first quantum key relay routes are not entirely the same as the multiple second quantum key relay routes.

[0050] When a route management policy is used to specify a particular route in the path to be managed, the route management policy modifies the path to be managed, and then a target path from the source node to the destination node is generated by a preset path generation algorithm.

[0051] When the routing control policy does not specify a particular route in the path to be controlled, the target path from the source node to the destination node is generated by the preset path generation algorithm, the routing control policy, and the source and destination nodes.

[0052] For example, such as Figure 1As shown, the path to be managed is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node). The determined target path can be: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0053] Step 303: Send the target path to each route and node in the target path.

[0054] Each route and node in the target path can determine the next hop of the route through the target path, thus successfully achieving key sharing between remote QKD nodes.

[0055] When computing routing between user nodes, the quantum key control server adds routing strategies, allowing different user nodes to choose different routing paths in the quantum communication network.

[0056] In this embodiment of the application, based on the existing path (path to be managed) generated by the prior art, different routing management strategies are selected according to management requirements. In the quantum communication network, a target path different from the existing path is selected to reduce the number of the same relay routes that different end-to-end communication paths pass through, thereby improving the utilization rate of the routes in the network. Furthermore, the carrying capacity of the same relay route is reduced, thereby improving the reliability of the routes.

[0057] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control strategy includes a strategy of increasing the number of routing hops, step 302, determining the target path according to the path to be controlled, the routing control strategy, and the preset path generation algorithm, includes: determining specific quantum key relay routing pairs in the path to be controlled according to the routing control strategy; increasing the preset number of hops between the specific quantum key relay routing pairs in the path to be controlled; and determining the target path based on the preset path generation algorithm and the path to be controlled after increasing the preset number of hops.

[0058] When routing control strategies include increasing the hop count, these strategies correspond to pre-defined specific quantum key relay routing pairs. For example, selecting the middle two first quantum key relay routes from multiple first quantum key relay routes as a pre-defined specific quantum key relay routing pair. Figure 1As shown, when the path to be managed is: User Node 1 (source node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, and User Node 2 (destination node), based on the strategy of increasing the number of routing hops and the multiple First Quantum Key Relay Routes in the path to be managed, it can be determined that a specific Quantum Key Relay Route pair can be: First Quantum Key Relay Route 1 and First Quantum Key Relay Route 2, or First Quantum Key Relay Route 2 and First Quantum Key Relay Route 3. One of these two cases can be randomly selected as the specific Quantum Key Relay Route pair.

[0059] In other cases, the specific quantum key relay routing pairs and the preset number of hops in the path to be managed can both be selected and entered by the network administrator.

[0060] If the specific quantum key relay routing pair in the determined path to be managed is the first quantum key relay route 1 and the first quantum key relay route 2, then... Figure 1 As shown, a preset number of hops can be added to the original number of hops between the first quantum key relay route 1 and the first quantum key relay route 2. When the preset number of hops is 9, after adding the preset number of hops, the number of hops between the first quantum key relay route 1 and the first quantum key relay route 2 is 10.

[0061] In this embodiment of the application, the principle of the preset path generation algorithm is to minimize the number of hops. Therefore, as Figure 1 As shown, when the path to be managed is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), after the hop count between First Quantum Key Relay Route 1 and First Quantum Key Relay Route 2 is 10, according to the hop count principle of the preset path generation algorithm, the hop count from 1, 2 to 3 in the backbone network is 11, which is greater than the hop count from 1, 4, 5, 6 to 3 (4). Therefore, the route from User Node 1 to User Node 2 will preferentially choose the path from 1, 4, 5, 6 to 3. Thus, the final target path can be determined as: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0062] In this application embodiment, the routing control strategy includes a strategy of increasing the number of routing hops. By increasing the number of hops of a specific quantum key relay routing pair in the path to be controlled, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routing in the network, and reducing the load of the same relay route, thereby improving the reliability of routing.

[0063] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control strategy includes modifying the next hop strategy, step 302, determining the target path according to the path to be controlled, the routing control strategy, and the preset path generation algorithm, includes: determining a specific quantum key relay route in the path to be controlled according to the routing control strategy; setting the next hop of the specific quantum key relay route in the path to be controlled as the preset quantum key relay route; and determining the target path based on the preset path generation algorithm, the path to be controlled, and the next hop preset quantum key relay route of the second specific quantum key relay route.

[0064] The routing control strategy includes modifying the next-hop strategy by first selecting a specific quantum key relay route in the path to be controlled. The strategy for modifying the next hop corresponds to a preset specific quantum key relay route. For example, selecting the second first quantum key relay route among multiple first quantum key relay routes as the preset specific quantum key relay route. In this case, the specific quantum key relay route can be determined to be: first quantum key relay route 1.

[0065] When setting the next hop of a specific quantum key relay route in the path to be managed to a preset quantum key relay route, the preset quantum key relay route can be determined by the corresponding route management policy. For example, the preset quantum key relay route is route 4.

[0066] In other cases, the specific quantum key relay route and the quantum key relay route in the path to be managed can both be selected and entered by the network administrator.

[0067] If the next hop of a specific quantum key relay route is determined to be a preset quantum key relay route, such as... Figure 1 As shown, the next hop of the first quantum key relay route 1 is set to route 4.

[0068] like Figure 1As shown, when the path to be managed is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), based on the setting that the next hop of the First Quantum Key Relay Route 1 is Route 4 and the preset path generation algorithm, the final target path that can be determined is: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0069] In this embodiment of the application, the routing control strategy includes a strategy for modifying the next hop. By setting the next hop of a specific quantum key relay route in the path to be controlled to a preset quantum key relay route, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routes in the network, and reducing the load of the same relay route, thereby improving the reliability of the route.

[0070] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control strategy includes a strategy that includes subdomains, step 302, determining the target path according to the path to be controlled, the routing control strategy, and the preset path generation algorithm, includes: determining the domains that the target path passes through according to the routing control strategy; and determining the target path based on the preset path generation algorithm, the domains that the target path passes through, and the path to be controlled.

[0071] When a routing control policy includes a policy that includes subdomains, the policy that includes subdomains corresponds to a preset traversal domain. For example, such as... Figure 1 As shown, the preset transit domain can be backbone network 1.

[0072] In other cases, the domain can be selected and entered by the network administrator.

[0073] If the traversed domain is determined to be backbone network 1, such as Figure 1 As shown, the target path must pass through this backbone network 1.

[0074] like Figure 1As shown, when the path to be managed is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), based on the fact that the target path must pass through the backbone network 1 and the preset path generation algorithm, the final target path that can be determined is: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0075] In this application embodiment, the routing control strategy includes a subdomain strategy. By setting the subdomains that a path must pass through, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routes in the network, and reducing the load of the same relay routes, thereby improving the reliability of the routes.

[0076] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control policy includes a policy that does not include subdomains, step 302, determining the target path according to the path to be controlled, the routing control policy, and the preset path generation algorithm, includes: determining the domains that the target path does not pass through according to the routing control policy; and determining the target path based on the preset path generation algorithm, the domains that the target path does not pass through, and the path to be controlled.

[0077] When routing control policies include policies that do not include subdomains, policies that include subdomains correspond to the default policy of not traversing the specified domain. For example, such as... Figure 1 As shown, the preset non-passing domain can be backbone network 2.

[0078] In other cases, bypassing the domain can be selected and entered by the network administrator.

[0079] If it is determined that the backbone network 2 will not pass through domain 2, such as Figure 1 As shown, the target path must not pass through this backbone network 2.

[0080] like Figure 1As shown, when the path to be controlled is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), based on the principle that the target path must not pass through the backbone network 2 and the preset path generation algorithm, the final target path that can be determined is: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0081] In this embodiment of the application, the routing control strategy includes a strategy that does not include subdomains. By setting subdomains that a path cannot pass through, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routes in the network, and reducing the load of the same relay routes, thereby improving the reliability of the routes.

[0082] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control strategy includes a policy containing routes, step 302, determining the target path according to the path to be controlled, the routing control strategy, and the preset path generation algorithm, includes: determining the route through which the target path passes according to the routing control strategy; and determining the target path based on the preset path generation algorithm, the route through which the target path passes, and the path to be controlled.

[0083] When a route management policy includes a policy that contains routes, the policy containing routes corresponds to a predefined route. For example, such as... Figure 1 As shown, the preset route can be route 5.

[0084] In other cases, the route can be selected and entered by the network administrator.

[0085] If the route is determined to be route 5, such as Figure 1 As shown, the target path must pass through route 5.

[0086] like Figure 1As shown, when the path to be managed is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), based on the fact that the target path must pass through this route 5 and the preset path generation algorithm, the final target path that can be determined is: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0087] In this embodiment of the application, the routing control strategy includes a routing strategy. By setting a path to require a route to pass through, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routes in the network, and reducing the load of the same relay route, thereby improving the reliability of the route.

[0088] In the above Figure 3 Based on the path control method shown, this application embodiment also provides another path control method. When the routing control policy includes a policy that does not include routing, step 302, determining the target path according to the path to be controlled, the routing control policy, and the preset path generation algorithm, includes: determining the routes that the target path does not pass through according to the routing control policy; and determining the target path based on the preset path generation algorithm, the routes that the target path does not pass through, and the path to be controlled.

[0089] When routing control policies include policies that do not include routes, these policies correspond to the default behavior of not traversing the route. For example, such as... Figure 1 As shown, the default route that does not go through is route 2.

[0090] In other cases, bypassing the route can be selected and entered by the network administrator.

[0091] If it is determined that route 2 is the one that does not go through the route, such as Figure 1 As shown, the target path must not pass through route 2.

[0092] like Figure 1As shown, when the path to be controlled is: User Node 1 (Source Node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (Destination Node), based on the principle that the target path must not pass through Route 2 and the preset path generation algorithm, the final target path that can be determined is: User Node 1 (Source Node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (Destination Node).

[0093] In this application embodiment, the routing control strategy includes a strategy that does not include routing. By setting a path that must not pass through a route that does not pass through a route, a target path different from the existing path is selected, reducing the number of the same relay routes that different end-to-end communication paths pass through, improving the utilization rate of routes in the network, and reducing the load of the same relay route, thereby improving the reliability of the route.

[0094] In the embodiments of this application, the routing control policy may include multiple policies at the same time, such as a policy to increase the number of routing hops and a policy to include subdomains.

[0095] like Figure 1 As shown, the specific work item corresponding to the strategy of increasing the routing hop count can be: adding a preset hop count to the original hop count between the first quantum key relay route 1 and the first quantum key relay route 2. When the preset hop count is 9, after adding the preset hop count, the hop count between the first quantum key relay route 1 and the first quantum key relay route 2 will be 10. The specific work item corresponding to the strategy of including subdomains can be: the target path must pass through backbone network 1.

[0096] like Figure 1 As shown, when the path to be managed is: User Node 1 (source node), First Quantum Key Relay Route 11, First Quantum Key Relay Route 1, First Quantum Key Relay Route 2, First Quantum Key Relay Route 3, First Quantum Key Relay Route 31, User Node 2 (destination node), the final identifiable target path is: User Node 1 (source node), Second Quantum Key Relay Route 11, Second Quantum Key Relay Route 1, Second Quantum Key Relay Route 4, Second Quantum Key Relay Route 5, Second Quantum Key Relay Route 6, Second Quantum Key Relay Route 3, Second Quantum Key Relay Route 31, User Node 2 (destination node). This target path satisfies both the requirement of increasing the routing hop count and the requirement of including a subdomain.

[0097] In this embodiment, the preset path generation algorithm uses the number of path keys and the number of route hops as weights. The key generation control servers across the entire network share key quantities. The key collaboration processing server statistically calculates the routing table, generating multiple reachable routes. Following the principle of minimizing hop counts, if the hop counts are the same, the server with the larger key quantity takes priority, and the optimal routing table is sent to the requesting party.

[0098] In the quantum communication network provided in this application, the quantum key relay routing is managed by a strategy based on the network operation and user distribution. When the quantum key control server calculates the routing between user nodes, it enables different user nodes to choose different routing paths in the quantum communication network through different routing strategies. This ensures that the user nodes have the right to quantum keys and improves the key utilization rate of the quantum communication network.

[0099] This application improves the utilization rate of keys in quantum communication networks and avoids key waste. Existing key routing only considers the reachability of key routes between user nodes, while ignoring the high value of quantum keys themselves, resulting in waste after key generation.

[0100] This application enables the access of more cross-domain users on the basis of existing quantum communication networks. Based on the average and limit values ​​of the coding rate of different backbone networks, and combined with the actual key consumption of users, reasonable planning allows the entire quantum communication network to support more users without expansion.

[0101] The steps of the various methods described above are only for clarity. In practice, they can be combined into one step or some steps can be split into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent. Adding insignificant modifications or introducing insignificant designs to the algorithm or process, but without changing the core design of the algorithm and process, are also within the scope of protection of this patent.

[0102] This application relates to a quantum key control server. Figure 4 This is a schematic diagram of the structure of a quantum key control server provided in an embodiment of this application, as shown below. Figure 4 As shown, it includes: at least one processor 401; and a memory 402 communicatively connected to at least one processor 401; wherein the memory 402 stores instructions executable by at least one processor 401, the instructions being executed by at least one processor 401 to enable at least one processor 401 to execute the path control methods in the above embodiments.

[0103] The memory 402 and the processor 401 are connected by a bus, which can include any number of interconnected buses and bridges, and connect various circuits of one or more processors and the memory together.

[0104] This application relates to a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, it implements the method embodiments described above.

[0105] That is, those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing related hardware. This program is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0106] This application relates to a computer program product storing a computer program. When the computer program is executed by a processor, it implements the method embodiments described above.

[0107] Those skilled in the art will understand that the above embodiments are specific embodiments for implementing this application, and in practical applications, various changes can be made to them in form and detail without departing from the spirit and scope of this application.

Claims

1. A path control method, characterized in that, The method includes: Based on the acquired control requirements, a routing control strategy for the path to be controlled is determined; wherein, the path to be controlled includes: a source node, multiple first quantum key relay routes, and a destination node; Based on the path to be managed, the routing management strategy, and the preset path generation algorithm, a target path is determined; wherein, the target path includes: the source node, multiple second quantum key relay routes, and the destination node; the multiple first quantum key relay routes are not completely identical to the multiple second quantum key relay routes; Send the target path to each route and node in the target path.

2. The path control method according to claim 1, characterized in that, When the routing control strategy includes a strategy to increase the number of route hops, determining the target path based on the path to be controlled, the routing control strategy, and a preset path generation algorithm includes: Based on the routing control strategy, a specific quantum key relay routing pair in the path to be controlled is determined; A preset number of hops is added between specific quantum key relay routing pairs in the path to be managed; The target path is determined based on the preset path generation algorithm and the path to be managed after adding the preset number of hops.

3. The path control method according to claim 1, characterized in that, When the routing control policy includes modifying the next-hop policy, determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: Based on the routing control strategy, a specific quantum key relay route in the path to be controlled is determined; Set the next hop of a specific quantum key relay route in the path to be managed to a preset quantum key relay route; The target path is determined based on the preset path generation algorithm, the path to be managed, and the next-hop preset quantum key relay route of the second specific quantum key relay route.

4. The path control method according to claim 1, characterized in that, When the routing control policy includes a policy that incorporates subdomains, determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: Based on the routing control policy, the domains traversed by the target path are determined; The target path is determined based on the preset path generation algorithm, the domain traversed by the target path, and the path to be managed.

5. The path control method according to claim 1, characterized in that, When the routing control policy includes a policy that does not include subdomains, determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: Based on the routing control policy, determine the domains that the target path will not pass through; The target path is determined based on the preset path generation algorithm, the domains that the target path does not pass through, and the path to be managed.

6. The path control method according to claim 1, characterized in that, When the routing control policy includes a policy that includes routing, determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: Based on the routing control policy, the route traversed by the target path is determined; The target path is determined based on the preset path generation algorithm, the route taken by the target path, and the path to be managed.

7. The path control method according to claim 1, characterized in that, When the routing control policy includes a policy that does not include routing, determining the target path based on the path to be controlled, the routing control policy, and a preset path generation algorithm includes: Based on the routing control policy, determine the routes that the target path should not traverse; The target path is determined based on the preset path generation algorithm, the route not traversed by the target path, and the path to be managed.

8. A quantum communication network, characterized in that, include: The system comprises a quantum key distribution server, a backbone network, a metropolitan area network, a source node, and a target node; wherein the number of backbone networks is greater than or equal to 1, and the number of metropolitan area networks is greater than 1. When the number of backbone networks is greater than 1, the multiple backbone networks are interconnected, and the metropolitan area network is connected to a designated backbone network among the multiple backbone networks. When the number of backbone networks is equal to 1, the metropolitan area network is connected to the backbone network; The metropolitan area network is connected to the source node or the target node; the quantum key control server is connected to the backbone network and the metropolitan area network; the backbone network contains multiple interconnected routes, and the metropolitan area network contains multiple interconnected routes or one route; The quantum key control server is used to execute the path control method according to any one of claims 1-7.

9. A quantum key control server, characterized in that, include: At least one processor; And, a memory communicatively connected to the at least one processor; The memory stores instructions that can be executed by the at least one processor, which are executed by the at least one processor to enable the at least one processor to perform the path control method according to any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the path control method according to any one of claims 1 to 7.

Images