Optical Fiber Communication Conference

Reinforcement Learning Based Multi-Tenant Secret-Key Assignment for Quantum Key Distribution Networks

Yuan Cao, Yongli Zhao, Jun Li, Rui Lin, Jie Zhang, Jiajia Chen

Published Jan 1, 2019• 9 citations

Abstract

We propose a reinforcement learning based online multi-tenant secret-key assignment algorithm for quantum key distribution networks, capable of reducing tenant-request blocking probability more than half compared to the benchmark heuristics.

DOI: 10.1364/ofc.2019.m2a.7

Related papers

Multi-Tenant Provisioning for Quantum Key Distribution Networks With Heuristics and Reinforcement Learning: A Comparative Study

Yuan Cao, Yongli Zhao, Jun Li +3 more

Quantum key distribution (QKD) networks are potential to be widely deployed in the immediate future to provide long-term security for data communications. Given the high price and complexity, multi-tenancy has become a cost-effective pattern for QKD network operations. In this work, we concentrate on addressing the online multi-tenant provisioning (On-MTP) problem for QKD networks, where multiple tenant requests (TRs) arrive dynamically. On-MTP involves scheduling multiple TRs and assigning non-reusable secret keys derived from a QKD network to multiple TRs, where each TR can be regarded as a high-security-demand organization with the dedicated secret-key demand. The quantum key pools (QKPs) are constructed over QKD network infrastructure to improve management efficiency for secret keys. We model the secret-key resources for QKPs and the secret-key demands of TRs using distinct images. To realize efficient On-MTP, we perform a comparative study of heuristics and reinforcement learning (RL) based On-MTP solutions, where three heuristics (i.e., random, fit, and best-fit based On-MTP algorithms) are presented and a RL framework is introduced to realize automatic training of an On-MTP algorithm. The comparative results indicate that with sufficient training iterations the RL-based On-MTP algorithm significantly outperforms the presented heuristics in terms of tenant-request blocking probability and secret-key resource utilization.

IEEE Transactions on Network and Service ManagementJan 7, 202053 citations

Multi-tenant secret-key assignment over quantum key distribution networks

Yuan Cao, Yongli Zhao, Rui Lin +3 more

Quantum key distribution (QKD) networks are promising to progress towards widespread practical deployment over existing fiber infrastructures in the near future. Given the high cost and difficulty of deploying QKD networks, multi-tenancy becomes promising to improve cost efficiency for future QKD networks. In a multi-tenant QKD network, multiple QKD tenants can share the same QKD network infrastructure to obtain secret keys for securing their data transfer. Since the secret-key resources are finite and precious in QKD networks, how to achieve efficient multi-tenant secret-key assignment (MTKA) to satisfy the secret-key demands of multiple QKD tenants over QKD networks becomes a significant problem. In this regard, this study addresses the MTKA problem over QKD networks. A new multi-tenant QKD network architecture is proposed based on software defined networking (SDN) and quantum key pool (QKP) techniques. A secret-key rate sharing scheme is presented and a heuristic algorithm is designed to implement efficient MTKA over QKD networks. A new performance metric, namely matching degree (MD) that reflects the balance between QKD network secret-key resources and QKD tenant requests, is defined and evaluated. Simulation studies indicate that high QKD tenant requests accommodation and efficient secret-key resource usage can be achieved via maximizing the value of MD.

Optics ExpressJan 28, 201937 citations

Deep Reinforcement Learning-based Quality-of-Service Assurance for Digital Twin-enabled Satellite Quantum Key Distribution Networks

Jingjing Liu, Xiaosong Yu, Jian Yang +4 more

Quality-of-service assurance over digital twin-enabled satellite quantum key distribution networks with deep reinforcement learning is proposed. This approach can reduce the service blocking rate by more than 70% compared to the benchmarks.

Optical Fiber Communication ConferenceJan 1, 20260 citations

Routing Based on Deep Reinforcement Learning in Quantum Key Distribution-secured Optical Networks

Purva Sharma, Vimal Bhatia, Shashi Prakash

Routing is a challenging problem in quantum key distribution (QKD)-secured optical networks (QKD-ONs) and involves the selection of an appropriate route that establishes a secure path between the QKD nodes for secret key distribution. Deep reinforcement learning (DRL) is a promising approach for solving decision-making problems in complex networking environments such as QKD-ONs. By leveraging the capabilities of DRL algorithms, the routing decisions can be optimized to enhance network performance. This paper proposes a DRL-based solution for routing in QKD-ONs that enables the routing agent to learn and adapt to changing network conditions by understanding the networking environment. The performance of the proposed scheme is compared with the baseline schemes on NSFNET in terms of blocking probability. Simulation results indicate that compared to the baseline schemes (shortest path (SP) and hop count (HC)), the proposed DRL-based routing scheme reduces the blocking by 14.31% and 8%, respectively.

IEEE International Conference on Advanced Networks and Telecommunications SystemsDec 17, 20234 citations

Quantum attack-resistant resource allocation using reinforcement learning in CV-QKD over optical networks

Shifeng Ding, Yuansen Cheng, Calvin Chun-Kit Chan

We propose a quantum attack-resistant resource allocation using reinforcement learning in CV-QKD over optical networks. Simulation results show that it can effectively mitigate quantum attacks and reduce the request blocking probability.

Opto-Electronics and Communications Conference (OECC)Jun 30, 20241 citation

Deep reinforcement learning-based multi-objective routing and resource allocation strategy in quantum key distribution optical networks

Li Liu, Zhenjiang Feng, Wenbin Ke +1 more

Abstract Quantum key distribution (QKD) optical networks, relying on the information-theoretic security guaranteed by the fundamental laws of quantum physics, have become a core solution for ensuring data transmission security in critical fields such as finance and energy. However, QKD optical networks have inherent characteristics like severe resource constraints, dynamic changes in network environments. The collaborative optimization of routing, wavelength, and time-slot assignment (RWTA) has thus become a key bottleneck restricting their practical deployment. Traditional algorithms suffer from high complexity and poor adaptability in large-scale dynamic networks, while existing deep reinforcement learning (DRL) schemes insufficiently consider network security states, failing multi-objective co-optimization. Therefore, this paper proposes a multi-objective secure proximal policy optimization algorithm (MOS-PPO) based on DRL to solve the routing, wavelength, and time slots assignment problem in QKD optical networks. The MOS-PPO algorithm expands the state space by introducing a network security state vector that includes quantum bit error rate, risk coefficient, node capacity, and processing capability. It designs a multi-objective reward function, and establishes a security constraint mechanism to achieve the collaborative optimization of blocking probability (BP), resource utilization (RU), and security performance. Simulations on NSFNET and UBN24 topologies show MOS-PPO outperforms DRL-PPO algorithm, Security-aware Load balancing, first fit algorithm, and random fit algorithm. On NSFNET, average BP drops by 20.4%, 22.1%,28.4%, 36.7% and RU rises by 4.0%,3.9%, 22.2%, 31.0%, on UBN24, BP decreases by 9.3%, 11.4%, 18.8%, and 27.4% and RU increases by 3.8%, 21.2%, 10.3%, and 29.5%, with higher stable security margins. This study verifies the high adaptability and multi-objective optimization ability of the MOS-PPO algorithm in dynamic network environments, providing an efficient RWTA solution for the practical deployment of QKD optical networks.

Physica ScriptaJul 10, 20260 citations