CN103001875A - Quantum cryptography network dynamic routing method - Google Patents
Quantum cryptography network dynamic routing method Download PDFInfo
- Publication number
- CN103001875A CN103001875A CN2013100051051A CN201310005105A CN103001875A CN 103001875 A CN103001875 A CN 103001875A CN 2013100051051 A CN2013100051051 A CN 2013100051051A CN 201310005105 A CN201310005105 A CN 201310005105A CN 103001875 A CN103001875 A CN 103001875A
- Authority
- CN
- China
- Prior art keywords
- via node
- node
- quantum
- quantum cryptography
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a quantum cryptography network dynamic routing method. According to the method, dynamic routing selection of encryption communication is performed by utilizing quantum cryptography according to changes of the quantum key quantity between relay nodes of a quantum cryptography network. According to the method, a route server is arranged for the relay nodes of the whole quantum cryptography network, and topology refresh cycles of the quantum cryptography network are set; in each topology refresh cycle, each relay node collects and processes state information of the relay node and reports results to the route server. After the route server collects the topology state information of each relay node, quantum cryptography network topology state information of a next topology refresh cycle is generated and sent to all the relay nodes of the quantum cryptography network. According to the quantum cryptography network topology state information obtained from the route server, a target relay node is calculated and determined to be a next skip route of communication data of a random other relay node according to a shortest path law through each relay node.
Description
Technical field
The present invention relates to the communications field of the quantum cryptography networks of quantum communication network and classical communication network struction, relate in particular to a kind of quantum cryptography networks dynamic routing method.
Background technology
Quantum communications are novel crossed subjects that recent two decades grows up, and are the new research fields that quantum theory and information theory combine.Recently this subject progressively moves towards experiment from theory, and to practical development.The communication of highly effective and safe receives people's concern day by day.
Physically, quantum communications can be understood to be under the physics limit, the high performance communication that utilizes quantum effect to realize.On the informatics, we think that then quantum communications are to utilize quantum-mechanical basic principle (measurement that can not clone principle and quantum state such as quantum state collapse character etc.) or utilize the quantized system particular attribute such as quantum state Teleportation, and the method measured of quantum is finished the information transmission between the two places.
Quanta cryptology technique take quantum-key distribution (QKD) agreement as the basis is one of most important practical application of present stage quantum communications.Traditional cryptography is take the cryptographic system of mathematics as the basis, and quantum cryptography is take quantum mechanics as the basis, its fail safe be based upon uncertainty principle, quantum can not clone and the physical characteristic such as quantum coherence on, be proved to be to be perfectly safe, so quantum cryptography has caused the great attention of academia.
Quantum cryptography networks is a kind of secure communication network that adopts quantum cryptography.As shown in Figure 1, quantum cryptography networks is to be formed by classical communication network and common structure of QKD network.The QKD network mainly is comprised of QKD terminal equipment and quantum link, is used for key distribution.Classical communication network use amount sub-key is realized the encryption and decryption of data and the transmission of enciphered data.A quantum cryptography networks node generally is comprised of with the QKD device end that is connected in quantum communication network a classical communication terminal that is connected in the classical communication network.The network node of quantum cryptography networks generally is divided into two kinds of terminal node and via nodes.Because the restriction of quantum communications ultimate range and for the consideration of networking cost, there is not direct-connected quantum link between many terminals, can not realize the direct distribution of quantum key, the coded communication data between them need to be by the forwarding of via node.Fig. 2 and Fig. 3 have demonstrated respectively terminal node Alice and Bob realize the quantum key coded communication by a via node and a plurality of via node process.
Larger quantum cryptography networks can have a large amount of via nodes, and the coded communication data between terminal node can be by the transfer of one or several via node, and has different optional via nodes when data relay.In the How to choose quantum cryptography networks communication data of any two nodes by start node arrive destination node the via node that will pass through in order, we are referred to as the quantum cryptography networks route.
Quantum cryptography networks simple in structure, be negligible amounts and the relatively-stationary quantum cryptography networks of network configuration of via node and terminal node, generally be by the static routing mode, the i.e. static route lines that writes between all terminal nodes in via node realizes the Route Selection of communication data encryption and decryption.The shortcoming of static routing is almost to need again the routed path of planning network when whole network adds or deletes a via node, and upgrades the routed path of all relevant via nodes.Another shortcoming is that when the quantum key quantity not sufficient of a paths communicating pair can only wait for that the QKD equipment on this paths generates enough quantum keys and could continue communication.
The quantum cryptography networks scale constantly increases.Quantum cryptography networks has expanded to the metropolitan area network scope now, and terminal node can reach thousands of, and via node quantity can reach up to a hundred, and because the expansion of node maintenance and network size, network topology is constantly to change.In this case, it is no longer suitable to dispose loaded down with trivial details static routing method, and we need a kind of dynamic routing method of suitable quantum cryptography networks.
Because the particularity of quantum cryptography networks, the design of the dynamic routing method of quantum cryptography networks must take into full account following factor:
1. network topology change is frequent.Can communication data arrive another network node by a network node in quantum cryptography networks, namely whether there is routed path between two nodes, depend on the quantum key that whether has enough usefulness between these two nodes, namely the quantum key amount has determined whether routed path is available.And quantum key constantly is consumed and generates, so whether the path is available also may constantly change.
2. the quantum cryptography networks route need to take into full account and improve the utilance of quantum key.All need to consume a certain amount of quantum key because communication data is every through a jumping path, and quantum key is the most valuable Internet resources of quantum cryptography networks, has very high manufacturing cost, so the method for routing of quantum cryptography networks will as much as possible make communication data experience the fewest number of hops path from the start node to the destination node, to reach the purpose of consumes least amount quantum key.
3. the quantum cryptography networks route need to be considered the fail safe of communication data, will guarantee that namely each step of the routed path that communication data will pass through has enough quantum key realization data encryptions, to realize the being perfectly safe property of quantum cryptography networks.
Because above factor, the route of quantum cryptography networks route and classic network has the difference of following essence:
1. the routing node of classic network is generally router or switch, only realize the forwarding capability of data, communication data is not processed, and the via node of quantum cryptography networks route is the network node with QKD equipment, need to be decrypted and encryption data;
2. whether the path between the classic network routing node available depends on the network bandwidth or the reliable physical connection of no existence, and the path between the via node of quantum cryptography networks route whether available (being whether communication data can arrive another via node from a via node) depend between the via node at two ends, path whether have available quantum key;
3. the encryption mechanism of quantum cryptography networks need to consume a large amount of keys, sometimes the key depletion rate is much larger than formation speed, the path of quantum cryptography networks can be in down state owing to the quantum key quantity not sufficient at two ends, path, so with respect to classic network, the path status of quantum cryptography networks changes often comparatively frequent.
Above characteristics have determined that the route of quantum cryptography networks can not directly adopt the classic network method for routing.With respect to the classic network route, the dynamic routing method of quantum cryptography networks must have following characteristics: the one, and the quantum key amount at two ends, path is one of most important routing parameters that determine the network topology state in the network; The 2nd, via node must the faster change information of collecting more accurately via node and path; The 3rd, the quantum cryptography networks route need to have faster network topological convergence speed; The 4th, the quantum cryptography networks route will have higher quantum key utilance.
And up to now, also there is not a kind of dynamic routing method of perfect suitable quantum cryptography networks to be suggested.The Patents of the quantum cryptography networks route that can retrieve is as described below:
Chinese patent No.201010144106.0 discloses " quantum router and the method for routing thereof that are used for multi-user photon communication network ", this patent scheme is applied to quantum communication network, by the control optical cross-connect, realize the connection between two users, do not consider whether the quantum key amount on the communication path is sufficient.United States Patent (USP) NO.8,122,242B2, NO.7,392,378B1 and NO.7,441,267B1, these three pieces of patents are a series of Patents, what say is network node system to the technical scheme of data flow How to choose routed path under the prerequisite of known many quantum cryptography networks routed paths that will enter communication network, the different routed paths of node system have different cryptographic capabilities, according to the cryptographic capabilities of these paths of parameter Estimation such as size of key of certain paths, select the strongest path of cryptographic capabilities as the path of down hop.But there are two shortcomings in this patent scheme: the first, and the selected overall routed path of this patent scheme may not be shortest path; Second, the minimum a certain jumping path of cryptographic capabilities in the selected overall routed path of this patent scheme, may be lower than the cryptographic capabilities in a certain jumping path that cryptographic capabilities is minimum in another optional overall routed path, and the cryptographic capabilities of a paths often is limited by the cryptographic capabilities in that minimum jumping path of its cryptographic capabilities.
Above quantum cryptography networks route Patents, the complete scheme of quantum cryptography networks dynamic routing all is not provided, namely how according to the variation of quantum cryptography networks topology state, communication data is sent to destination node from start node by the selection via node, and can in ensuring communication safety property, consumes less quantum key.
Summary of the invention
The present invention proposes a kind of quantum cryptography networks dynamic routing method, the method realizes that according to the variation of quantum cryptography networks topology state the dynamic routing of communication data coded communication between the quantum cryptography networks node selects, and permissible dose subcipher network dynamic expansion also realizes data security communication according to the variation of network topology state.In the quantum cryptography networks, a general via node can directly connect several terminal nodes and via node, and a terminal node only connects a unique via node usually.
Technical scheme of the present invention is as described below:
The network topology state information that each via node in the quantum cryptography networks obtains was upgraded once every the set time, and we are referred to as the topology update cycle interlude.
For the via node of whole network arranges routing server, this via node state information is collected and processed to each via node within each topology update cycle, and the state information of this via node that each via node is collected comprises:
(1) whether the quantum link between this via node and each adjacent node is in normal operating conditions;
(2) the quantum key amount between this via node and each adjacent node;
(3) pace of change of the quantum key amount between this via node and each adjacent node.
The depletion rate of quantum key when wherein state information (3) depends on the formation speed of quantum link quantum key and classical channel encryption and decryption, generally the statistical value according to size of key calculates.
Via node judges according to above-mentioned state information (2), (3) whether the neighborhood paths of this via node within the next topology update cycle is available.Neighborhood paths refers to the loss of quantity subcipher network routed path between this via node and the adjacent node.Whether whether the available two ends, path of depending on exist enough quantum keys to neighborhood paths.
The state information of via node may be not limited only to the above-mentioned information of enumerating, and other all information relevant with the network topology state maybe may affect the information of network topology state, can be positioned at considered row according to practical situations.
Within each topology update cycle, each via node is with the state of neighborhood paths, namely whether available within the next topology update cycle, the surplus sub-key amount of predicting with described available neighborhood paths two ends, and in abutting connection with the operating state of quantum link, via node information etc., report in routing server.After routing server is collected the topological state information of each via node, generate the network topology state information in the next topology update cycle, and send it to all via nodes of network, upgrade the network topology state information of each via node.Routing server issues once up-to-date network topology state information every the set time (i.e. topological update cycle) to each via node.Network topology state information is herein refered in particular to the state information of quantum cryptography networks via node information, quantum link and the neighborhood paths information between each via node.Each via node can be according to the network topology state information that obtains from server, and the calculating book via node is to the shortest path of other via nodes, i.e. the minimum path of jumping figure is for the network terminal communication data through this via node provides Route Selection.
Whether available the determination methods of the state of above-mentioned neighborhood paths (namely within the next topology update cycle) be as follows:
According to the remaining quantum key amount in neighborhood paths two ends and pace of change thereof, calculate and predict the surplus sub-key amount at next topology update cycle neighborhood paths two ends, if remaining quantum key amount is less than predetermined threshold value, think that then this path is unavailable within the next topology update cycle, on the contrary available.
If via node is adjacent the operating state of the quantum link of node and changes, then at any time operating state is reported routing server.If via node is in abnormality by the quantum link between QKD device learns itself and certain adjacent node, and this abnormality reported routing server, then routing server send immediately the survival detection signal confirm whether the via node of this quantum link other end survives, if routing server is not received feedback information and its topological state reporting information of this via node within predetermined time of delay, think that then the via node of this quantum link other end is unavailable, the network topology state information corresponding to via node of the deletion other end.
Via node for new access network, new via node need to report its essential information and all operating states in abutting connection with the quantum link to routing server, with the adjacent node of stylish via node also need to report and this new via node between the operating state of quantum link; For the direct-connected quantum link of new access between two via nodes, the via node of quantum both link ends need to report the operating state of this link.In addition, whether the via node of new quantum both link ends will report neighborhood paths available within the next topology update cycle after receiving the topological lastest imformation of routing server, and the surplus sub-key amount predicted of described available neighborhood paths two ends.Routing server adds new via node information and/or new route information on the network topology structure to after receiving the reporting information of relevant via node.
The computational methods of above-mentioned shortest path are as follows:
1) topology information of supposing whole network is with scheming (G, E) expression, and wherein G represents the set on summit, E represents the set in path, and a summit among the corresponding G of this via node represents with s, construct the tree take s as root node, with the ground floor node of root node s as tree;
2) t is any one other summit among the G, t ≠ s, if have s among the E to the path (s of t, t), then with the child node of t as root node s, also be the second layer node of tree, and will with path (s, t) also add in the tree on corresponding limit, and all second layer nodes that satisfy condition among the G are added in search, and add corresponding limit;
3) number of plies of the tree that has constructed represents with L, with the set expression that does not belong to the residue summit of tree among the G is
For any summit
Consider that u arrives the quantity n in the path of the L node layer of setting:
If n=0 then considers next
In the summit;
If n〉0, if there are the path in u and certain L node layer r, then corresponding limit, this path is added in the tree, simultaneously u is added in the tree, as the L+1 node layer of tree, if L node layer r corresponding to this path occurs m time at the L layer, then corresponding limit, this path is added in the tree m time, simultaneously also corresponding interpolation m time of u makes node u corresponding one by one with each L node layer r; If it is complete that u has all added to the limit corresponding to all paths of L node layer of tree, then with u from
Middle deletion;
4) if also have the summit not add in the tree among the G, with L=L+1, repeating step 3), until the summit among all G all adds in the tree, or repeating step 3) after
Till the quantity on middle summit does not change;
5) for any one via node v, in tree s to the path of v be in the corresponding diagram (G, E) s to the shortest path of v, namely in network via node s to the shortest path of v; If exist more than a shortest path, then with each jumps the surplus sub-key amount in path separately by the ascending order arrangement in each bar shortest path, the minimum value that at first compares surplus sub-key amount, choose that paths of minimum value maximum, if minimum value is all identical, time minimum value relatively then, choose that paths of time minimum value maximum, the like, if the surplus sub-key amount of each bar shortest path is identical, then choose at random a paths.
If the down hop path of the shortest path that searches is unavailable, then this via node is deleted the path of down hop in the network topology state information, again seeks time shortest path according to described method.Following situations might cause the down hop path of shortest path unavailable:
I. network equipment working abnormal state;
Ii. a topological update cycle does not finish, and quantum key shifts to an earlier date approach exhaustion.
To terms more of the present invention, be explained as follows:
Quantum cryptography networks: a kind of secure communication network that adopts quantum cryptography, to be formed by classical communication network and common structure of QKD network, the QKD network mainly is comprised of QKD terminal equipment and quantum link, be used for key distribution, can share the quantum key that is used for encryption and decryption communication between two QKD terminal equipments, classical communication network use amount sub-key is realized the encryption and decryption of data and the transmission of enciphered data.
Quantum link: be used for connecting the connecting link of QKD terminal equipment, realization quantum key distribution in the QKD network, be generally optical fiber or free space.
Quantum cryptography networks via node: referred to as via node, be different from terminal node, be used for realize not existing the safe transfer of coded communication data between the terminal node of direct-connected quantum link, shown in accompanying drawing 2 and accompanying drawing 3.
The quantum cryptography networks route: the communication data in the quantum cryptography networks in order via one or several via node from the initial terminal node arrive the purpose terminal node the path that consists of of the via node of process.
Adjacent node: build direct-connected quantum link with this via node, can directly generate other via nodes of sharing quantum key.
Adjacent node: exist to share other via nodes of quantum key with this via node, but and not necessarily have direct-connected quantum link between this via node.
Neighborhood paths: the loss of quantity subcipher network routed path between this via node and the adjacent node.
Operation principle of the present invention is as follows:
1. centralized network Topology Management.For the via node of whole quantum cryptography networks arranges routing server, set the topological update cycle of quantum cryptography networks; Within each topology update cycle, the state information of this via node is collected and processed to each via node, and the result is reported in routing server; After routing server is collected the topological state information of each via node, generate the quantum cryptography networks topology state information in the next topology update cycle, and send it to all via nodes of quantum cryptography networks; Each via node is according to the quantum cryptography networks topology state information that obtains from routing server, the calculating book via node is to the shortest path of other via nodes, be the minimum path of jumping figure, for the network terminal communication information through this via node provides Route Selection.
2. via node state information collection.Within each topology update cycle, each via node in the network is collected the state information of this via node, comprises the pace of change of the quantum key amount between remaining quantum key amount, this via node and each adjacent node between operating state, this via node and each adjacent node of the quantum link between this via node and each adjacent node.
3. whether neighborhood paths is available in the next topology update cycle of via node prediction.Within each topology update cycle, surplus sub-key amount between via node basis and the adjacent node and the pace of change of quantum key amount, calculate and the surplus sub-key amount between via node in the next topology update cycle of prediction, if surplus sub-key amount is less than predetermined threshold value, think that then this path is unavailable in the next topology update cycle, otherwise available, the surplus sub-key amount that this result and described available neighborhood paths two ends are predicted reports in routing server, and each topology update cycle reports once.
4. the quantum link working state reports.If QKD equipment fault or link failure or other fault cause normally generation sub-key of quantum link, think all that then this quantum link is in abnormality; Otherwise, think that this quantum link is in normal condition.Via node can whether it be in abnormality in abutting connection with the quantum link by the QKD device learns, and the result is reported in routing server, and each topology update cycle reports once.If the operating state of the quantum link of via node and adjacent node changes, then at any time operating state is reported routing server.
5. routing server receives and processes topological state information.Routing server receives the topological state information of each via node.Whether what the topological state information of described via node mainly comprised the neighborhood paths surplus sub-key amount that predict at whether available, described available neighborhood paths two ends within the next topology update cycle of nodal information, this via node of this via node and this via node is in normal operating conditions in abutting connection with the quantum link.The nodal information of described via node mainly refers to the identification information of this via node and the relevant information that may relate in some Routing Protocols.
Can use if the via node at paths two ends is judged this path simultaneously, then routing server judges that this path can use; If any one via node at two ends, path judges that this path is unavailable, then routing server judges that this path is unavailable.The result of determination of two ends, path via node should be consistent under normal circumstances.
If routing server is known the unusual in abutting connection with the quantum link working state of a via node, then transmit a signal to immediately the via node of the other end of this quantum link, survey it and whether be in existing state.If routing server is not received feedback information and its topological state information that reports of this via node within predetermined time of delay, judge that then the neighborhood paths between the via node of this quantum both link ends is unavailable.
6. routing server distributing network topology state information.Whether the state information, the neighborhood paths between the via node that described network topology state information comprises via node information in the network, quantum link the information of the surplus sub-key amount that predict at available and described available neighborhood paths two ends.Routing server is distributed to each via node with up-to-date network topology state information termly every a topological update cycle.After via node is received up-to-date network topology state information, the neighborhood paths that calculates prediction according to 3 described methods immediately and report this via node information of the surplus sub-key amount that predict at available and described available neighborhood paths two ends whether within the next topology update cycle, and whether be in normal operating conditions according to what 4 described methods reported this via node in abutting connection with the quantum link, and the nodal information of this via node is reported routing server.
7. the deletion of via node.Routing server initiatively sends survival detection information to via node, if routing server is not received the feedback information of this via node within predetermined time of delay, and do not receive the topological state information that this via node reports yet, then think this via node dead, delete network topology state information corresponding to this via node.General following situations, routing server can initiatively send survival detection information to via node:
8. the access of via node and quantum link.Via node for new access network, new via node need to report its essential information and all operating states in abutting connection with the quantum link to routing server, with the adjacent node of stylish via node also need to report and this new via node between the operating state of quantum link; For the direct-connected quantum link of new access between two via nodes, the via node of quantum both link ends need to report the operating state of this link.In addition, whether the via node of new quantum both link ends will report neighborhood paths available within the next topology update cycle after receiving the topological lastest imformation of routing server, and the surplus sub-key amount predicted of described available neighborhood paths two ends.Routing server adds new via node information and/or new route information on the network topology structure to after receiving the reporting information of relevant via node.
9. the calculating of optimum routed path.Via node obtains the topological state information of whole network from server, according to the shortest path of following method calculating book via node to other via nodes:
1) topology information of supposing whole network is with scheming (G, E) expression, and wherein G represents the set on summit, E represents the set in path, and a summit among the corresponding G of this via node represents with s, construct the tree take s as root node, with the ground floor node of root node s as tree;
2) t is any one other summit among the G, t ≠ s, if have s among the E to the path (s of t, t), then with the child node of t as root node s, also be the second layer node of tree, and will with path (s, t) also add in the tree on corresponding limit, and all second layer nodes that satisfy condition among the G are added in search, and add corresponding limit;
3) number of plies of the tree that has constructed represents with L, with the set expression that does not belong to the residue summit of tree among the G is
For any summit
Consider that u arrives the quantity n in the path of the L node layer of setting:
If n=0 then considers next
In the summit;
If n〉0, if there are the path in u and certain L node layer r, then corresponding limit, this path is added in the tree, simultaneously u is added in the tree, as the L+1 node layer of tree, if L node layer r corresponding to this path occurs m time at the L layer, then corresponding limit, this path is added in the tree m time, simultaneously also corresponding interpolation m time of u makes node u corresponding one by one with each L node layer r; If it is complete that u has all added to the limit corresponding to all paths of L node layer of tree, then with u from
Middle deletion;
4) if also have the summit not add in the tree among the G, with L=L+1, repeating step 3), until the summit among all G all adds in the tree, or repeating step 3) after
Till the quantity on middle summit does not change;
5) for any one via node v, in tree s to the path of v be in the corresponding diagram (G, E) s to the shortest path of v, namely in network via node s to the shortest path of v; If exist more than a shortest path, then with each jumps the surplus sub-key amount in path separately by the ascending order arrangement in each bar shortest path, the minimum value that at first compares surplus sub-key amount, choose that paths of minimum value maximum, if minimum value is all identical, time minimum value relatively then, choose that paths of time minimum value maximum, the like, if the surplus sub-key amount of each bar shortest path is identical, then choose at random a paths.
10. the calculating of suboptimum routed path.If it is unavailable that via node detects by the down hop path of 9 shortest paths that calculate, then this via node is deleted the path of down hop in the network topology state information, again seeks the suboptimum routed path according to 9 described methods.
The beneficial effect of technique scheme of the present invention is as follows:
I. the present invention proposes a kind of perfect quantum cryptography networks dynamic routing scheme.The relay route of communication data between the network node in quantum cryptography networks no longer is single static path, but according to the shortest path of the variation Dynamic Selection of network topology state.
Ii. the method for routing of the technical program has adaptivity for deletion and the interpolation of network trunk node.This is conducive to the dynamic expansion of network.
Iii. scale and the complexity according to quantum cryptography networks arranges routing server employing centralized network Topology Management.This mode satisfies quantum cryptography networks has very fast convergence rate to network state requirement.
Iv. the most valuable Internet resources of quantum cryptography networks are quantum keys, adopt the SPF rule in the selection of optimum routed path, have saved quantum key, have improved network resource utilization, have improved network performance.
V. this routing plan has taken into full account the fail safe of each jumping of selected path, thereby has guaranteed the fail safe of communication data.
Description of drawings
Fig. 1: the general structure of quantum cryptography networks is the prior art accompanying drawing;
Fig. 2: terminal node Alice and Bob realize the quantum key coded communication by a via node, are the prior art accompanying drawing;
Fig. 3: terminal node Alice and Bob realize the quantum key coded communication by a plurality of via nodes, are the prior art accompanying drawing;
Fig. 4: the metropolitan area quantum cryptography networks is local;
Fig. 5: quantum cryptography networks routing framework figure;
Fig. 6: routing server main functional modules;
Fig. 7: routing client main functional modules;
Fig. 8: quantum cryptography networks via node Path Connection view;
Fig. 9: the adjacency matrix of expression network topology structure;
Figure 10: via node 27 is to the Shortest Path Searching tree of other via nodes;
Figure 11: the general work flow process of this dynamic routing method;
Wherein, 1, the first quantum concentrator station, 2, the second quantum concentrator station, 3, the 3rd quantum concentrator station, 4, the 4th quantum concentrator station, 5, optical switch, 6, one-level user, 7, secondary user, 8, routing server, 9, classical communication equipment, 10, quantum communications equipment, 11, the classical communication layer, 12, the quantum communications layer, 13, routing client, 14, the first network interface module, 15, the first topology information transceiver module, 16, via node survival detection module, 17, the topology information logic processing module, 18, the first via node information data library module, 19, the second network interface module, 20, the second topology information transceiver module, 21, survival detects feedback module, 22, routing calculation module, 23, the topology information processing module, 24, the topology information collection module, 25, routing selecting module, 26, the second via node information data library module, 27, the first via node, 28, the second via node, 29, the 3rd via node, 30, the 4th via node, 31, the 5th via node, 32, the 6th via node, 33, the 7th via node, 34, the 8th via node.
Embodiment
The invention will be further described below in conjunction with drawings and Examples:
Present embodiment for be the quantum cryptography networks of a metropolitan area scope, terminal node is thousands of, via node is less than 100.The via node of this metropolitan area network is the quantum concentrator station, general several terminal nodes of direct lower extension of concentrator station or hang several terminal nodes 5 times by optical switch.Accompanying drawing 4 is metropolitan area quantum cryptography networks partial schematic diagram, the first quantum concentrator station 1, the second quantum concentrator station 2 be the lower terminal node of hanging directly, the 4th quantum concentrator station 4 is hung terminal node 5 times by optical switch, and the 3rd quantum concentrator station 3 directly lower terminal node of hanging is hung terminal node 5 times by optical switch simultaneously.Wherein, the terminal node that the quantum concentrator station is hung for 5 times by optical switch is one-level user 6, and the quantum concentrator station directly lower terminal node of hanging is secondary user 7.
Secure communication between the metropolitan area quantum cryptography networks terminal node can be divided into following three kinds of situations;
1. the communication of 5 times terminal nodes of same optical switch;
2. the communication of 5 times terminal nodes of different optical switchs under the same concentrator station comprises directly lower communication of hanging terminal node;
3. the communication of terminal node under the different concentrator stations.
Front two kinds of situations are comparatively simple, and present embodiment is only considered the 3rd kind of situation.Because the path of terminal node and concentrator station is unique, get final product so only consider the route between the affiliated concentrator station of terminal node in the 3rd kind of situation.
One, route metric and route criterion
Route metric and route criterion are most important two aspects that routing algorithm will be considered.We with jumping figure as route metric, with the shortest jumping figure as the route criterion.When having mulitpath to arrive identical destination node, via node needs a kind of mechanism to calculate optimal path.Tolerance is a kind of variable that is assigned to route, and as a kind of means, tolerance can be the worst by preferably arriving, or by choosing at first the order of preferably selecting route is carried out grade classification.
Consider the particularity of quantum cryptography networks route, we use jumping figure as route metric.Just need the enabling decryption of encrypted process owing to every one time through a concentrator station via node, same communication data hop count is fewer, and the quantum key amount that its coded communication consumes is fewer.Present stage, the quantum cryptography networks traffic was subject to the quantum key formation speed, with the shortest jumping figure in path the first criterion as route, with the service efficiency of increase sub-key.
Two, topological convergence
Topological convergence refers to that the topological state information about whole network that the via node in the network obtains is consistent with the true topological state information of whole network.In the quantum cryptography networks communication data between the concentrator station each the step relaying all take amount sub-key between the concentrator station as prerequisite, the quantum key approach exhaustion, this path is unavailable path, and the via node of whole network needs to know immediately even in advance the variation of this topological state information.
In order to satisfy the requirement of Fast Convergent, we adopt centralized topology information management strategy, all via nodes only need directly and routing server 8 carries out the topological state information that can know alternately whole network between 2, this clearly is better than traditional classical network route based on the convergence rate of the topological state information transmission method of inundation, rearmounted convergence needs the number of times of information interaction often relevant with the diameter of network or network part, much larger than the former.
Three, based on the routing algorithm framework of centralized network Topology Management
In the present embodiment for corresponding with the routing server 8 that arranges, to be that the module of being responsible for RI-Pro in the concentrator station is referred to as routing client 13 in the via node, all routing modules are the soft mode piece, place high-performance computer, its relevant route is calculated has enough good computational speed.The network bandwidth environment of routing client 13 and routing server 8 is enough good simultaneously, and the transmission of its route topological information has enough little network delay.
Accompanying drawing 5 is quantum cryptography networks routing framework figure.Whole quantum cryptography networks routing framework is divided into classical communication layer 11 and quantum communications layer 12.Quantum communications layer 12 is made of the quantum communications equipment 10 in the concentrator station and the quantum link between the quantum communications equipment, is used for key distribution, can share the quantum key that is used for encryption and decryption communication between two quantum communications equipment 10.Classical communication layer 11 is made of the classical communication equipment 9 that contains routing client 13 and the routing server 8 in the concentrator station, is used for realizing the encryption and decryption of data and the transmission of enciphered data.There is neighborhood paths between the classical communication equipment 9 that contains routing client 13 in the concentrator station, corresponding with the quantum link.Within each topology update cycle, the routing client 13 of the classical communication equipment 9 that contains routing client 13 in the concentrator station is according to the state information of this collected via node, calculate and predict the surplus sub-key amount at neighborhood paths two ends in the next topology update cycle, if surplus sub-key amount is less than predetermined threshold value, think that then this neighborhood paths is unavailable, otherwise available, the surplus sub-key amount that this result and described available neighborhood paths two ends are predicted reports in routing server 8, and each topology update cycle reports once.The routing client 13 of the classical communication equipment 9 that contains routing client 13 in the concentrator station knows by the quantum communications equipment 10 in the concentrator station whether the quantum link is in normal operating conditions, and the result reported in routing server 8, each topology update cycle reports once.If the operating state of quantum link changes, then at any time operating state is reported routing server 8.
Four, routing server function
The main functional modules of routing server 8 comprises first network interface module 14, the first topology information transceiver module 15, via node survival detection module 16, topology information logic processing module 17 and the first via node information data library module 18 as shown in Figure 6.
Via node survival detection module 16 sends survival detection information to via node, receives the feedback information of via node, is responsible for confirming whether via node survives.
The first via node information data library module 18, the state information of storing basic configuration information and the quantum link of each via node.
Five, routing client function
The main functional modules of routing client 13 comprises that second network interface module 19, the second topology information transceiver module 20, survival detect feedback module 21, routing calculation module 22, topology information processing module 23, topology information collection module 24, routing selecting module 25 and the second via node information data library module 26 as shown in Figure 7.
Second network interface module 19, according to network communication protocol transceiver network data, and the accuracy of checking data transmitting-receiving.
Routing selecting module 25 reads the routing information in the via node information database, for communication data provides the down hop route.
Six, shortest path first
Via node obtains the topological state information of whole network from server, according to the shortest path of following method calculating book via node to other via nodes:
1) topology information of supposing whole network is with scheming (G, E) expression, and wherein G represents the set on summit, E represents the set in path, and a summit among the corresponding G of this via node represents with s, construct the tree take s as root node, with the ground floor node of root node s as tree;
2) t is any one other summit among the G, t ≠ s, if have s among the E to the path (s of t, t), then with the child node of t as root node s, also be the second layer node of tree, and will with path (s, t) also add in the tree on corresponding limit, and all second layer nodes that satisfy condition among the G are added in search, and add corresponding limit;
3) number of plies of the tree that has constructed represents with L, with the set expression that does not belong to the residue summit of tree among the G is
For any summit
Consider that u arrives the quantity n in the path of the L node layer of setting:
If n=0 then considers next
In the summit;
If n〉0, if there are the path in u and certain L node layer r, then corresponding limit, this path is added in the tree, simultaneously u is added in the tree, as the L+1 node layer of tree, if L node layer r corresponding to this path occurs m time at the L layer, then corresponding limit, this path is added in the tree m time, simultaneously also corresponding interpolation m time of u makes node u corresponding one by one with each L node layer r; If it is complete that u has all added to the limit corresponding to all paths of L node layer of tree, then with u from
Middle deletion;
4) if also have the summit not add in the tree among the G, with L=L+1, repeating step 3), until the summit among all G all adds in the tree, or repeating step 3) after
Till the quantity on middle summit does not change;
5) for any one via node v, in tree s to the path of v be in the corresponding diagram (G, E) s to the shortest path of v, namely in network via node s to the shortest path of v; If exist more than a shortest path, then with each jumps the surplus sub-key amount in path separately by the ascending order arrangement in each bar shortest path, the minimum value that at first compares surplus sub-key amount, choose that paths of minimum value maximum, if minimum value is all identical, time minimum value relatively then, choose that paths of time minimum value maximum, the like, if the surplus sub-key amount of each bar shortest path is identical, then choose at random a paths.
Seven, the access of concentrator station node and quantum link.
Concentrator station node for new access network, new via node need to report its basic configuration information and all operating states in abutting connection with the quantum link to routing server 8, with the adjacent node of stylish via node also need to report and this new via node between the operating state of quantum link; For the direct-connected quantum link of new access between two via nodes, the via node of quantum both link ends need to report the operating state of this link.In addition, whether the via node of new quantum both link ends will report neighborhood paths available within the next topology update cycle after receiving the topological lastest imformation of routing server 8, and the surplus sub-key amount predicted of described available neighborhood paths two ends.After routing server 8 is received the reporting information of interdependent node, new via node and/or new route information are added on the network topology structure.
Fig. 8 has provided the prediction connection layout of a small-sized quantum cryptography networks via node within some topologys update cycle, and wherein dotted line represents that the quantum key on the path is not enough, can not realize the quantum key coded communication on this path, and namely the path is unavailable; Solid line represents to carry out the quantum key coded communication on this path, and namely the path can be used.
Fig. 9 has provided the adjacency matrix of presentation graphs 8 network topology structures.Matrix dimension is 8X8, and whether neighborhood paths is available between the first via node 27 to the 8th via nodes 34 these 8 via nodes in the presentation graphs 8.Whether i via node of matrix element (i, j) (wherein 1≤i≤8,1≤j≤8) expression be available to the neighborhood paths of j via node, and its value is 1 to represent availablely, is 0 to represent unavailable or do not have neighborhood paths; The matrix diagonal element is 0, represents via node and self does not consist of neighborhood paths.For example, the neighborhood paths of the first via node 27 to the 4th via nodes 30 among Fig. 8 can be used, and then the value of the matrix element (Isosorbide-5-Nitrae) among corresponding Fig. 9 is 1; The neighborhood paths of the second via node 28 to the 6th via nodes 32 among Fig. 8 is unavailable, and then the value of the matrix element (2,6) among corresponding Fig. 9 is 0; Do not have neighborhood paths between the 5th via node 31 among Fig. 8 and the 7th via node 33, then the value of the matrix element (5,7) among corresponding Fig. 9 is 0; There are not neighborhood paths in the 3rd via node 29 and the 8th relaying between saving at 34 among Fig. 8, and then the value of the matrix element (3,8) among corresponding Fig. 9 is 0.
Figure 10 has represented the Shortest Path Searching tree of the first via node 27 according to the represented network topology structure structure of Fig. 9 adjacency matrix.Especially, there are two shortest paths in the first via node 27 to the 6th via nodes 32, and there are three shortest paths in the first via node 27 to the 8th via nodes 34, this moment need to be according to the present invention described in the step 5) of shortest path first choose a shortest path.For example, if the surplus sub-key amount of predicting between the first via node 27 and the 4th via node 30, the 7th via node 33 is respectively 70kB and 50kB, and the surplus sub-key amount of predicting between the 6th via node 32 and the 4th via node 30, the 7th via node 33 is respectively 40kB and 60kB; Because in two shortest paths of the first via node 27 to the 6th via nodes 32, each minimum value of jumping the surplus sub-key amount of predicting in path is respectively 40kB and 50kB separately, and 50kB is greater than 40kB, then choose the first via node 27 via this paths of the 7th via node 33 arrival the 6th via node 32, as the shortest path of the first via node 27 to the 6th via nodes 32.
As shown in figure 11, the general realization flow of this routing algorithm is divided into following concrete steps:
Step (1) arranges routing server;
Step (2), the periodically collection and treatment of via node state information;
Step (3), via node topology state information periodically reports;
Step (4), the topological state information of each via node is collected and processed to routing server;
Step (5), routing server is to each via node distributing network topology state information;
Step (6), the optimal path computation of via node.
Although above-mentionedly by reference to the accompanying drawings the specific embodiment of the present invention is described; but be not limiting the scope of the invention; one of ordinary skill in the art should be understood that; on the basis of technical scheme of the present invention, those skilled in the art do not need to pay various modifications that creative work can make or distortion still in protection scope of the present invention.
Claims (10)
1. quantum cryptography networks dynamic routing method, the method is according to the variation of quantum key amount between the via node of quantum cryptography networks, realize that the utilization subcipher is encrypted the dynamic routing selection of communication, it is characterized in that: for the via node of whole quantum cryptography networks arranges routing server, set the topological update cycle of quantum cryptography networks; Within each topology update cycle, the state information of this via node is collected and processed to each via node, and the result is reported in routing server; After routing server is collected the topological state information of each via node, generate the quantum cryptography networks topology state information in the next topology update cycle, and send it to all via nodes of quantum cryptography networks; Each via node is according to the quantum cryptography networks topology state information that obtains from routing server, calculates and determines that the purpose via node is the down hop route of the communication data of any one other via node according to the shortest path rule.
2. a kind of quantum cryptography networks dynamic routing method as claimed in claim 1 is characterized in that, the state information that described each via node is collected this via node comprises:
1) whether the quantum link between this via node and each adjacent node is in normal operating conditions;
2) the surplus sub-key amount between this via node and each adjacent node;
3) pace of change of the quantum key amount between this via node and each adjacent node.
3. a kind of quantum cryptography networks dynamic routing method as claimed in claim 2, it is characterized in that the pace of change of the quantum key amount between described via node and certain adjacent node is determined by depletion rate and the formation speed of the quantum key amount between this via node and this adjacent node.
4. a kind of quantum cryptography networks dynamic routing method as claimed in claim 2 or claim 3, it is characterized in that: within each topology update cycle, via node is according to the surplus sub-key amount between described that collect and certain adjacent node and the pace of change of quantum key amount, surplus sub-key amount in the next topology update cycle of calculating and prediction between this via node and this adjacent node, if the surplus sub-key amount that calculates is less than predetermined threshold value, think that then the neighborhood paths between this via node and this adjacent node is unavailable within the next topology update cycle, on the contrary available; Each via node is with the neighborhood paths that whether is in normal operating conditions, this via node in abutting connection with the quantum link of this via node information, this via node information of the surplus sub-key amount that predict at available and described available neighborhood paths two ends whether within the next topology update cycle, report in routing server, each topology update cycle reports once.
5. a kind of quantum cryptography networks dynamic routing method as claimed in claim 4, it is characterized in that: if the operating state of the quantum link between described via node and the adjacent node changes, then via node reports routing server with the operating state of described quantum link at any time.
6. a kind of quantum cryptography networks dynamic routing method as claimed in claim 5, it is characterized in that, after described routing server is collected the topological state information of each via node, generate the quantum cryptography networks topology state information in the next topology update cycle, described quantum cryptography networks topology state information comprises the via node information in the network, the state information of quantum link, whether the neighborhood paths between the via node information of the surplus sub-key amount that predict at available and described available neighborhood paths two ends, routing server sends to each via node in the quantum cryptography networks every a topological update cycle with up-to-date quantum cryptography networks topology state information, after each via node is received described quantum cryptography networks topology state information, calculate immediately the topological state information of predicting and reporting this via node, the topological state information of described via node comprises this via node information, this via node whether be in normal operating conditions in abutting connection with the quantum link, the neighborhood paths of this via node information of the surplus sub-key amount that predict at available and described available neighborhood paths two ends whether within the next topology update cycle.
7. a kind of quantum cryptography networks dynamic routing method as claimed in claim 6, it is characterized in that, if the via node of routing server throughput sublink one end knows that this quantum link is in the abnormal work state, then routing server send immediately the survival detection signal confirm whether the via node of this quantum link other end keeps operating state, if routing server is not received feedback information and its topological state information that reports of this via node within predetermined time of delay, think that then this via node is unavailable, relevant information corresponding to this via node of deletion in described quantum cryptography networks topology state information.
8. a kind of quantum cryptography networks dynamic routing method as claimed in claim 6, it is characterized in that: if in quantum cryptography networks, access new via node, new via node initiatively reports the essential information of this new via node and the operating state of quantum link between the adjacent node of new via node therewith to routing server, with the operating state of the quantum link between the adjacent node of stylish via node also active reporting and this new via node; If the new quantum link of access between two via nodes, the via node of new quantum both link ends initiatively reports the operating state of this quantum link to routing server; In addition, the via node of new quantum both link ends is after receiving the topological lastest imformation of routing server, report its neighborhood paths whether available within the next topology update cycle to routing server, and the surplus sub-key amount predicted of described available neighborhood paths two ends; Routing server adds new via node information and/or new route information on the network topology structure to after receiving the reporting information of relevant via node.
9. such as the described a kind of quantum cryptography networks dynamic routing method of any one in the claim 6 to 8, it is characterized in that described shortest path rule is as follows:
1) topology information of supposing whole network is with scheming (G, E) expression, and wherein G represents the set on summit, E represents the set in path, and a summit among the corresponding G of this via node represents with s, construct the tree take s as root node, with the ground floor node of root node s as tree;
2) t is any one other summit among the G, t ≠ s, if have s among the E to the path (s of t, t), then with the child node of t as root node s, also be the second layer node of tree, and will with path (s, t) also add in the tree on corresponding limit, and all second layer nodes that satisfy condition among the G are added in search, and add corresponding limit;
3) number of plies of the tree that has constructed represents with L, with the set expression that does not belong to the residue summit of tree among the G is
For any summit
Consider that u arrives the quantity n in the path of the L node layer of setting:
If n=0 then considers next
In the summit;
If n〉0, if there are the path in u and certain L node layer r, then corresponding limit, this path is added in the tree, simultaneously u is added in the tree, as the L+1 node layer of tree, if L node layer r corresponding to this path occurs m time at the L layer, then corresponding limit, this path is added in the tree m time, simultaneously also corresponding interpolation m time of u makes node u corresponding one by one with each L node layer r; If it is complete that u has all added to the limit corresponding to all paths of L node layer of tree, then with u from
Middle deletion;
4) if also have the summit not add in the tree among the G, with L=L+1, repeating step 3), until the summit among all G all adds in the tree, or repeating step 3) after
Till the quantity on middle summit does not change;
5) for any one via node v, in tree s to the path of v be in the corresponding diagram (G, E) s to the shortest path of v, namely in network via node s to the shortest path of v; If exist more than a shortest path, then with each jumps the surplus sub-key amount in path separately by the ascending order arrangement in each bar shortest path, the minimum value that at first compares surplus sub-key amount, choose that paths of minimum value maximum, if minimum value is all identical, time minimum value relatively then, choose that paths of time minimum value maximum, the like, if the surplus sub-key amount of each bar shortest path is identical, then choose at random a paths.
10. a kind of quantum cryptography networks dynamic routing method as claimed in claim 9, it is characterized in that, if the down hop path of the shortest path that searches according to described shortest path rule is unavailable, then the deletion in quantum cryptography networks topology state information of this via node is sought shortest path according to described shortest path rule to the path of down hop again according to the quantum cryptography networks topology state information of revising.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410830577.5A CN104579964B (en) | 2013-01-07 | 2013-01-07 | A kind of quantum cryptography networks dynamic routing architecture system |
| CN201310005105.1A CN103001875B (en) | 2013-01-07 | 2013-01-07 | Quantum cryptography network dynamic routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310005105.1A CN103001875B (en) | 2013-01-07 | 2013-01-07 | Quantum cryptography network dynamic routing method |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410830577.5A Division CN104579964B (en) | 2013-01-07 | 2013-01-07 | A kind of quantum cryptography networks dynamic routing architecture system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103001875A true CN103001875A (en) | 2013-03-27 |
| CN103001875B CN103001875B (en) | 2015-03-11 |
Family
ID=47930028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310005105.1A Active CN103001875B (en) | 2013-01-07 | 2013-01-07 | Quantum cryptography network dynamic routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103001875B (en) |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104283789A (en) * | 2014-09-19 | 2015-01-14 | 深圳市腾讯计算机系统有限公司 | Routing convergence method and system |
| CN104754626A (en) * | 2013-12-26 | 2015-07-01 | 北京亿阳信通科技有限公司 | Transmission network physical node networking analysis method and device |
| CN105471576A (en) * | 2015-12-28 | 2016-04-06 | 科大国盾量子技术股份有限公司 | Quantum key relaying method, quantum terminal nodes and quantum key relaying system |
| CN106341328A (en) * | 2016-08-24 | 2017-01-18 | 东南大学 | Routing method of grid structure quantum communication network |
| CN106972922A (en) * | 2013-06-08 | 2017-07-21 | 科大国盾量子技术股份有限公司 | A kind of mobile secret communication method based on quantum key distribution network |
| CN107093142A (en) * | 2017-03-24 | 2017-08-25 | 钱德君 | Legal tender bond and assets management method in a kind of Quantum Chain |
| CN107094078A (en) * | 2017-06-01 | 2017-08-25 | 浙江九州量子信息技术股份有限公司 | A kind of quantum key synchronization system and synchronous method based on multilevel relay |
| CN107135072A (en) * | 2017-06-05 | 2017-09-05 | 三峡大学 | A kind of wireless sensor network system based on quantum cryptography |
| CN107483192A (en) * | 2017-08-25 | 2017-12-15 | 厦门科华恒盛股份有限公司 | A kind of data transmission method and device based on quantum communication |
| CN108023725A (en) * | 2016-11-04 | 2018-05-11 | 华为技术有限公司 | A kind of quantum key trunking method and device based on centralized management with control network |
| CN108734299A (en) * | 2017-04-19 | 2018-11-02 | 埃森哲环球解决方案有限公司 | Quantum calculation machine study module |
| CN109120333A (en) * | 2018-07-13 | 2019-01-01 | 北京邮电大学 | Service protecting method and system in a kind of quantum key distribution optical-fiber network |
| CN109714261A (en) * | 2019-01-11 | 2019-05-03 | 东南大学 | A kind of multi-broadcast routing method based on fidelity measurement in quantum communication network |
| CN109743164A (en) * | 2019-01-24 | 2019-05-10 | 北京邮电大学 | Channel resource allocation method and device in a kind of quantum satellite network |
| CN109962774A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key relays dynamic routing method |
| CN109962775A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key generates control method |
| CN110086713A (en) * | 2019-04-17 | 2019-08-02 | 北京邮电大学 | It is a kind of to divide domain method for routing for wide area quantum key distribution network |
| CN107508671B (en) * | 2017-08-18 | 2020-06-12 | 北京邮电大学 | Business communication method and device based on quantum key distribution |
| CN111355655A (en) * | 2018-12-21 | 2020-06-30 | 山东量子科学技术研究院有限公司 | Quantum routing detection method and server for quantum cryptography network |
| CN111385087A (en) * | 2018-12-27 | 2020-07-07 | 山东量子科学技术研究院有限公司 | Reliable key relay method and system thereof |
| CN113452509A (en) * | 2020-03-24 | 2021-09-28 | 国科量子通信网络有限公司 | Multi-path quantum key distribution method based on SDN |
| CN114362938A (en) * | 2020-12-31 | 2022-04-15 | 广东国腾量子科技有限公司 | Key management dynamic route generation network architecture and method for quantum communication |
| CN114465718A (en) * | 2022-01-07 | 2022-05-10 | 南京邮电大学 | Multi-protocol translation method and related equipment for quantum key distribution service |
| CN114499863A (en) * | 2022-04-15 | 2022-05-13 | 深圳市永达电子信息股份有限公司 | Multi-party authentication method based on time division and space division and computer readable storage medium |
| CN114697002A (en) * | 2020-12-28 | 2022-07-01 | 科大国盾量子技术股份有限公司 | Distributed quantum cipher network group key distribution method and system |
| WO2022142461A1 (en) * | 2020-12-28 | 2022-07-07 | 科大国盾量子技术股份有限公司 | Distributed wide area quantum cryptography network group key distribution method and system |
| CN115460129A (en) * | 2022-09-12 | 2022-12-09 | 国科量子通信网络有限公司 | Quantum key distribution routing method based on OSPF protocol |
| CN114362939B (en) * | 2020-12-31 | 2023-10-24 | 广东国腾量子科技有限公司 | Dynamic route forwarding method, storage device and intelligent terminal based on trusted relay quantum secret communication network |
| JP7467664B2 (en) | 2021-11-08 | 2024-04-15 | コリア インスティテュート オブ サイエンス アンド テクノロジー インフォメーション | Quantum key management device and method of operation thereof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7392378B1 (en) * | 2003-03-19 | 2008-06-24 | Verizon Corporate Services Group Inc. | Method and apparatus for routing data traffic in a cryptographically-protected network |
| CN102291312A (en) * | 2011-09-05 | 2011-12-21 | 电子科技大学 | Routing selection method based on hierarchical IP (Internet Protocol) network coordinate system |
| CN102447584A (en) * | 2012-01-04 | 2012-05-09 | 无锡云捷科技有限公司 | System and method for optimizing VPN (Virtual Private Network) link |
| US20120195428A1 (en) * | 2005-09-30 | 2012-08-02 | Verizon Patent And Licensing, Inc. | Quantum key distribution system |
-
2013
- 2013-01-07 CN CN201310005105.1A patent/CN103001875B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7392378B1 (en) * | 2003-03-19 | 2008-06-24 | Verizon Corporate Services Group Inc. | Method and apparatus for routing data traffic in a cryptographically-protected network |
| US20120195428A1 (en) * | 2005-09-30 | 2012-08-02 | Verizon Patent And Licensing, Inc. | Quantum key distribution system |
| CN102291312A (en) * | 2011-09-05 | 2011-12-21 | 电子科技大学 | Routing selection method based on hierarchical IP (Internet Protocol) network coordinate system |
| CN102447584A (en) * | 2012-01-04 | 2012-05-09 | 无锡云捷科技有限公司 | System and method for optimizing VPN (Virtual Private Network) link |
Non-Patent Citations (1)
| Title |
|---|
| 韩伟 等: "基于信任中继的QKD网络研究", 《军事通信技术》 * |
Cited By (53)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106972922A (en) * | 2013-06-08 | 2017-07-21 | 科大国盾量子技术股份有限公司 | A kind of mobile secret communication method based on quantum key distribution network |
| CN106972922B (en) * | 2013-06-08 | 2019-06-14 | 科大国盾量子技术股份有限公司 | A kind of mobile secret communication method based on quantum key distribution network |
| CN104754626B (en) * | 2013-12-26 | 2019-02-01 | 成都亿阳信通信息技术有限公司 | A kind of transmission network physical node Analysis of Networking method and apparatus |
| CN104754626A (en) * | 2013-12-26 | 2015-07-01 | 北京亿阳信通科技有限公司 | Transmission network physical node networking analysis method and device |
| CN104283789B (en) * | 2014-09-19 | 2016-04-13 | 深圳市腾讯计算机系统有限公司 | Route convergent method and system |
| CN104283789A (en) * | 2014-09-19 | 2015-01-14 | 深圳市腾讯计算机系统有限公司 | Routing convergence method and system |
| CN105471576A (en) * | 2015-12-28 | 2016-04-06 | 科大国盾量子技术股份有限公司 | Quantum key relaying method, quantum terminal nodes and quantum key relaying system |
| CN106341328A (en) * | 2016-08-24 | 2017-01-18 | 东南大学 | Routing method of grid structure quantum communication network |
| CN106341328B (en) * | 2016-08-24 | 2019-06-25 | 东南大学 | A kind of method for routing of network quantum communication network |
| CN108023725A (en) * | 2016-11-04 | 2018-05-11 | 华为技术有限公司 | A kind of quantum key trunking method and device based on centralized management with control network |
| KR20190073520A (en) * | 2016-11-04 | 2019-06-26 | 후아웨이 테크놀러지 컴퍼니 리미티드 | Method and apparatus for relaying quantum cryptographic keys based on centralized management and control networks |
| WO2018082345A1 (en) * | 2016-11-04 | 2018-05-11 | 华为技术有限公司 | Quantum key relay method and device based on centralized management and control network |
| JP7026748B2 (en) | 2016-11-04 | 2022-02-28 | 華為技術有限公司 | Quantum key relay method and equipment based on centralized control network |
| KR102327941B1 (en) * | 2016-11-04 | 2021-11-17 | 후아웨이 테크놀러지 컴퍼니 리미티드 | Quantum cryptographic key relay method and device based on centralized management and control network |
| CN108023725B (en) * | 2016-11-04 | 2020-10-09 | 华为技术有限公司 | Quantum key relay method and device based on centralized management and control network |
| CN112217637B (en) * | 2016-11-04 | 2024-03-15 | 华为技术有限公司 | Quantum key relay method and device based on centralized management and control network |
| JP2020501413A (en) * | 2016-11-04 | 2020-01-16 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Quantum key relay method and apparatus based on centralized control network |
| JP2021010179A (en) * | 2016-11-04 | 2021-01-28 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Quantum key relay method and device based on centralized management and control network |
| CN112217637A (en) * | 2016-11-04 | 2021-01-12 | 华为技术有限公司 | Quantum key relay method and device based on centralized management and control network |
| EP3528429A4 (en) * | 2016-11-04 | 2019-10-30 | Huawei Technologies Co., Ltd. | Quantum key relay method and device based on centralized management and control network |
| CN107093142A (en) * | 2017-03-24 | 2017-08-25 | 钱德君 | Legal tender bond and assets management method in a kind of Quantum Chain |
| US11803772B2 (en) | 2017-04-19 | 2023-10-31 | Accenture Global Solutions Limited | Quantum computing machine learning module |
| CN108734299A (en) * | 2017-04-19 | 2018-11-02 | 埃森哲环球解决方案有限公司 | Quantum calculation machine study module |
| CN107094078A (en) * | 2017-06-01 | 2017-08-25 | 浙江九州量子信息技术股份有限公司 | A kind of quantum key synchronization system and synchronous method based on multilevel relay |
| CN107135072A (en) * | 2017-06-05 | 2017-09-05 | 三峡大学 | A kind of wireless sensor network system based on quantum cryptography |
| CN107508671B (en) * | 2017-08-18 | 2020-06-12 | 北京邮电大学 | Business communication method and device based on quantum key distribution |
| CN107483192A (en) * | 2017-08-25 | 2017-12-15 | 厦门科华恒盛股份有限公司 | A kind of data transmission method and device based on quantum communication |
| CN109962775A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key generates control method |
| CN109962774A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key relays dynamic routing method |
| CN109120333A (en) * | 2018-07-13 | 2019-01-01 | 北京邮电大学 | Service protecting method and system in a kind of quantum key distribution optical-fiber network |
| CN111355655A (en) * | 2018-12-21 | 2020-06-30 | 山东量子科学技术研究院有限公司 | Quantum routing detection method and server for quantum cryptography network |
| CN111355655B (en) * | 2018-12-21 | 2021-12-14 | 山东量子科学技术研究院有限公司 | Quantum routing detection method and server for quantum cryptography network |
| CN111385087A (en) * | 2018-12-27 | 2020-07-07 | 山东量子科学技术研究院有限公司 | Reliable key relay method and system thereof |
| CN111385087B (en) * | 2018-12-27 | 2023-01-03 | 山东量子科学技术研究院有限公司 | Reliable key relay method and system thereof |
| CN109714261B (en) * | 2019-01-11 | 2020-12-25 | 东南大学 | Multicast routing method based on fidelity measurement in quantum communication network |
| CN109714261A (en) * | 2019-01-11 | 2019-05-03 | 东南大学 | A kind of multi-broadcast routing method based on fidelity measurement in quantum communication network |
| CN109743164A (en) * | 2019-01-24 | 2019-05-10 | 北京邮电大学 | Channel resource allocation method and device in a kind of quantum satellite network |
| CN110086713B (en) * | 2019-04-17 | 2020-11-24 | 北京邮电大学 | Domain-divided routing method for wide-area quantum key distribution network |
| CN110086713A (en) * | 2019-04-17 | 2019-08-02 | 北京邮电大学 | It is a kind of to divide domain method for routing for wide area quantum key distribution network |
| CN113452509A (en) * | 2020-03-24 | 2021-09-28 | 国科量子通信网络有限公司 | Multi-path quantum key distribution method based on SDN |
| CN113452509B (en) * | 2020-03-24 | 2023-06-02 | 国科量子通信网络有限公司 | SDN-based multipath quantum key distribution method |
| WO2022142461A1 (en) * | 2020-12-28 | 2022-07-07 | 科大国盾量子技术股份有限公司 | Distributed wide area quantum cryptography network group key distribution method and system |
| CN114697002A (en) * | 2020-12-28 | 2022-07-01 | 科大国盾量子技术股份有限公司 | Distributed quantum cipher network group key distribution method and system |
| CN114362939B (en) * | 2020-12-31 | 2023-10-24 | 广东国腾量子科技有限公司 | Dynamic route forwarding method, storage device and intelligent terminal based on trusted relay quantum secret communication network |
| CN114362938B (en) * | 2020-12-31 | 2024-01-30 | 广东国腾量子科技有限公司 | Quantum communication key management dynamic route generation network architecture and method |
| CN114362938A (en) * | 2020-12-31 | 2022-04-15 | 广东国腾量子科技有限公司 | Key management dynamic route generation network architecture and method for quantum communication |
| JP7467664B2 (en) | 2021-11-08 | 2024-04-15 | コリア インスティテュート オブ サイエンス アンド テクノロジー インフォメーション | Quantum key management device and method of operation thereof |
| CN114465718A (en) * | 2022-01-07 | 2022-05-10 | 南京邮电大学 | Multi-protocol translation method and related equipment for quantum key distribution service |
| CN114465718B (en) * | 2022-01-07 | 2023-11-03 | 南京邮电大学 | Multi-protocol translation method and related equipment for quantum key distribution service |
| CN114499863B (en) * | 2022-04-15 | 2022-08-23 | 深圳市永达电子信息股份有限公司 | Multi-party authentication method based on time division and space division and computer readable storage medium |
| CN114499863A (en) * | 2022-04-15 | 2022-05-13 | 深圳市永达电子信息股份有限公司 | Multi-party authentication method based on time division and space division and computer readable storage medium |
| CN115460129A (en) * | 2022-09-12 | 2022-12-09 | 国科量子通信网络有限公司 | Quantum key distribution routing method based on OSPF protocol |
| CN115460129B (en) * | 2022-09-12 | 2023-07-11 | 国科量子通信网络有限公司 | Quantum key distribution routing method based on OSPF protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103001875B (en) | 2015-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103001875B (en) | Quantum cryptography network dynamic routing method | |
| CN104579964A (en) | Dynamic route architecture system for quantum cryptography network | |
| CN110086713B (en) | Domain-divided routing method for wide-area quantum key distribution network | |
| Yao et al. | EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks | |
| CN108270557B (en) | Backbone network system based on quantum communication and relay method thereof | |
| Al-Karaki et al. | Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms | |
| He et al. | Cross-layer optimization of correlated data gathering in wireless sensor networks | |
| CN102804712B (en) | Method and apparatus for selecting between multiple equal cost paths | |
| CN102112981A (en) | Distribution of virtual machines in a communication network | |
| GB2502775A (en) | Selecting routes between nodes in a network based on node processing gain and lifetime | |
| Behdani et al. | Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks | |
| CN109962773A (en) | Wide area quantum cryptography networks data encryption method for routing | |
| CN105553869A (en) | Method and system for risk balancing for power communication network | |
| CN102711125A (en) | Method for improving transmission capability of wireless mesh network | |
| CN109962774A (en) | Quantum cryptography networks key relays dynamic routing method | |
| Hassan et al. | A novel energy efficient vice Cluster Head routing protocol in Wireless Sensor Networks | |
| Fatmi et al. | Distributed multipath routing for data center networks based on stochastic traffic modeling | |
| Santiago et al. | EALBA: energy aware load balancing algorithm for IoT networks | |
| Stai et al. | Topology enhancements in wireless multihop networks: A top-down approach | |
| Balaji et al. | Fuzzy based particle swarm optimization routing technique for load balancing in wireless sensor networks | |
| Shi et al. | Modeling and designing routing protocols in quantum networks | |
| Tomović et al. | Extending the lifetime of wireless sensor network with partial SDN deployment | |
| Dana et al. | Backup path set selection in ad hoc wireless network using link expiration time | |
| Murthy et al. | Network lifetime analytical model for node-disjoint multipath routing in wireless sensor networks | |
| Zeng et al. | Entanglement routing design over quantum networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee after: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee after: QUANTUM COMMUNICATION TECHNOLOGY CO., LTD. Address before: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee before: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee before: Anhui Liangzi Communication Technology Co., Ltd. |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160426 Address after: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee after: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee after: QUANTUM COMMUNICATION TECHNOLOGY CO., LTD. Patentee after: BEIJING GUANGYU LIANGZI COMMUNICATION TECHNOLOGY CO., LTD. Address before: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee before: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee before: QUANTUM COMMUNICATION TECHNOLOGY CO., LTD. |
|
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee after: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee after: QUANTUM COMMUNICATION TECHNOLOGY CO., LTD. Patentee after: Beijing State Shield Quantum Information Technology Co., Ltd. Address before: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 Information Communication Institute of building B Patentee before: Shandong Institute of Quantum Science and Technology Co., Ltd. Patentee before: QUANTUM COMMUNICATION TECHNOLOGY CO., LTD. Patentee before: BEIJING GUANGYU LIANGZI COMMUNICATION TECHNOLOGY CO., LTD. |