Aiming at the problem that the quantum key distribution strategy in the existing QKD network based on key relay cannot meet the routing requirements in the hybrid network environment, we analyzes the routing characteristics of the classic-quantum hybrid network and proposes the corresponding routing requirements, and then designs the quantum key distribution strategy based on ant colony algorithm. The ant colony algorithm is used to analyze the execution cost of ants to search for the best global quantum key distribution, which improves the key routing efficiency in the classical and quantum hybrid network environment. Simulation results show that the proposed scheme has the advantages of fast convergence of routing update, small delay of quantum key distribution and more balanced network load.
Aiming at the problem that the quantum key distribution strategy in the existing QKD network based on key relay cannot meet the routing requirements in the hybrid network environment, we analyzes the routing characteristics of the classic-quantum hybrid network and proposes the corresponding routing requirements, and then designs the quantum key distribution strategy based on ant colony algorithm. The ant colony algorithm is used to analyze the execution cost of ants to search for the best global quantum key distribution, which improves the key routing efficiency in the classical and quantum hybrid network environment. Simulation results show that the proposed scheme has the advantages of fast convergence of routing update, small delay of quantum key distribution and more balanced network load.
With the continuous development of quantum computing technology, Quantum Key Distribution (QKD) is an important means of secure communication in the post-quantum era. However, the high cost of trusted routing relays in QKD networks has hindered its widespread adoption in power systems. Reducing costs is the key to the popularization of QKD in large-scale data grid scenarios. Therefore, this paper proposes a routing scheme for QKD network in a hybrid trusted environment. Our scheme is based on SDN architecture, utilizing the characteristics of QKD network in hybrid trusted environment, through prioritizing the selection of trusted paths (composed entirely of trusted quantum nodes) and backup selection of hybrid trusted paths (composed of both trusted and semi-trusted quantum nodes), implementing a unified dynamic routing strategy to obtain the optimal quantum routing path. Furthermore, by collecting topology information and real-time link status of the power grid, a calculation method for the number of paths and link costs is proposed to maximize load balancing in the network. Finally, the simulation results demonstrate that our scheme outperforms routing schemes relying solely on trusted quantum nodes for key distribution, as well as other cooperative routing schemes involving semi-trusted quantum nodes, in terms of success rate of distribution and load balancing.
The logistics distribution route problem is a NP problem which possesses important practical value. A novel optimization method of logistics distribution route is proposed based on Quantum Ant Colony Algorithm(QACA)to overcome the problems such as long computing time and easy to fall into local best for traditional heuristic optimization algorithm. The optimization problem of logistics distribution routing is analyzed, and the mathematical model is established, and then the quantum ant colony algorithm is used to solve it, and the pheromone on each path is encoded by a group of quantum bits,and a new pheromone representation is designed,called quantum pheromone, and the quantum rotation gate and the best tour are applied to updating the pheromone. The simulation test is carried out to test the performance of QACA. The simulation results show that, QACA has a strong global search ability and convergence speed, and can effectively solve the logistics distribution routing problem.
Aiming at the Traveling Salesman Problem based on ant colony optimization which is easy to fall into local optimums and has a slow convergence rate,a hybrid quantum ant colony optimization algorithm is presented.In this algorithm,the pheromone on each path is encoded by a group of quantum bits,the quantum rotation gate and ant's tour are used to update the pheromone so as to accelerate its convergence speed.To avoid the search falling into local optimum,the new neighborhood exchange strategy is designed to improve solution efficiency.Some cases from the TSP library(TSPLIB)are used to experiment,the results show that the algorithm has rapider convergence speed and higher accuracy than the classical ant colony algorithm.
In process of deploying large-scale quantum key distribution(QKD) networks, in order to solve the problems of service congestion, key waste and uneven resource allocation in key relay, inspired by the behaviour of fish-like intelligent clusters in nature, this paper proposes a simulated fish stochastic routing scheme suitable for partially-trusted relay QKD network scenarios. Firstly, the routing process of key distribution is regarded as the optimization behavior of fish swarm, and the simulated behavior model of fish swarm under the key transmission mechanism is constructed. Secondly, the distance factor and routing cost are incorporated to the food concentration of the node as a routing evaluation index, this paper establishes the ILP routing model based on the maximum food concentration and the fish-sense routing model. Finally, in order to deploy the network resources, a stochastic routing algorithm based on perceived fish swarm for QKD network is designed. Simulation results show that this scheme can effectively improve the quantum key distribution success rate, and the average key consumption of the optical path is less. When attackers adopt the equal probability attack strategy, the overall security probability of the scheme is improved by 8% and 2% compared to the Random and RIP-SRA algorithms. In terms of link load uniformity, the labeled diffusion behavior can effectively balance the key on QKD network. The standard deviation of the average key residual is 270.2673, and the key consumption tends to be levelled off.
Quantum key distribution (QKD) technology, a secure communication method based on the fundamental principles of quantum mechanics, enables secure key sharing between two communication nodes. In theory, the unconditional security of the QKD protocol depends on ideal quantum devices, classical devices, and perfect random number generation. However, there are significant differences between the devices in the actual system and the ideal conditions, and QKD systems are inevitably affected by various noises that seriously affect the anti-interference performance and key generation efficiency of the system. In this article, the authors analyze the anti-interference performance of the QKD protocol in noisy environments and propose a QKD network routing algorithm based on trust relay. This algorithm effectively reduces the bit error rate during network transmission and improves the efficiency of key distribution by optimizing the selection strategy of relay nodes and key forwarding paths.
Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.