Research On Routing And Resource Allocation Technology Of Quantum Key Distribution Network Based On Partially Trusted Relay

In today's era,with the rapid development of information network,every field of human life has been penetrated by the network.With the increasing amount of information on the network,the security of network information is becoming more and more important.Quantum key distribution(QKD)is an important branch of quantum secure communication,which can guarantee theoretically unconditionally secure communication,and has a broad development prospect and potential.At present,the point-to-point quantum key distribution technology develops rapidly and is gradually mature application.The future research focus will be on QKD networking.Quantum key distribution network can realize long-distance multi-user communication at high transmission rate by using trusted relay.However,in practice,the insecurity of trusted relay cannot be ignored,and in the future,QKD networks will generally be a mixture of trusted relay and untrusted relay in partial trusted relay scenarios.Therefore,QKD network technology based on partial trusted relay is of great significance for the wide deployment and practical application of quantum networks in the future.This paper focuses on the routing and resource allocation of QKD network based on partial trusted relay,focusing on the routing algorithm and survivability problems.The main research work and innovative achievements are as follows:(1)To solve the problem of secure key distribution in QKD network scenarios based on partial trusted relay,a cooperative quantum key relay method based on partial trusted relay is proposed.Based on this method,a cooperative routing ILP model of QKD network based on partial trusted relay is proposed.Through the cooperation of MDI-QKD protocol and trusted relay technology,the method realizes secure key relay in QKD network scenarios where trusted relay and untrusted relay exist mixed.Then an integer linear programming model is built for routing selection from two aspects,including the minimum key resource consumption priority routing model and the maximum key link key surplus priority routing model,and the constraint conditions are given.A mathematical programming model based on open source optimization tool results show that the simulation results show that the trusted relay and untrusted relay are 50%of the lattice type of QKD network topology,the proposed ILP model can be according to the conditions of the request,in part based on credible QKD network scenario to find feasible optimal routing,and reaches a certain number of business can effectively reduce the total consumption of key resources and key link key consumption.(2)Aiming at the routing problem of QKD network based on partial trusted relay,a collaborative routing scheme based on partial trusted relay is proposed.This scheme can calculate the optimal route satisfying the condition for the business request set in static network environment.Considering the total consumption of key resources and the key surplus of key link,the scheme designs two sub-algorithms:the minimum key resource consumption priority routing algorithm and the maximum key surplus priority routing algorithm.Through simulation,the proposed collaborative routing scheme is compared with the non-collaborative routing scheme,and the proposed algorithm can improve the success rate of key distribution by 20%-50%under the simulation environment in this paper.Then,the performance of the proposed algorithm in ring,tree and lattice topologies is verified by simulation.The simulation results show that the success rate of key distribution in lattice mesh network is 30%?40%higher than that in tree and ring topology.Finally,the results of the proposed algorithm and the ideal ILP model are compared by simulation.The comparison of the results shows that the key consumption ratio of the proposed algorithm is only 12%lower than that of ILP,and the key key surplus ratio is 10%lower than that of ILP.The proposed algorithm needs little computing resources and computation time,but can achieve the performance close to that of ILP.(3)Aiming at the survivability problem of QKD routing based on partial trusted relay,a routing protection strategy for QKD network based on partial trusted relay is proposed.This strategy improves the survivability of QKD network by means of alternate routing,so as to avoid the traffic jam caused by link failure.The core of this strategy is the route protection algorithm and its traversal re-pathfinding algorithm.Alternate routes are selected based on the proposed collaborative routing scheme.When all the routes calculated by the proposed collaborative routing scheme are unavailable,the trusted routes are recalculated through the traversal re-pathfinding algorithm.Simulation results show that the proposed route protection algorithm can effectively find alternate routes without affecting the stability of the current network.Among them,the simulation scenario set up two types of topology in different number of nodes and different network loads,the conclusion is obtained by simulation,the strategy in lattice topology network in the network size and network load under the two variables was reduced by 15%?21%of key distribution model.next,in the tree topology network was reduced by 12%?16%of key distribution model.next.To sum up,this paper focuses on the routing and resource allocation of QKD network based on partial trusted relay,and puts forward innovative solutions in routing algorithm and survivability.The research in this paper improves the practicability of future QKD networks and provides technical support for the development of large-scale QKD optical networks.