CN116418492A - Route establishment method, system and quantum cryptography network - Google Patents

Route establishment method, system and quantum cryptography network Download PDF

Info

Publication number
CN116418492A
CN116418492A CN202111661972.1A CN202111661972A CN116418492A CN 116418492 A CN116418492 A CN 116418492A CN 202111661972 A CN202111661972 A CN 202111661972A CN 116418492 A CN116418492 A CN 116418492A
Authority
CN
China
Prior art keywords
path
node
key
network
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
CN202111661972.1A
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.)
Shandong Institute Of Quantum Science And Technology Co ltd
Quantumctek Co Ltd
Original Assignee
Shandong Institute Of Quantum Science And Technology Co ltd
Quantumctek 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 Shandong Institute Of Quantum Science And Technology Co ltd, Quantumctek Co Ltd filed Critical Shandong Institute Of Quantum Science And Technology Co ltd
Priority to CN202111661972.1A priority Critical patent/CN116418492A/en
Publication of CN116418492A publication Critical patent/CN116418492A/en
Pending legal-status Critical Current

Links

Images

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
    • 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/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
    • 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • 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 Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Theoretical Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present disclosure provides a route establishment method, a system and a quantum cryptography network, which determine a shortest path including a source node and a destination node; calculating the path smoothness of each shortest path, and taking the shortest path with the optimal path smoothness as a final routing path; when the shortest paths are multiple, the optimal paths are selected, so that the smoothness of the key relay is improved on the basis of the shortest route, and the congestion of the relay data packet is avoided.

Description

Route establishment method, system and quantum cryptography network
Technical Field
The disclosure belongs to the technical field of quantum communication, and relates to a route establishment method, a route establishment system and a quantum cryptography network.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
Quantum cryptography based on Quantum Key Distribution (QKD) protocols is one of the most important practical applications of quantum communications at the present stage. While traditional cryptography is a mathematical-based cryptosystem, quantum cryptography is based on quantum mechanics, and its security is based on the principle of mismeasurement, unclonable quantum, quantum coherence and other physical properties, and proved to be unconditionally secure.
A quantum cryptography network is a type of secure communication network that employs quantum cryptography. Logically, a quantum cryptography network can be divided into three main functional layers, a quantum layer, a key management layer, and an application layer, respectively. The quantum layer is used for carrying out quantum signal transceiving and information negotiation through a QKD link (comprising a quantum channel and a classical channel) to generate a quantum key, and forwarding the generated quantum key to the key management layer; the key management layer stores and manages quantum keys; the application layer obtains the quantum key from the key management layer for secure communication. According to the application requirement of the application layer on the quantum key and the residual key quantity, when the residual key quantity is insufficient, the quantum key management layer initiates a quantum key generation request to the quantum layer.
Quantum key relay is the main way to obtain a shared key between quantum cryptography network nodes that are not QKD links directly connected. Relay routing is a very important aspect of quantum key relay, determining the speed and efficiency of quantum key relay. Shortest path routing is a very efficient key relay routing method, which enables the relay of a key from an initial node to a destination node by selecting a path with the smallest number of hops, which is advantageous in reducing the key consumption for key relay and in improving the speed of key relay in case of a clear path.
However, with the development of quantum cryptography network construction, the number of QKD links in the quantum cryptography network is increasing, and the multi-connectivity of the links therein is also better, and there is often more than one shortest route for the key relay. According to the inventor, the current quantum cryptography network routing method only considers the problem of selecting the shortest path, and does not consider how to select the optimal path when a plurality of shortest paths exist simultaneously.
Disclosure of Invention
In order to solve the above problems, the disclosure provides a route establishment method, a system and a quantum cryptography network, which can select an optimal path by taking communication smoothness as an influence factor when a plurality of shortest paths are provided, so as to ensure that the smoothness of a key relay is improved on the basis of shortest routes and avoid congestion of a relay data packet.
According to some embodiments, the present disclosure employs the following technical solutions:
a route establishment method, comprising the steps of:
determining a shortest path comprising a source node and a destination node;
and calculating the path smoothness of each shortest path, and taking the shortest path with the optimal path smoothness as a final routing path.
In the above technical solution, when the number of shortest paths of the key relay is greater than 1, considering several of the factors such as the degree of the routing node, the key generation speed on the path, and the remaining quantum key amount for the key relay on the path, the smoothness of the key relay can be determined, and the optimal routing path can be further determined.
In an alternative embodiment, the specific process of calculating the path smoothness of each shortest path and taking the shortest path with the optimal path smoothness as the final routing path includes: and calculating a weight sum of each shortest path, wherein the weight sum is related to at least one factor of the degree of the routing node, the key generation speed and the residual quantum key quantity for key relay, and the weight sum and the optimal shortest path are the final routing paths.
As an alternative implementation manner, the weight sum is related to the sum of the degrees of all relay nodes in each path in the shortest path from the source node to the destination node, and the smaller the sum of the degrees is, the better the weight sum is.
As an alternative embodiment, the weight sum is related to the sum of key generation speeds on paths of each adjacent node in the shortest path from the source node to the destination node, and the larger the sum of key generation speeds is, the better the weight sum is.
As an alternative embodiment, the weight sum is related to the sum of the residual key amounts on each adjacent node path in the shortest path from the source node to the destination node, and the larger the sum of the residual key amounts is, the better the weight sum is.
As an alternative embodiment, the weight sum considers at least two factors of the degree of the routing node, the key generation speed, and the amount of the remaining quantum key for key relay.
As an alternative embodiment, the weight sum considers comprehensively the degree of the routing node, the key generation speed and the amount of the remaining quantum key for key relay.
As an alternative embodiment, when determining the shortest path, a topology update period is set, the network topology state information and the network state information are updated in each topology update period, and the shortest path from the source node to the destination node is calculated according to the latest network topology state information.
As a further limitation, the network status information includes at least one of a degree of each network node, a key generation speed of each path in which the network node is located, and an estimated remaining key amount.
As a further limitation, the remaining key amount of the next cycle is estimated from the remaining key amount, the key generation speed, and the key consumption speed.
In an alternative embodiment, when determining the shortest path including the source node and the destination node, determining whether the connection path is available for key relay in the next period according to the remaining key quantity, the key generation speed and the key consumption speed of the connection paths of each node and its neighboring nodes in the current period, and eliminating paths unavailable for key relay in the next period.
As an alternative embodiment, the quantum cryptography network node where the key relay packet is located is used as the source node.
A route creation system, comprising:
a determining module configured to determine a shortest path including the source node and the destination node;
and the selection module is configured to calculate the path smoothness of each shortest path and take the shortest path with the optimal path smoothness as a final routing path.
A computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform said one route establishment method.
A terminal device comprising a processor and a computer readable storage medium, the processor configured to implement instructions; the computer readable storage medium is for storing a plurality of instructions adapted to be loaded by a processor and to perform the one route establishment method.
A quantum cryptography network includes a plurality of quantum cryptography network nodes that perform the one route establishment method to determine a quantum key relay path.
In an alternative embodiment, the quantum cryptography network node determines, according to the connection paths of the node and the neighboring node, whether the connection paths can be used for key relay or not and eliminates paths which cannot be used for key relay in the next topology updating period according to the residual key quantity, the key generation speed and the key consumption speed in the period.
As an alternative implementation manner, each quantum cryptography network node needing key relay calculates the shortest path from the node to the destination node according to the latest network topology state information.
As a further limitation, the network further comprises a routing server configured for setting a topology update period, receiving a remaining key amount, a key generation speed and a key consumption speed of a connection path of each network node with a neighboring node within the period;
estimating the residual key quantity of the next period according to the residual key quantity, the key generation speed and the key consumption speed;
and according to the information reported by each node, determining the network topology state information and the network state information of the next period, and sending the network topology state information and the network state information to each quantum cryptography network node.
As a further limitation, the network status information includes at least one of a degree of each network node, a key generation speed of each path in which the network node is located, and an estimated remaining key amount.
Compared with the prior art, the beneficial effects of the present disclosure are:
according to the method and the device, under the conditions that the network structure is complex, the network multi-connectivity is good, and a plurality of shortest paths are provided, screening is conducted again, the smoothness of the paths is used as a measurement factor, the probability of congestion of a relay key data packet of a relay node is reduced, the rationality of key relay routing is increased, and the problem of optimal routing path selection which is not solved by the current technical scheme is solved.
When the patency of the path is measured, at least one of the degree of the path reaching the node, the path key generation speed and the path residual key quantity is used as a calculation parameter of the path weight sum, so that the cost (key consumption) of the key relay is not increased, three factors affecting the patency degree of the path can be considered singly or comprehensively, the path can be flexibly changed according to the scene requirement, and the adaptability is high.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure, illustrate and explain the exemplary embodiments of the disclosure and together with the description serve to explain the disclosure, and do not constitute an undue limitation on the disclosure.
FIG. 1 is a schematic diagram of shortest path selection analysis;
FIG. 2 is a schematic flow chart of a first embodiment;
FIG. 3 is a schematic flow chart of a second embodiment;
fig. 4 is a network path determination diagram of an embodiment fifteen.
The specific embodiment is as follows:
the disclosure is further described below with reference to the drawings and examples.
It should be noted that the following detailed description is illustrative and is intended to provide further explanation of the present disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments in accordance with the present disclosure. As used herein, the singular is also intended to include the plural unless the context clearly indicates otherwise, and furthermore, it is to be understood that the terms "comprises" and/or "comprising" when used in this specification are taken to specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.
In order to solve the problems that the current quantum cryptography network routing method only considers selecting the shortest path and does not consider how to select the best path when a plurality of shortest paths exist simultaneously, which are proposed in the background technology.
The present disclosure provides a route establishment method, in which a route with good smoothness of a key relay is preferentially selected as an optimal route in consideration of factors related to smoothness of a route.
The route path smoothness related factors include the degree of the route node, the key generation speed on the path, and the amount of remaining quantum keys on the path for key relay.
The greater the degree of a routing node, the greater the probability that the node is congested, and nodes with smaller degrees should be preferentially selected. The faster the key generation speed on the path, the better the smoothness of the path key relay, and the priority should be selected. The quantum cipher network can generate a quantum key for key relay in advance between nodes in the current key distribution speed, and the larger the pre-stored quantum key quantity is, the better the smoothness of the path key relay is, and the paths with larger residual quantum key quantity are preferably selected.
The method can solve the problem of how to select the best shortest route when more than one shortest route exists.
For example, in the network node topology map shown in FIG. 1, the shortest paths for nodes S1 through S3 are S1-S2-S3 and S1-S4-S3. Since the degree of S2 (the number of paths connected to the node is the number of degrees of the node) is 7 and is much greater than the degree of 3 of S4, the communication load of the node S2 is large (the node S2 is responsible for the key relay communication of 7 lines), so that congestion of the key relay packet is easy to occur in the node S2, and generally there is a large key relay delay. It is more reasonable to select paths S1-S4-S3 than paths S1-S2-S3 in relay path selection.
The following description will be given with reference to various embodiments to make the technical solution more clear and obvious.
Example 1
A quantum cryptography network route establishment method, as shown in figure 2, comprises the following steps:
firstly, a quantum cryptography network node where a key relay data packet is located calculates the shortest path from the node to a key relay destination node, and if the number of the shortest paths of the key relay is greater than 1, weight sums of all paths on each shortest path are calculated respectively, and the weight sum of the shortest path with the smallest is used as an optimal routing path of the key relay.
In this embodiment, the calculation formula of the sum of weights of all paths on the shortest path is as follows:
Figure BDA0003447625250000081
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), R (x k-1 x k ) Represents the key generation speed on the path from the kth-1 node to the kth node on the route path, S (x k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
In this embodiment, the weight and the smallest shortest path are used as the optimal routing path for the key relay.
When the shortest path is determined, a topology updating period (i.e. a routing period) is set, each network node judges whether the path can be used for key relay in the next topology updating period according to the residual key quantity, key generating speed and key consuming speed of the connection path between each node and the adjacent node in the current period, and reports the result, and meanwhile, the degree of the node, the key generating speed of each path where the node is located and the estimated residual key quantity of each path where the node is located in the next routing period are reported together.
And determining network topology state information of the next topology updating period according to the reported information of each node, and calculating the shortest path from the node to the destination node according to the latest network topology state information.
When executed, the following steps may be sequentially performed in accordance with the steps:
(1) And the quantum cryptography network node where the key relay data packet is positioned calculates the shortest path from the node to the key relay destination node.
Setting a topology updating period, judging whether a current path can be used for key relay in the next topology updating period by each network node according to the residual key quantity, key generation speed and key consumption speed of the connection path between each node and the adjacent node in the current period, and reporting the degree of the current node, the key generation speed of each path of the current node and the estimated residual key quantity of each path of the current node in the next routing period.
And according to the information reported by each node, determining the network topology state information of the next topology updating period, and transmitting the network topology state information, the residual key quantity on each path and the key generation speed to each quantum cryptography network node. After each node needing to perform key relay receives the updated network topology state information, the shortest route (the route with the minimum hop number) from the node to the destination node is calculated according to the latest network topology state information.
(2) If the shortest path number of the key relay is larger than 1, respectively calculating the weight sum of all paths on each shortest path.
(3) And taking the weight and the shortest path with the smallest weight as the optimal routing path of the key relay.
In this embodiment, the weight of each path on the routing path is related to the degree of arrival at the node (i.e., the node of the two nodes on the routing path that is closer to the destination node), the key generation speed on the path, and the remaining key amount on the path: the higher the degree of reaching the node, the larger the path weight, and the smaller the probability that the path is selected; the larger the key generation speed on the path is, the smaller the path weight is, and the greater the possibility that the path is selected is; the larger the amount of remaining keys on the path, the smaller the path weight, and the greater the likelihood that the path is selected. In an actual quantum cryptography network, the larger the degree of a node is, the greater the possibility of congestion is, and the smaller the possibility of being selected is, so that the key relay data packet can bypass the node with the larger degree of the node. The faster the key generation speed and the larger the amount of the remaining keys on the path, the better the path key relaying capability, the better the smoothness of the key relaying, the greater the likelihood of being selected, and the less likely the key relaying packet will be congested. It can be seen that the calculation of the path weight accords with the practical situation of the key relay routing.
In the embodiment, three parameters affecting the smoothness of the routing path are comprehensively considered, and the path weight related to the three parameters is calculated.
Example two
The difference between this embodiment and the above embodiment is that, as shown in fig. 3, the quantum cryptography network node where the key relay packet is located calculates the shortest path from the node to the key relay destination node, and if the number of the shortest paths of the key relay is greater than 1, calculates the weight sum of all paths on each shortest path, and uses the shortest path with the maximum weight sum as the optimal routing path of the key relay.
The weight sums are different, and the calculation formula of the weight sums of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000111
wherein, node i is the initial node of the routing path, j is the destination node of the routing path, the length of the routing path is n, and w (k) is the weight of the kth path on the routing pathSum of values, N (x k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), R (x k-1 x k ) Represents the key generation speed on the path from the kth-1 node to the kth node on the route path, S (x k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example III
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000121
wherein, the node i is the initial node of the route path, j is the destination node of the route path, the route path length is n, w (k) is the weight sum of the kth path on the route path,
( k-1 x k ) Represents the key generation speed on the path from the kth-1 node to the kth node on the route path, S (x k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example IV
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000122
wherein, the node i is the initial node of the route path, j is the destination node of the route path, the route path length is n, w (k) is the weight sum of the kth path on the route path,
( k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example five
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000131
wherein, node i is the initial node of the routing path, j is the destination node of the routing path, the length of the routing path is n, w (k) is the weight sum of the kth path on the routing path, R (x) k-1 x k ) Representing the key generation speed on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example six
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000132
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), R (x k-1 x k ) Representing the key generation speed on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example seven
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000141
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), S (x k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the maximum shortest path as the optimal routing path of the key relay.
Example eight
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000142
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), S (x k-1 x k ) Representing the amount of keys remaining on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the shortest path with the smallest weight as the optimal routing path of the key relay.
Example nine
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000151
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) Represents the degree of the kth node of the route path (initial node i is the 0 th node, destination node is the n-th node), R (x k-1 x k ) Representing the key generation speed on the path from the kth-1 node to the kth node on the routing path.
And taking the weight and the shortest path with the smallest weight as the optimal routing path of the key relay.
Examples ten
The difference between this embodiment and the above embodiment is that the weight sum is different, and the calculation formula of the weight sum of all paths on the shortest path in this embodiment is as follows:
Figure BDA0003447625250000152
wherein, node i is the initial node of the route path, j is the destination node of the route path, the route path length is N, w (k) is the weight sum of the kth path on the route path, and N (x) k ) The degree of the kth node of the route path is represented (the initial node i is the 0 th node, and the destination node is the n-th node).
And taking the weight and the shortest path with the smallest weight as the optimal routing path of the key relay.
According to the embodiment, under the conditions that the network structure is complex, the network multi-connectivity is good and a plurality of shortest paths are provided, the number of paths reaching the node, the path key generation speed and the residual key quantity of the paths are used as calculation parameters of the path weight, the path weight and the maximum or minimum shortest path are selected as the optimal routing paths, the cost (key consumption) of the key relay is not increased, three factors affecting the smoothness of the paths are considered, the probability of congestion of the relay key data packet of the relay node is reduced, the rationality of key relay routing is increased, and the optimal routing path selection problem which is not solved by the current technical scheme is solved.
Example eleven
A route creation system, comprising:
a determining module configured to determine a shortest path including the source node and the destination node;
and the selection module is configured to calculate the path smoothness of each shortest path and take the shortest path with the optimal path smoothness as a final routing path.
Example twelve
A computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform a route establishment method as described in any one of embodiments one to ten.
Example thirteen
A terminal device comprising a processor and a computer readable storage medium, the processor configured to implement instructions; a computer readable storage medium is for storing a plurality of instructions adapted to be loaded by a processor and to perform a route creation method as described in any of embodiments one to ten.
Examples fourteen
A quantum cryptography network comprising a plurality of quantum cryptography network nodes that perform a route establishment method of any of embodiments one through ten to determine a quantum key relay path.
Of course, a route server may be further set in the quantum cryptography network, a topology update period may be set, each network node determines, according to a remaining key amount, a key generation speed and a key consumption speed of a connection path between each node and an adjacent node in the current period, whether the current path is available for key relay in the next topology update period, and reports a result to the route server, and meanwhile, the degree of the current node, the key generation speed of each path where the current node is located, and an estimated remaining key amount of each path where the current node is located in the next route period are reported to the route server together, and the route server determines network topology state information in the next topology update period according to the reporting information of each node, and sends the network topology state information to each quantum cryptography network node. After each node needing to perform key relay receives the updated network topology state information, the shortest path from the node to the destination node is calculated according to the latest network topology state information.
Example fifteen
As an application example, as shown in fig. 4, a simplified quantum cryptography network structure diagram includes 10 network nodes a to J, considering the path state of the next topology update period of the network structure diagram at a certain time, the dashed line in the diagram represents the path that is not available for key relay in the topology period to be considered, and the solid line represents the path that is available for key relay in the topology period to be considered.
TABLE 1
Figure BDA0003447625250000171
Figure BDA0003447625250000181
Node a needs to calculate the key relay path to destination node J:
calculating the shortest paths from the node A to the node J, wherein three shortest paths 1 are total: A-B-D-H-J, shortest path 2: A-C-F-E-J and shortest path 3: A-C-F-I-J. Table 1 shows the key generation speed, the remaining key amount, and the degree of arrival at the node on each path on each shortest path at that time. And determining the weight and the optimal path as the final routing path according to the weight on each path calculated by the methods from the first embodiment to the tenth embodiment.
Taking the calculation method provided in the first embodiment as an example, the weights and the weights of the three shortest paths are calculated according to table 1 as follows: the sum of the weights of the shortest path 1 is 6, the sum of the weights of the shortest path 2 is 5.75, and the sum of the weights of the shortest path 3 is 5.5, and the shortest path 3 is selected according to the calculation result node A: A-C-F-I-J is used as a final routing path.
Of course, in fig. 4, since the node D and the node E are located at the central position of the network, the network load is larger, and the possibility of occurrence of network congestion is higher, so that the method provided in this embodiment is easy to bypass the network node at the central position where congestion is easy to occur during path selection.
It will be apparent to those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing description of the preferred embodiments of the present disclosure is provided only and not intended to limit the disclosure so that various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
While the specific embodiments of the present disclosure have been described above with reference to the drawings, it should be understood that the present disclosure is not limited to the embodiments, and that various modifications and changes can be made by one skilled in the art without inventive effort on the basis of the technical solutions of the present disclosure while remaining within the scope of the present disclosure.

Claims (20)

1. A route establishment method is characterized in that: the method comprises the following steps:
determining a shortest path comprising a source node and a destination node;
and calculating the path smoothness of each shortest path, and taking the shortest path with the optimal path smoothness as a final routing path.
2. A route establishment method according to claim 1, characterized in that: the specific process of calculating the path smoothness of each shortest path and taking the shortest path with the optimal path smoothness as the final routing path comprises the following steps: and calculating a weight sum of each shortest path, wherein the weight sum is related to at least one factor of the degree of the routing node, the key generation speed and the residual quantum key quantity for key relay, and the weight sum and the optimal shortest path are the final routing paths.
3. A route establishment method according to claim 2, characterized in that: the weight sum is related to the sum of the degrees of all relay nodes in each path in the shortest path from the source node to the destination node, and the smaller the sum of the degrees is, the better the weight sum is.
4. A route establishment method according to claim 2, characterized in that: the weight sum is related to the sum of key generation speeds on paths of adjacent nodes in the shortest path from the source node to the destination node, and the larger the sum of key generation speeds is, the better the weight sum is.
5. A route establishment method according to claim 2, characterized in that: the weight sum is related to the sum of the residual key amounts on each adjacent node path in the shortest path from the source node to the destination node, and the larger the sum of the residual key amounts is, the better the weight sum is.
6. A route establishment method according to claim 2, characterized in that: the weight sum comprehensively considers at least two factors of the degree of the routing node, the key generation speed and the residual quantum key quantity for key relay.
7. A route establishment method according to claim 2, characterized in that: the weight sum comprehensively considers the degree of the routing node, the key generation speed and the residual quantum key quantity for key relay.
8. A route establishment method according to claim 1, characterized in that: when determining the shortest path, setting a topology updating period, updating network topology state information and network state information in each topology updating period, and calculating the shortest path from a source node to a destination node according to the latest network topology state information.
9. The route establishment method of claim 8, wherein: the network state information includes at least one of a degree of each network node, a key generation speed of each path in which the network node is located, and an estimated remaining key amount.
10. A route establishment method according to claim 9, wherein: and estimating the residual key quantity of the next period according to the residual key quantity, the key generation speed and the key consumption speed.
11. A route establishment method according to claim 1, characterized in that: when determining the shortest path comprising the source node and the destination node, judging whether the connection path can be used for key relay in the next period according to the residual key quantity, the key generation speed and the key consumption speed of the connection paths of each node and the adjacent nodes in the current period, and eliminating paths which cannot be used for key relay in the next period.
12. A route establishment method according to claim 1, characterized in that: the quantum cryptography network node where the key relay data packet is located is used as a source node.
13. A route creation system, characterized by: comprising the following steps:
a determining module configured to determine a shortest path including the source node and the destination node;
and the selection module is configured to calculate the path smoothness of each shortest path and take the shortest path with the optimal path smoothness as a final routing path.
14. A computer-readable storage medium, characterized by: in which a plurality of instructions are stored, which instructions are adapted to be loaded and executed by a processor of a terminal device, a route establishment method according to any of the claims 1-12.
15. A terminal device, characterized by: comprising a processor and a computer-readable storage medium, the processor configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform a route establishment method according to any of the claims 1-12.
16. A quantum cryptography network, characterized by: comprising a plurality of quantum cryptography network nodes performing a route establishment method of any of claims 1-12 for determining a quantum key relay path.
17. A quantum cryptography network as claimed in claim 16 wherein: and the quantum cryptography network node judges whether the connection path can be used for key relay or not and eliminates the path which cannot be used for key relay in the next topology updating period according to the connection paths of the node and the adjacent node and the residual key quantity, the key generation speed and the key consumption speed in the period.
18. A quantum cryptography network as claimed in claim 16 wherein: and each quantum cryptography network node needing key relay calculates the shortest path from the node to the destination node according to the latest network topology state information.
19. A quantum cryptography network according to any of claims 16-18 wherein: the routing server is configured to set a topology updating period, and receive the residual key quantity, the key generation speed and the key consumption speed of the connection path of each network node and the adjacent node in the period;
estimating the residual key quantity of the next period according to the residual key quantity, the key generation speed and the key consumption speed;
and according to the information reported by each node, determining the network topology state information and the network state information of the next period, and sending the network topology state information and the network state information to each quantum cryptography network node.
20. A quantum cryptography network as claimed in claim 19 wherein: the network state information includes at least one of a degree of each network node, a key generation speed of each path in which the network node is located, and an estimated remaining key amount.
CN202111661972.1A 2021-12-30 2021-12-30 Route establishment method, system and quantum cryptography network Pending CN116418492A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111661972.1A CN116418492A (en) 2021-12-30 2021-12-30 Route establishment method, system and quantum cryptography network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111661972.1A CN116418492A (en) 2021-12-30 2021-12-30 Route establishment method, system and quantum cryptography network

Publications (1)

Publication Number Publication Date
CN116418492A true CN116418492A (en) 2023-07-11

Family

ID=87058332

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111661972.1A Pending CN116418492A (en) 2021-12-30 2021-12-30 Route establishment method, system and quantum cryptography network

Country Status (1)

Country Link
CN (1) CN116418492A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117176345A (en) * 2023-10-31 2023-12-05 中电信量子科技有限公司 Quantum cryptography network key relay dynamic routing method, device and system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117176345A (en) * 2023-10-31 2023-12-05 中电信量子科技有限公司 Quantum cryptography network key relay dynamic routing method, device and system
CN117176345B (en) * 2023-10-31 2024-01-09 中电信量子科技有限公司 Quantum cryptography network key relay dynamic routing method, device and system

Similar Documents

Publication Publication Date Title
CN109962773B (en) Wide-area quantum cryptography network data encryption routing method
US8862775B2 (en) Network server and load balancing routing method for networks thereof
CN113194034A (en) Route optimization method and system based on graph neural network and deep reinforcement learning
CN109962774B (en) Quantum cipher network key relay dynamic routing method
Koryachko et al. Development and research of improved model of multipath adaptive routing in computer networks with load balancing
Shvedov et al. Determining shortest paths between two arbitrary nodes in a composite transport network using segment routing
Shvedov et al. Application of the Backman Model for the Distribution of Traffic Flows in Networks with Segment Routing
KR20130087535A (en) Lookahead computation of routing information
EP1798894A1 (en) A fast simulated annealing for traffic matrix estimation
Song et al. Resource-efficient virtual network function placement in operator networks
Geng et al. Algebra and algorithms for multipath QoS routing in link state networks
CN103078796A (en) Routing calculation method and equipment
CN116418492A (en) Route establishment method, system and quantum cryptography network
Paganini Congestion control with adaptive multipath routing based on optimization
Nguyen et al. Efficient virtual network embedding with node ranking and intelligent link mapping
CN109286563B (en) Data transmission control method and device
Chang et al. CROP: Community-relevance-based opportunistic routing in delay tolerant networks
Tang et al. Constructing a DRL decision making scheme for multi-path routing in All-IP access network
CN112637061B (en) Dynamic multi-factor path calculation method based on heuristic algorithm
Quang et al. Multi-objective multi-constrained QoS Routing in large-scale networks: A genetic algorithm approach
JP2014049851A (en) Network topology estimation method and topology estimation device
Almasan et al. Enero: Efficient real-time routing optimization
JP2006287919A (en) Communication network, content distribution node, tree construction method, and content distribution control program
Petrovich et al. Improved multipath adaptive routing model in computer networks with load balancing
Alabbad et al. Localised credit based QoS routing

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