Research On Kry Resource Allocation Optimiaztion Technology Over Quantum Key Distribution Metropolitan Area Network

Today’s network has penetrated into politics,economy,culture,society,military and other fields,however,the information of network is currently facing serious security risks.Quantum Key Distribution(QKD)based on quantum mechanics can distribute information-theoretic security keys between two nodes.Combined with a one-time encryption method,QKD can ensure the unconditional security of encrypted communication,and eliminate the hidden dangers of network information security.To achieve the widespread deployment of the QKD system and the industrial application of the QKD technology,the point-to-point quantum key distribution system is gradually expanding into a quantum key distribution network.the metropolitan area network(MAN)is a hub connecting the Internet and the inter-city network,replacing 75%of the total traffic of the entire communication network.Therefore,it is of great significance to ensure secure and confidential communication within the MAN.However,the current secret key rate is low and how to make high use of the network resource optimization technology to build an efficient and scalable quantum key distribution metropolitan area network(QMAN)has great scientific value and research significance.Based on the National Natural Science Foundation of China,this paper has conducted in-depth research on how to efficiently perform QMAN from the aspects of network architecture,node structure,and resource allocation.Two kinds of quantum relay topologies are designed,and metropolitan area networks are allocated for quantum keys.Corresponding key resource allocation schemes are proposed in two different scenarios,which improve the overall utilization efficiency of the quantum keys in the QMAN multipoint interconnection scenario.The main tasks and innovations are as follows:First of all,in view of the contradiction between the single function and the diversified requirements of the current quantum node,this paper designs a quantum node that supports the bypass function,so that the node can determine whether it is necessary to perform encryption and decryption operations on the node according to the control information.This node structure improves the compatibility of the nodes and provides a material basis for building a repeaterless network within the metropolitan area network.In addition,a quantum node with multi-relay function is designed in this paper.The node implements multi-point relay of the encryption key by means of a beam splitter and other equipment.It provides new ideas for global quantum key distribution and secure multicast services.Secondly,in view of the problem of insufficient supply of key resources in QMAN,this paper proposes two bypass-based routing and key resource allocation algorithms with the help of quantum nodes that support the bypass function.The algorithm reduces the consumption of key resources by bypassing some nodes in the routing path.Simulation results show that compared with routing resource allocation algorithms that do not bypass at all,these two algorithms save more than 20%of the key resources,which greatly improves the success rate of key distribution for security services.Thirdly,in order to solve the problem of low resource utilization efficiency of key resource allocation in secure multicast scenario,in this paper,with the help of quantum nodes that support multiple relay functions,a routing resource allocation algorithm based on the key relay tree is proposed.The same data on the same link is encrypted with only one key,which improves the security and the resource utilization efficiency in a secure multicast scenario.Aiming at the quantum key distribution data center network(QDCN)scenario,this paper also proposes a key resource allocation algorithm based on a distributed sub-key relay tree.The algorithm leverages multiple data centers to distribute key resources at the same time,and realizes the distribution of distributed key resources.Simulation results show that compared with the scheme without multiple relays,the routing resource allocation algorithm based on the key relay tree improves the security probability of security multicast service by 15%.In the scenario of QDCN,compared with the single key relay tree scheme,the security probability of the proposed key resource allocation algorithm based on the distributed sub key relay tree is increased by 31.25%.