A routing system based on quantum key slicing network

Abstract

The application discloses a routing selection system based on a quantum key slice network, and the routing selection system comprises a demand preprocessing module, a routing decision module, a quantum key slice network and a quantum key network application access layer; the demand preprocessing module is in communication connection with the quantum key network application access layer through a plurality of routing decision modules, wherein each routing decision module is in communication connection with the quantum key network application access layer through a corresponding quantum key slice network; wherein the quantum key slice network is composed of quantum routing nodes; a communication initiator User A is in communication connection with the demand processing module in the routing selection system, and a communication acceptor User B is in communication connection with the quantum key network application access layer; the routing selection system improves the routing selection efficiency in some specific scenarios using the quantum password network for communication, thereby obtaining a higher quality quantum secret communication experience.

Description

Technical Field

[0001] This invention belongs to the field of quantum communication technology, and in particular relates to a routing system based on quantum key slicing networks. Background Technology

[0002] Quantum communication is a newly emerging interdisciplinary field that has developed in recent years, combining quantum theory and information theory. Currently, this discipline is gradually moving from theory to experiment and is developing towards practical application. Its efficient and secure information transmission is attracting increasing attention.

[0003] At the physics level, quantum communication can be understood as high-performance communication achieved using quantum effects under physical limits. At the information science level, quantum communication can be considered as using fundamental principles of quantum mechanics (such as the no-cloning principle of quantum states and the measurement collapse property of quantum states) or properties unique to quantum systems, such as quantum teleportation, as well as quantum measurement methods to complete the transmission of information between two points.

[0004] Quantum cryptography, based on the quantum key distribution (QKD) protocol, is one of the most important applications of quantum communication. Traditional cryptography is a mathematically based cryptographic system, while quantum cryptography is based on quantum mechanics. Its security is built upon physical properties such as the uncertainty principle, the no-cloning principle of quantum mechanics, and quantum coherence, and has been proven to be absolutely secure. Therefore, quantum cryptography has attracted great attention from the academic community.

[0005] Quantum cryptography networks are secure communication networks employing quantum cryptography technology. They consist of both classical communication networks and QKD (Quadratic Key Digitization) networks. The QKD network primarily comprises QKD terminal devices and quantum links, used for quantum key generation and distribution. The classical communication network uses quantum keys for data encryption, decryption, and ciphertext transmission. A typical quantum cryptography network node consists of a classical communication terminal connected to the classical communication network and a QKD device terminal connected to the quantum communication network. Quantum cryptography network nodes are generally categorized as terminal nodes and relay nodes. Due to the limitation of maximum distance in quantum communication and considerations for network construction costs, many terminals lack direct quantum links, making direct quantum key distribution impossible. Encrypted communication data between them requires relay nodes for forwarding.

[0006] Large-scale quantum cryptography networks have a large number of relay nodes. Encrypted communication data between terminal nodes is relayed through one or more relay nodes, and different relay nodes are available during data relay. How to select the relay nodes that the communication data between any two nodes in a quantum cryptography network must pass through in sequence from the initial node to the destination node is called the routing of the quantum cryptography network.

[0007] However, due to the low key generation rate of current quantum key distribution devices, quantum keys are a scarce resource in quantum cryptography networks. Without proper routing selection within the quantum cryptography network, communication quality can degrade, or even communication may fail. Therefore, appropriate methods and rules are needed to select paths with sufficient key quantity and relatively low routing overhead to ensure the overall quality of quantum cryptography network communication.

[0008] Currently, the common practice for quantum key requests is to submit them uniformly to the quantum cryptography network without distinction, and then the routing decision and key distribution system in the quantum cryptography network selects the communication route and distributes the quantum key for the corresponding key request.

[0009] However, communication data comes in many different types, such as video, voice, and text. Each data type has a different transmission rate, resulting in variations in the required communication bandwidth and the amount of quantum keys consumed per unit time. Therefore, it is necessary to match different types of communication data with corresponding network bandwidth and quantum key services to ensure better communication quality in quantum cryptography networks. Summary of the Invention

[0010] The purpose of this invention is to address the problem of decreased communication efficiency caused by the mismatch between network bandwidth and routing selection in quantum cryptography networks when quantum key requirements are clearly defined. This invention discloses a routing system based on quantum key slicing networks, which can improve routing efficiency in specific scenarios where quantum cryptography networks are used for communication, thereby achieving a higher quality quantum secure communication experience.

[0011] The objective of this invention is achieved through the following technical solution:

[0012] A routing system based on a quantum key slicing network, the routing system comprising: a demand preprocessing module, a routing decision module, a quantum key slicing network, and a quantum key network application access layer;

[0013] The demand preprocessing module is connected to the quantum key network application access layer via several routing decision modules. Each routing decision module is connected to the quantum key network application access layer via a corresponding quantum key slicing network. The quantum key slicing network is composed of quantum routing nodes.

[0014] The communication initiator UserA communicates with the demand processing module in the routing system, and the communication receiver UserB communicates with the quantum key network application access layer.

[0015] The demand preprocessing module is used to process the communication demand of the communication initiator UserA. The routing decision module is configured to calculate the corresponding communication path in the quantum key slicing network according to preset rules based on the communication demand forwarded by the demand preprocessing module. The quantum key slicing network is used to realize the encrypted transmission of communication data. The quantum key network application access layer is used to send the received data to the communication receiver UserB.

[0016] According to a preferred embodiment, the communication initiator UserA is configured to send the total number of keys required for this communication, the communication duration, the communication data type, and the number of keys required for each type of communication data to the demand preprocessing module according to its own communication needs.

[0017] According to a preferred embodiment, the communication data types include text, voice, files, and video.

[0018] According to a preferred embodiment, the demand preprocessing module is configured to operate according to the following process:

[0019] First, the demand preprocessing module prioritizes each key slice network according to each type of communication data, and sets the key slice network that matches the type of communication data to the highest priority.

[0020] Then, the remaining key slice networks are set as priority from high to low according to bandwidth and transmission rate from large to small;

[0021] Next, the demand processing module checks whether there is an available path in the corresponding quantum key slicing network that can meet the corresponding quantum key requirements for the key amount required for each type of communication data. If there is an available path in the corresponding quantum key slicing network, a session is established for the communication initiator. If there is no available path, the module checks in turn whether there is an available path in the lower priority key slicing networks that can meet the corresponding quantum key requirements.

[0022] Furthermore, if an available path exists in the low-priority quantum key slicing network, a session is established for the communication initiator; otherwise, relevant information is fed back to the communication initiator, who then decides on subsequent actions, such as continuing to wait for an available path to be released or abandoning the communication.

[0023] According to a preferred embodiment, the routing decision module updates the topology information of the corresponding quantum key slice network by broadcasting within a periodic period. For communication requests forwarded by the demand preprocessing module, the routing decision module calculates the available routing resources and performs communication based on the calculated path.

[0024] When no available path exists in the corresponding key slice network, the relevant information is fed back to the demand preprocessing module, which then decides on the subsequent operations.

[0025] According to a preferred embodiment, the topology information of the quantum key slicing network includes the adjacency matrix of the quantum key slicing network, the amount of available quantum keys for node links, and the key generation rate for the corresponding links of the nodes.

[0026] According to a preferred embodiment, the method for calculating available routing resources by the routing decision module includes:

[0027] 1) Based on the k-shortest path algorithm, find the first k shortest paths in the corresponding quantum key slice network and put the found paths into the path set Q;

[0028] 2) Based on the corresponding quantum key requirement, remove paths in set Q where the available quantum key quantity for each node does not meet the requirements;

[0029] 3) Compare the number of hops for the remaining different paths in Q and sort them from fewest to most;

[0030] 4) Select the path with the fewest hops. If the path with the fewest hops is not unique, compare the key generation rates of each node on the path with the fewest hops and sort them from fastest to slowest.

[0031] 5) Choose the path with the fastest key generation rate from 4).

[0032] According to a preferred embodiment, each quantum routing node in the quantum key slicing network stores its own node and adjacent link information and node configuration information, and is also configured to implement time-division multiplexing management of quantum keys.

[0033] According to a preferred embodiment, the quantum routing node is configured to update its own node and adjacent link information in real time, and periodically broadcast the relevant information to the routing decision module corresponding to the quantum key slicing network where the node is located, thereby updating the corresponding topology information.

[0034] According to a preferred embodiment, the time-division multiplexing management of quantum keys by the routing node includes: after the current node is included in the routing path of a communication request, the node itself allocates a time slice to the communication request, and at the same time allocates the quantum key required by the communication request to the time slice, and subtracts the time slice and quantum key allocated this time from the total time slice and the number of available quantum keys of the node link, respectively.

[0035] Once a node's time slice and available quantum key allocation are exhausted, its state remains unavailable until the corresponding time slice is released and the node has sufficient available quantum keys again.

[0036] Definitions:

[0037] Quantum routing node: An independent hardware and software terminal device based on QKD equipment, providing quantum key generation and distribution services for quantum key application terminals. In the network topology, it appears as an endpoint of a link.

[0038] Available quantum key quantity on a node link: The number of unassigned, free quantum keys on a link between two interconnected quantum routing nodes.

[0039] Key generation rate of the link corresponding to the node: the rate at which the QKD device corresponding to the link between two interconnected quantum routing nodes generates quantum keys belonging to that link.

[0040] Quantum cryptography slicing network: The quantum cryptography network is configured and divided according to the line bandwidth and the key generation rate of the corresponding link of the node. Devices and networks with large line bandwidth and high key generation rate are given priority to quantum key requirements with high bandwidth and high transmission rate. In this way, different functional networks are divided, which is called quantum cryptography slicing network.

[0041] The aforementioned main solution of the present invention and its various further alternative solutions can be freely combined to form multiple solutions, all of which are solutions that can be adopted and are claimed by the present invention. Those skilled in the art, after understanding the solution of the present invention, will realize that there are many combinations based on existing technology and common knowledge, all of which are technical solutions to be protected by the present invention, and will not be exhaustively listed here.

[0042] The beneficial effects of this invention are:

[0043] Through the design of each module of the routing system of this invention, in scenarios where the communicating party provides quantum key requirements, communication slicing can be achieved by dividing the communication data types to make the best use of the quantum cryptography network. That is, the quantum cryptography network is functionally divided according to its performance, so that it can provide targeted services for quantum key requirements and achieve the goal of efficient utilization of the quantum cryptography network. At the same time, time-division multiplexing is used to allocate time slices and quantum key resources to each communication requirement, realizing the parallelization of communication requirements and improving the communication efficiency of the entire quantum key network. Attached Figure Description

[0044] Figure 1 This is a schematic diagram of the system structure of the routing system of the present invention;

[0045] Figure 2 This is a diagram of the quantum routing node structure in the routing system of this invention;

[0046] Figure 3 This is a schematic diagram of the workflow in the routing system of this invention. Detailed Implementation

[0047] The following specific examples illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that, unless otherwise specified, the following embodiments and features described therein can be combined with each other.

[0048] It should be noted that similar reference numerals and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. Furthermore, it should be pointed out that unless otherwise specified, the structures, connections, positional relationships, power source relationships, etc., involved in this invention are all things that those skilled in the art can discover without creative effort based on existing technology.

[0049] Example 1:

[0050] refer to Figure 1 As shown in the figure, a routing system based on a quantum key slicing network is illustrated.

[0051] User A wants to initiate communication with User B. The quantum key requirements for this communication are: 2 MBytes for text communication; 20 MBytes for voice communication; and 120 MBytes for file communication. The communication duration is 1 hour. The routing process for the entire communication is as follows:

[0052] 1. Quantum routing nodes in each quantum slicing network periodically broadcast node information and adjacent link information to the corresponding routing decision module;

[0053] 2. After receiving the broadcast from the node, the routing decision module corresponding to each quantum key slicing network updates the topology information if there is a change; otherwise, it remains unchanged.

[0054] 3. UserA initiates a communication request with UserB to the demand processing module and sends the key request to the demand processing module;

[0055] 4. Upon receiving a communication request from UserA, the request processing module sets the corresponding quantum cryptography slicing network priority sequence according to the text, voice, and file communication requests (e.g., for text communication requests, the quantum cryptography slicing network priority sequence is set as follows: text quantum cryptography slicing network priority 0; video quantum cryptography slicing network priority 1; voice quantum cryptography slicing network priority 2; file quantum cryptography slicing network priority 3). Then, the text, voice, and file communication requests are distributed to the routing decision modules with a priority of 0, namely routing decision modules 1, 2, and 3, respectively.

[0056] 5. Based on the routing calculation principles mentioned above, the routing decision module derives three paths: L1, L2, and L3.

[0057] 6. The routing decision system sends the communication request to each node in the selected paths L1, L2, and L3 of the quantum routing slice network;

[0058] 7. Each node in L1, L2, and L3 allocates a time slice for the communication request and subtracts the allocated time slice from the available time slices;

[0059] 8. Each node in L1, L2, and L3 matches the required amount of quantum key to the time slice allocated in 7, and subtracts the matched amount of quantum key from the available amount of quantum key in the node link.

[0060] Based on the above steps, the routing process for communication between UserA and UserB is completed.

[0061] Example 2

[0062] refer to Figure 1 As shown in the figure, a routing system based on a quantum key slicing network is illustrated.

[0063] UserA wants to initiate communication with UserB. The quantum key requirements for this communication are: 2 Mbytes for text communication key, and no available path exists in the quantum cryptographic slicing network corresponding to this text communication requirement. The routing process for the entire communication is as follows:

[0064] 1. Quantum routing nodes in each quantum slicing network periodically broadcast node information and adjacent link information to the corresponding routing decision module;

[0065] 2. After receiving the broadcast from the order accepter, the routing decision module corresponding to each quantum key slicing network updates the topology information if there are changes; otherwise, it remains unchanged.

[0066] 3. UserA initiates a communication request with UserB to the demand processing module and sends the key request to the demand processing module;

[0067] 4. When the request processing module receives the communication request from UserA, it sets the priority sequence of the quantum cryptography slice network corresponding to the text communication request as follows: text quantum cryptography slice network priority 0; video quantum cryptography slice network priority 1; voice quantum cryptography slice network priority 2; file quantum cryptography slice network priority 3). Then, it distributes the text, voice, and file communication requests to the routing decision module corresponding to the quantum cryptography slice network with priority 0, i.e., routing decision module 1.

[0068] 5. After calculation, it is found that there is no available path in the quantum cryptographic slicing network with priority 0 for this text communication requirement, so the routing decision result is fed back to the key requirement preprocessing module;

[0069] 6. The key requirement preprocessing module sends the text communication requirement to the routing decision module corresponding to the low-priority quantum cryptographic slicing network;

[0070] 7. Calculate whether there is an available path for the text communication requirement in this quantum cryptographic slicing network; if there is no available path, feed back the routing decision result to the key requirement preprocessing module and execute step 6; if there is an available path L, execute step 8.

[0071] 8. The routing decision system sends communication requests to each node in the selected path L in the quantum routing slice network;

[0072] Each node in 9.L allocates a time slice for the communication request and subtracts the allocated time slice from the available time slices;

[0073] In 10.L, each node matches the required amount of quantum key to the time slice allocated to 9.

[0074] 11. If no usable path is found after checking all priority quantum cryptographic slicing networks, the result is fed back to UserA, who then decides whether to continue waiting for a usable path to be released or to abandon communication.

[0075] Based on the above steps, the routing process for communication between UserA and UserB is completed.

[0076] Through the design of each module of the routing system of this invention, in scenarios where the communicating party provides quantum key requirements, communication slicing can be achieved by dividing the communication data types to make the best use of the quantum cryptography network. That is, the quantum cryptography network is functionally divided according to its performance, so that it can provide targeted services for quantum key requirements and achieve the goal of efficient utilization of the quantum cryptography network. At the same time, time-division multiplexing is used to allocate time slices and quantum key resources to each communication requirement, realizing the parallelization of communication requirements and improving the communication efficiency of the entire quantum key network.

[0077] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A routing system based on a quantum key slicing network, characterized in that, The routing system includes: a demand preprocessing module, a routing decision module, a quantum key slicing network, and a quantum key network application access layer; The demand preprocessing module is connected to the quantum key network application access layer via several routing decision modules. Each routing decision module is connected to the quantum key network application access layer via a corresponding quantum key slicing network. The quantum key slicing network is composed of quantum routing nodes. The communication initiator UserA communicates with the demand processing module in the routing system, and the communication receiver UserB communicates with the quantum key network application access layer. The demand preprocessing module is used to process the communication demand of the communication initiator UserA. The routing decision module is configured to calculate the corresponding communication path in the quantum key slicing network according to preset rules based on the communication demand forwarded by the demand preprocessing module. The quantum key slicing network is used to realize the encrypted transmission of communication data. The quantum key network application access layer is used to send the received data to the communication receiver UserB. The communication initiator UserA is configured to send the total number of keys required for this communication, the communication duration, the communication data type, and the number of keys required for each type of communication data to the demand preprocessing module according to its own communication needs. The demand preprocessing module is configured to operate according to the following process: First, the demand preprocessing module prioritizes each key slice network according to each type of communication data, and sets the key slice network that matches the type of communication data to the highest priority. Then, the remaining key slice networks are set as priority from high to low according to bandwidth and transmission rate from large to small; Next, the demand processing module checks whether there is an available path in the corresponding quantum key slicing network that can meet the corresponding quantum key requirements for the key amount required for each type of communication data. If there is an available path in the corresponding quantum key slicing network, a session is established for the communication initiator. If there is no available path, the module checks in turn whether there is an available path in the lower priority key slicing networks that can meet the corresponding quantum key requirements. Furthermore, if an available path exists in the low-priority quantum key slicing network, a session is established for the communication initiator; otherwise, relevant information is fed back to the communication initiator, who then decides on subsequent actions, such as continuing to wait for an available path to be released or abandoning the communication.

2. The routing system as described in claim 1, characterized in that, The communication data types include text, voice, files, and video.

3. The routing system as described in claim 1, characterized in that, The routing decision module updates the topology information of the corresponding quantum key slice network through broadcasting within a periodic period. For communication requests forwarded by the demand preprocessing module, the routing decision module calculates the available routing resources and performs communication based on the calculated path. When no available path exists in the corresponding key slice network, the relevant information is fed back to the demand preprocessing module, which then decides on the subsequent operations.

4. The routing system as described in claim 3, characterized in that, The topology information of the quantum key slicing network includes the adjacency matrix of the quantum key slicing network, the amount of available quantum keys for each node link, and the key generation rate for the corresponding link of each node.

5. The routing system as described in claim 3, characterized in that, The methods used by the routing decision module to calculate available routing resources include: 1) Based on the k-shortest path algorithm, find the first k shortest paths in the corresponding quantum key slice network and put the found paths into the path set Q; 2) Based on the corresponding quantum key requirement, remove paths in set Q where the available quantum key quantity for each node does not meet the requirements; 3) Compare the number of hops for the remaining different paths in Q and sort them from fewest to most; 4) Select the path with the fewest hops. If the path with the fewest hops is not unique, compare the key generation rates of each node on the path with the fewest hops and sort them from fastest to slowest. 5) Choose the path with the fastest key generation rate from 4).

6. The routing system as described in claim 3, characterized in that, Each quantum routing node in the quantum key slicing network stores its own node and adjacent link information, as well as node configuration information. It is also configured to implement time-division multiplexing management of quantum keys.

7. The routing system as described in claim 6, characterized in that, The quantum routing node is configured to update its own node and adjacent link information in real time, and periodically broadcast the relevant information to the routing decision module corresponding to the quantum key slicing network where the node is located, thereby updating the corresponding topology information.

8. The routing system as described in claim 7, characterized in that, The time-division multiplexing management of quantum keys by the routing node includes: after the current node is included in the routing path of a communication request, the node itself allocates a time slice to the communication request, and at the same time allocates the quantum key required by the communication request to the time slice, and subtracts the time slice and quantum key allocated this time from the total time slice and the number of available quantum keys of the node link, respectively. Once a node's time slice and available quantum key allocation are exhausted, its state remains unavailable until the corresponding time slice is released and the node has sufficient available quantum keys again.

Images