CN117134895A - QKD network route addressing method based on QKP, storage device and intelligent terminal - Google Patents

QKD network route addressing method based on QKP, storage device and intelligent terminal Download PDF

Info

Publication number
CN117134895A
CN117134895A CN202311067628.9A CN202311067628A CN117134895A CN 117134895 A CN117134895 A CN 117134895A CN 202311067628 A CN202311067628 A CN 202311067628A CN 117134895 A CN117134895 A CN 117134895A
Authority
CN
China
Prior art keywords
qkd
request
key
relay
shortest path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311067628.9A
Other languages
Chinese (zh)
Inventor
郭邦红
贾洁
杜戈
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National Quantum Communication Guangdong Co Ltd
Original Assignee
National Quantum Communication Guangdong Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by National Quantum Communication Guangdong Co Ltd filed Critical National Quantum Communication Guangdong Co Ltd
Priority to CN202311067628.9A priority Critical patent/CN117134895A/en
Publication of CN117134895A publication Critical patent/CN117134895A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • H04L9/0855—Quantum cryptography involving additional nodes, e.g. quantum relays, repeaters, intermediate nodes or remote nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a QKD network routing addressing method based on QKP, comprising the following steps: acquiring system parameters in a QKD system of the joint relay; initial system variables; for a key request r sent by any QKD user end, adopting K shortest paths between node pairs corresponding to each request by adopting a K shortest path algorithm; comparing the key quantity K in the shortest path according to the priority of the shortest path l And a key requirement K for request r r The key quantity K is also compared in the next shortest path l And K r By analogy, if the number of times C of path change n If less than K, repeating continuously, if C n =k, then the request fails; computing the total blocking ratio BR of the QKD system of the joint relay r . The invention provides a multiplexing scheme based on a QKD network, which reduces the blocking rate of QKD requests.

Description

QKD network route addressing method based on QKP, storage device and intelligent terminal
Technical Field
The invention relates to the field of quantum communication and quantum networks, in particular to a QKD network routing addressing method, a storage device and an intelligent terminal based on QKP.
Background
The cost deployment scheme in quantum key distribution lighting networks is ideally done, i.e. all QKD requests are assumed to be successfully routed. However, in a practical scenario, multiple QKD requests may not be successfully completed for encrypted transmission of information due to multiple factors such as insufficient key resources in the link, insufficient wavelengths, failure of the fiber link, etc. The lack of key resources for each link in the actual network is a big obstacle for the current QKD network to implement security information encryption.
The scheme of distributing the single-path QKD request key encryption information for the QKD request is simple, and once the selected path is researched based on the QKD network resource distribution theory of joint relay, the QKD request fails immediately, so that the traffic cannot be transmitted safely in an encryption mode.
Therefore, the existing network scheme needs to be improved, a method for routing and addressing the QKD network based on QKP is provided by fully utilizing a plurality of criss-cross links between the same pair of nodes in the QKD network, the shortest communication link is found out, the congestion rate of the QKD network is reduced, and the successful transmission efficiency of QKD users in the network is improved.
Disclosure of Invention
In order to solve the technical problems, a QKD network routing addressing method based on QKP is provided, which solves the problems of smaller network congestion and improves communication efficiency and success rate.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows: a QKD network routing addressing method based on QKP, the method being applied in a QKD system of a joint relay, the method comprising the steps of:
step S1, acquiring system parameters G (N, L), R, K in a QKD system of a joint relay l ，K r ，C n ，
Step S2 initial variable F l 、BR r 、SR r And->Let F l 、/>BR r 、SR r And->The initial values of (2) are all 0;
step S3: for a key request r sent by any QKD user end, adopting K shortest paths between node pairs corresponding to each request by adopting a K shortest path algorithm according to a sending end, a communication network and a receiving end of the key request r;
step S4, comparing the key quantity K in the shortest path according to the priority of the shortest path l And a key requirement K for request r r Is of a size of (a) and (b),
if K l >K r Directly selecting the path to carry out key distribution of QKD request;
if K l ≤K r Otherwise, selecting the shortest path to carry out key distribution of the QKD request;
step S5, the key quantity K is also compared in the next shortest path l And K r Is of a size of (a) and (b),
if K l >K r Directly selecting the path to carry out key distribution of QKD request;
if K l ≤K r Otherwise, selecting the shortest path of the next time to carry out key distribution of the QKD request;
step S6, according to the analogy of steps S4 and S5, if the number of times C of changing the path n If less than K, repeating continuously, if C n K, i.e. none of the K shortest paths can meet the key requirement of the QKD request, the request fails, and the number of failed requests is recorded;
step S7, calculating the total blocking rate BR of the QKD system of the combined relay r ；
Wherein: g (N, L) is represented as a QKD system network topology, N and L represent the collection of optical/QKD nodes and fiber links, respectively, R is the total number of QKD issued requests in the system network, F l In order to request the number of failed allocations,for average blocking rate, BR r For the blocking rate->Representing the averageSuccessful allocation rate, SR r For successful allocation rate, r is the key request issued by QKD, K r The key requirement for QKD request r.
Preferably, the blocking rate is defined as the total request of the request/QKD system for which the current allocation failed, and the calculation formula is as follows:
BR r ＝F l /R
where R represents the total QKD request number.
Preferably, the joint-relayed QKD system comprises a plurality of QKD nodes, a plurality of user BOBs, a plurality of quantum key pools and a plurality of joint relays,
the joint relay comprises a first untrusted relay, a second untrusted relay and a trusted relay;
any QKD node, the trusted relay and the receiving terminal BOB are connected through a KM link;
any one QKD node is in communication with a first untrusted relay through a quantum network, and the second untrusted relay is in communication with a corresponding receiving end BOB through the quantum network;
the first unreliable relay and the second unreliable relay are connected through an optical switch;
any QKD node and a receiving end BOB are connected with the corresponding quantum key pool;
the first quantum key pool and the second key pool are respectively connected with the trusted relay.
Preferably, the successful allocation rate is the total request of the request/QKD system to which the previous allocation was successful, and the computing company is as follows:
SR r ＝(R-F l )/R；
the sum of the blocking rate and the probability of successful allocation is 1.
Preferably, the average blockage rateDefined as the current allocation failed request/total requests that the QKD system has issued at a certain time node, the calculation formula is:
preferably, the average successful allocation rateDefined as the current successful allocation request/total requests issued by the QKD system at a certain time node, the calculation formula is expressed as:
preferably, the K-shortest path Algorithm employs the Yen's Algorithm Algorithm.
A storage device having stored therein a plurality of instructions adapted to be loaded by a processor and to perform one of the QKD network routing method step operations described above based on QKP.
An intelligent terminal comprising a processor for executing instructions and a storage device for storing instructions adapted to be loaded by the processor and to perform a QKD network routing method step operation as described above based on QKP.
The beneficial technical effects of the invention are as follows: 1) A multiplexing scheme based on a QKD network is provided, and for a known QKD request, the more key rates in a link are, the more paths are selected, the higher the success rate of successfully completing encrypted transmission of request traffic is, and the blocking rate of the QKD request is greatly reduced.
2) QKD network route addressing method based on QKP, combining K shortest path algorithm and comparing key quantity K in shortest path according to priority of shortest path l And a key requirement K for request r r Can calculate and obtain the total blocking rate BR of the QKD system of the optimal joint relay r 。
Drawings
FIG. 1 is a block diagram of the overall principles of a joint relay QKD system of the present invention;
fig. 2 is a schematic diagram of steps in a QKD network routing addressing method based on QKP in accordance with the present invention.
Detailed Description
The present invention will be further described in detail with reference to the following examples, for the purpose of making the objects, technical solutions and advantages of the present invention more apparent, but the scope of the present invention is not limited to the following specific examples.
In the QKD system of the present invention, as shown in fig. 1, the QKD system of the present invention includes a plurality of QKD nodes, a plurality of client BOBs, a plurality of quantum key pools, and a plurality of joint relays;
wherein any one of the joint relays includes a first untrusted relay, a second untrusted relay, and a trusted relay;
any QKD node, the trusted relay and the receiving terminal BOB are connected through a KM link;
any one QKD node is in communication with a first untrusted relay through a quantum network, and the second untrusted relay is in communication with a corresponding receiving end BOB through the quantum network;
the first unreliable relay and the second unreliable relay are connected through an optical switch;
any QKD node and a receiving end BOB are connected with the corresponding quantum key pool; the first quantum key pool and the second key pool are respectively connected with the trusted relay.
Based on the QKD system of the joint relay, the invention provides a QKD network routing addressing method based on QKP, which comprises the following steps:
step S1, acquiring system parameters G (N, L), R, K in a QKD system of a joint relay l ，K r ，C n ，
Step S2 initial variable F l 、BR r 、SR r And->Let F l 、/>BR r 、SR r And->The initial values of (2) are all 0;
wherein G (N, L) is represented as a QKD system network topology, N and L represent the collection of optical/QKD nodes and fiber links, respectively, R is the total number of QKD requests in the system network, K l For the key quantity, F l In order to request the number of failed allocations,for average blocking rate, BR r For the blocking rate->Represents the average successful allocation rate, SR r For successful allocation rate, r is the key request issued by QKD, K r The key requirement for QKD request r;
step S3: for a key request r sent by any QKD user, according to its sending end, communication network and receiving end, a K shortest path algorithm (the basic idea of the K shortest path algorithm is to find K shortest paths between node pairs corresponding to each request from the starting point to the front K short paths of each node in each iteration) is adopted;
step S4, comparing the key quantity K in the shortest path according to the priority of the shortest path l And a key requirement K for request r r Is of a size of (a) and (b),
if K l >K r Directly selecting the path to carry out key distribution of QKD request;
if K l ≤K r Otherwise, selecting the shortest path to carry out key distribution of the QKD request;
step S5, the key quantity K is also compared in the next shortest path l And K r Is of a size of (a) and (b),
if K l >K r Then directly select the pathPerforming key distribution of the QKD request;
if K l ≤K r Otherwise, selecting the shortest path of the next time to carry out key distribution of the QKD request;
step S6, according to the analogy of steps S4 and S5, if the number of times C of changing the path n If less than K, repeating continuously, if C n K, i.e. none of the K shortest paths can meet the key requirement of the QKD request, the request fails, and the number of failed requests is recorded;
step S7, calculating the total blocking rate BR of the QKD system of the combined relay r ；
Specifically, the blocking rate is defined as the total request of the request/QKD system that the current allocation failed, and the calculation formula is as follows:
BR r ＝F l /R
where R represents the total QKD request number.
The successful allocation rate is the total request of the request/QKD system which is successfully allocated before, and the calculation company is as follows:
SR r ＝(R-F l )/R；
the sum of the blocking rate and the probability of successful allocation is 1.
Preferably, the average blockage rateDefined as the current allocation failed request/total requests that the QKD system has issued at a certain time node, the calculation formula is:
preferably, the average successful allocation rateDefined as the current successful allocation request/total requests issued by the QKD system at a certain time node, the calculation formula is expressed as:
preferably, the K-shortest path Algorithm employs the Yen's Algorithm Algorithm.
In the present invention, the QKD user makes a request and then the algorithm splits the shortest route for the key request between the two nodes. Based on the shortest route, the system pre-determines whether the key stored on the shortest route can satisfy the encryption request of the QKD user. If the QKD user requires an encryption key less than or equal to the key stored on the link, the request can be transmitted encrypted by the key, with the request encrypting information successfully. If the encryption key required by the QKD user is greater than the key stored on the link, at which time the information that the QKD user needs to encrypt cannot be securely transmitted encrypted by the key on the link, the request is marked as failed and the number of failures is recorded.
In the K-shortest route algorithm, K shortest paths are simultaneously selected in the network according to the QKD traffic encryption requirements between pairs of determining nodes. And when the key quantity on the shortest path does not meet the QKD user request, immediately adopting a next shortest path scheme, and judging whether the key quantity on the next shortest path can meet the QKD user request again. And sequentially selecting and judging the condition of storing the key on the link from the shortest path, the next shortest path and the next shortest path, determining the link which can be met, distributing the key resource and finally realizing the information security encryption transmission. If all the selected K shortest paths do not meet the key requirement of the QKD user, the number of failed requests is marked at the moment. The blocking rate under the multipath routing scheme will be significantly reduced compared to the single-path routing scheme.
The key can be compared K times at most, if all the K shortest paths can not meet the key requirement of the QKD request, the request fails, and the failed request number is recorded. And finally, calculating the total blocking rate of the QKD system, and calculating the successful allocation rate of the QKD request according to the requirement. Finally, the total QKD requests are all calculated, and the blocking rate and the number of request allocation failures are returned.
The invention provides a multiplexing scheme based on a QKD network, for a known QKD request, the more key rates in a link are, the more paths are selected, the higher success rate of successfully completing the encrypted transmission of the request service is, and the blocking rate of the QKD request is greatly reduced.
A storage device having stored therein a plurality of instructions adapted to be loaded by a processor and to perform one of the QKD network routing method step operations described above based on QKP.
An intelligent terminal comprising a processor for executing instructions and a storage device for storing instructions adapted to be loaded by the processor and to perform a QKD network routing method step operation as described above based on QKP.
Variations and modifications to the above would be obvious to persons skilled in the art to which the invention pertains from the foregoing description and teachings. Therefore, the invention is not limited to the specific embodiments disclosed and described above, but some modifications and changes of the invention should be also included in the scope of the claims of the invention. In addition, although specific terms are used in the present specification, these terms are for convenience of description only and do not constitute any limitation on the invention.

Claims (9)

1. A QKD network routing addressing method based on QKP, characterized in that the method is applied in a QKD system of joint relay, comprising the steps of:
step S1, acquiring system parameters G (N, L), R, K in a QKD system of a joint relay l ，K r ，C n ，
Step S2 initial variable F l 、BR r 、SR r And->Let F l 、/>BR r 、SR r And->The initial values of (2) are all 0;
step S3: for a key request r sent by any QKD user end, adopting K shortest paths between node pairs corresponding to each request by adopting a K shortest path algorithm according to a sending end, a communication network and a receiving end of the key request r;
step S4, comparing the key quantity K in the shortest path according to the priority of the shortest path l And a key requirement K for request r r Is of a size of (a) and (b),
if K l >K r Directly selecting the path to carry out key distribution of QKD request;
if K l ≤K r Otherwise, selecting the shortest path to carry out key distribution of the QKD request;
step S5, the key quantity K is also compared in the next shortest path l And K r Is of a size of (a) and (b),
if K l >K r Directly selecting the path to carry out key distribution of QKD request;
if K l ≤K r Otherwise, selecting the shortest path of the next time to carry out key distribution of the QKD request;
step S6, according to the analogy of steps S4 and S5, if the number of times C of changing the path n If less than K, repeating continuously, if C n K, i.e. none of the K shortest paths can meet the key requirement of the QKD request, the request fails, and the number of failed requests is recorded;
step S7, calculating the total blocking rate BR of the QKD system of the combined relay r ；
Wherein: g (N, L) is represented as a QKD system network topology, N and L represent the collection of optical/QKD nodes and fiber links, respectively, R is the total number of QKD issued requests in the system network, F l In order to request the number of failed allocations,for average blocking rate, BR r For the blocking rate->Represents the average successful allocation rate, SR r For successful allocation rate, r is the key request issued by QKD, K r The key requirement for QKD request r.
2. The QKD network routing method of claim 1, wherein the blocking rate is defined as the total requests of the current allocation failed request/QKD system, calculated as follows:
BR r ＝F l /R
where R represents the total QKD request number.
3. The QKD network routing method of claim 2, wherein the joint-relayed QKD system includes a plurality of QKD nodes, a plurality of quantum key pools, and a joint relay,
the joint relay comprises a first untrusted relay, a second untrusted relay and a trusted relay;
any one QKD node and the trusted relay are connected through a KM link;
any one of the QKD nodes serving as a transmitting end and a first untrusted relay through a quantum network, and the second untrusted relay and the QKD node serving as a receiving end through the quantum network;
the first unreliable relay and the second unreliable relay are connected through an optical switch;
any one QKD node is connected with a corresponding quantum key pool;
the first quantum key pool and the second key pool are respectively connected with the trusted relay.
4. A QKD network routing method based on QKP as claimed in claim 3, wherein the successful allocation rate is the total request of the previously allocated successful request/QKD system, calculated as follows:
SR r ＝(R-F l )/R；
the sum of the blocking rate and the probability of successful allocation is 1.
5. The QKD network routing method as recited in claim 4 wherein said average blocking rate is based on QKPDefined as the current allocation failed request/total requests that the QKD system has issued at a certain time node, the calculation formula is:
6. the QKD network routing method based on QKP of claim 5, wherein the average successful allocation rateDefined as the current successful allocation request/total requests issued by the QKD system at a certain time node, the calculation formula is expressed as:
7. the QKD network routing method as recited in claim 6 wherein the K-shortest path Algorithm employs a Yen's algoritm Algorithm.
8. A storage device having stored therein a plurality of instructions adapted to be loaded by a processor and to perform the QKD network routing method step operations of any one of claims 1-7, based on QKP.
9. A smart terminal comprising a processor for executing instructions and a storage device for storing instructions, wherein the instructions are adapted to be loaded by the processor and to perform a QKD network routing method step operation based on QKP, as recited in any one of claims 1-7.
CN202311067628.9A 2023-08-23 2023-08-23 QKD network route addressing method based on QKP, storage device and intelligent terminal Pending CN117134895A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311067628.9A CN117134895A (en) 2023-08-23 2023-08-23 QKD network route addressing method based on QKP, storage device and intelligent terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311067628.9A CN117134895A (en) 2023-08-23 2023-08-23 QKD network route addressing method based on QKP, storage device and intelligent terminal

Publications (1)

Publication Number Publication Date
CN117134895A true CN117134895A (en) 2023-11-28

Family

ID=88855852

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311067628.9A Pending CN117134895A (en) 2023-08-23 2023-08-23 QKD network route addressing method based on QKP, storage device and intelligent terminal

Country Status (1)

Country Link
CN (1) CN117134895A (en)

Similar Documents

Publication Publication Date Title
US11082262B2 (en) Flow entry generating method and apparatus
US10516478B2 (en) Controller based path estimation and path provisioning using optical impairment data
US11323366B2 (en) Path determining method, apparatus, and system
EP1300995B1 (en) Resource management in heterogenous QOS based packet networks
CN104579964A (en) Dynamic route architecture system for quantum cryptography network
US8898335B2 (en) Apparatus and method for calculating communication paths
CN105933174A (en) Pre-calculating recovery method based on distance self-adaptive route and spectrum distribution
US7710883B2 (en) Path setting method and communication apparatus in communication network performing communications through a plurality of layers
RU2680764C1 (en) Method, device and system for transport communication network optimization
CN101552716B (en) Method, device and system for calculating service path
CN105978811B (en) A kind of route selecting method and device based on business transmission
Burns et al. Path selection and bandwidth allocation in MPLS networks
US20090116392A1 (en) Communication network, path setting method, network management system and node
CN109167637B (en) Key pool filling resource determination method, device, equipment and readable storage medium
CN117134895A (en) QKD network route addressing method based on QKP, storage device and intelligent terminal
Huang et al. A scalable path protection mechanism for guaranteed network reliability under multiple failures
JP4344346B2 (en) Node equipment
Lemeshko Probabilistic-temporal model of QoS-routing with precomputation of routes under the terms of non-ideal reliability of telecommunication network
JP2933905B1 (en) Multicast communication system
RU2678470C1 (en) Data blocks in the switched network multi-routing method
Mohan et al. QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints
CN109379139A (en) Star-like continuous variable quantum key distribution network and its method, medium
CN107615719B (en) Method, device and system for calculating path in network
CN109510670A (en) Continuous variable quantum key distribution network establishing method, medium, network and node
Shi et al. Concurrent Entanglement Routing for Quantum Networks: Model and Designs

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination