Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Network and Service Management

An Efficient and Robust Resource Allocation Method for Quantum Key Distribution Networks

Peng Zheng, Jian Li, Zhonghui Li, Kaiping Xue, Nenghai Yu, Ruidong Li, Qibin Sun, Jun Lu

Published Jun 6, 2025• 6 citations
Publisher

Abstract

Quantum Key Distribution (QKD) technology leverages its inherent security advantages to ensure information-theoretic security for data transmission in networks. However, existing QKD networks still face critical challenges, including network congestion that stems from limited key resources and uneven resource allocation methods. Thus, in this paper, we focus on the issue of network congestion caused by bottleneck links and aim to achieve load balancing. Considering the limited key resources, we first introduce the key resource utilization ratio as an indicator of bottleneck links and formulate the resource allocation problem as an Integer Linear Programming (ILP) problem. To deal with the complexity of the ILP problem, especially in large-scale network scenarios, we design a heuristic algorithm that can obtain near-optimal solutions within polynomial time. Finally, we implement the proposed key resource allocation scheme in various real-world network topologies using a full-stack quantum network simulator. Compared to the existing algorithms, extensive results show that our method can reduce key resource consumption by up to 50% on bottleneck links and improve the robustness of QKD networks when facing burst quantum key agreement requests.

DOI
10.1109/tnsm.2025.3577285

Related papers

A new quantum key distribution resource allocation and routing optimization scheme

Lin Bi, Xiaotong 晓同 Yuan 袁, Weijie 炜杰 Wu 吴 +1 more

Quantum key distribution (QKD) is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols. However, due to the stringent requirements of the quantum key generation environment, the generated quantum keys are considered valuable, and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks. In this paper, for the QKD network with a trusted relay, which is mainly based on point-to-point quantum keys and has complex changes in network resources, we aim to allocate resources reasonably for data packet distribution. Firstly, we formulate a linear programming constraint model for the key resource allocation (KRA) problem based on the time-slot scheduling. Secondly, we propose a new scheduling scheme based on the graded key security requirements (GKSR) and a new micro-log key storage algorithm for effective storage and management of key resources. Finally, we propose a key resource consumption (KRC) routing optimization algorithm to properly allocate time slots, routes, and key resources. Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate, among others.

Chinese Physics B•Feb 2, 2024•7 citations

A Load Balancing Routing Algorithm for Quantum Key Distribution Networks

Xinghai Guo, Yuchen Zhou, Sijiang Xie +1 more

With the development of quantum computing and computer science, the risk of traditional cryptographic algorithms being cracked is increasing. Therefore, quantum key distribution (QKD) technology based on quantum physical properties has been developed to ensure the security of information communication. Large-scale QKD networks can be built using trusted relay technology, but the hops encryption and decryption process of trusted relay will consume extra keys, which makes it particularly important to choose a reasonable path to reduce the consumption of extra keys during key distribution. The existing routing algorithms mainly focus on the number of remaining keys and hops, but ignore the congestion information of the network, resulting in a high key exchange failure rate and an increase in key consumption. In view of this background, we propose a load balancing routing (LBR) algorithm, which can realize congestion control in QKD network by dynamically detecting link state with SDN controller. Simulation results show that LBR improves key request success rate by more than 10% and key utilization efficiency by about 5% compared with existing methods.

International Conference on Intelligent Systems, Communications and Computer Networks (ISCCN)•Feb 21, 2025•3 citations

Resource Allocation in Quantum-Key-Distribution Optical Data Center Networks

Bowen Chen, Weike Ma, Bin He +7 more

The paper investigates quantum key resource allocation in quantum-key-distribution optical data center networks (QKD-ODCNs). A novel framework of priority queue with multiple security levels is first proposed to achieve a multi-class networking environment with adaptive security level classification. Accordingly, a novel integer linear programming (ILP) model is developed for the quantum key resource allocation (QKRA) process. To overcome the high computation complexity in solving the ILP, two heuristic approaches are developed, namely QKRA with adaptive strong security level (QKRA-ASSL) and QKRA with adaptive weak security level (QKRA-AWSL), respectively, aiming to achieve as close performance to that by the ILP model as possible in terms of success rate of connection request and network security level. The simulation results verify that the proposed QKRA-ASSL and QKRA-AWSL approaches not only maximize the network security score, but also improve the timeslot resource utilization without compromising the establishment success rate of connection request.

Journal of Lightwave Technology•Feb 21, 2025•12 citations

Dynamic Security-Aware Resource Allocation in Quantum Key Distribution-Enabled Optical Networks

Vimal Bhatia, Adolph Timothy Kasegenya, Bowen Chen

The demand for secure communication in the age of quantum technologies has driven progress in quantum key distribution (QKD) techniques for optical networks. This research addresses the issues of high blocking probabilities (BPs) and the proper utilization of quantum resources in varying network loads by introducing a novel heuristic approach, termed dynamic security-aware quantum resource allocation (D-SQRA), designed for dynamic resource allocation in QKD-enabled optical networks. We propose two D-SQRA algorithms to employ an adaptive resource assignment (RA) strategy that concurrently addresses routing, wavelength, and time-slot selection while dynamically modifying security levels according to the real-time network load and resource availability. We evaluate the proposed D-SQRA performance against two conventional methods, namely, fixed security quantum resource allocation (F-SQRA) and baseline quantum resource allocation (B-QRA). We discuss the results for NSFNET and UBN24 topologies for network security performance metrics such as network security performance (NSP), BP, quantum key utilization (QKU), and time-slot utilization. The results show that the proposed D-SQRA algorithms provide significant improvement with respect to conventional techniques in addressing proper resource utilization and management by reducing BPs of the new incoming connection requests.

Photonics•Jun 25, 2025•6 citations

Resource Allocation in Quantum-Key-Distribution- Secured Datacenter Networks With Cloud–Edge Collaboration

Qingcheng Zhu, Xiaosong Yu, Yongli Zhao +2 more

Datacenter networks (DCNs) with cloud–edge collaboration are emerging to satisfy the communication, computation, and caching (3C) requirements of future services such as cloud-based IoT services. However, the enroute data over DCNs with cloud–edge collaboration is likely to suffer from cyberattacks such as eavesdropping. A large number of services require not only 3C resources, but also cryptographic resources for encryption to ensure high security. Quantum key distribution (QKD) is a practical approach to provide secret keys for remote users with information-theoretic security against attacks from quantum computing. A QKD-secured DCN (QKD-DCN) with cloud–edge collaboration can be deployed to satisfy the communication, computation, caching, and cryptographic (4C) requirements of services. This article innovatively solves the new 4C resource-allocation (4CRA) problem in the network to minimize the cryptographic resource consumption. It formulates an integer linear programming (ILP) model and proposes a heuristic cryptographic-dependent 4CRA algorithm to find optimal solutions. The proposed algorithm is compared with two baseline 4CRA algorithms which, respectively, consider the minimized service delivery latency and the first-fit resource availability. Analytical simulations show that the proposed algorithm minimizes the key-resource-consumption ratio and the average key-resource consumption under static and dynamic traffic scenarios in different network topologies.

IEEE Internet of Things Journal•Feb 7, 2023•38 citations

Research on QKD network routing algorithm based on key consumption

Xiaotong Yuan, Weijie Wu

With quantum computing advancing, traditional encryption risks cracking, making quantum key distribution (QKD) crucial for its quantum-physics-based unconditional security. Large-scale QKD networks face high key consumption, uneven allocation, and reduced long-distance generation rates. This paper proposes MTSA, a time slot allocation-based multi-path routing scheme using linear programming and SDN for load balancing, with a two-level cache queue and optimized polling algorithm. Simulations on NSFNET/USNET show MTSA boosts key utilization by 15.565% and distribution success rate by 12.534%, optimizing QKD network performance.

International Workshop on Automation, Control, and Communication Engineering (IWACCE)•Nov 14, 2025•0 citations
Quantum Key Distribution (QKD) technology leverages its inherent security advantages to ensure information-theoretic security for data transmission in networks. However, existing QKD networks still face critical challenges, including network congestion that stems from limited key resources and uneven resource allocation methods. Thus, in this paper, we focus on the issue of network congestion caused by bottleneck links and aim to achieve load balancing. Considering the limited key resources, we first introduce the key resource utilization ratio as an indicator of bottleneck links and formulate the resource allocation problem as an Integer Linear Programming (ILP) problem. To deal with the complexity of the ILP problem, especially in large-scale network scenarios, we design a heuristic algorithm that can obtain near-optimal solutions within polynomial time. Finally, we implement the proposed key resource allocation scheme in various real-world network topologies using a full-stack quantum network simulator. Compared to the existing algorithms, extensive results show that our method can reduce key resource consumption by up to 50% on bottleneck links and improve the robustness of QKD networks when facing burst quantum key agreement requests.
Quantum key distribution (QKD) is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols. However, due to the stringent requirements of the quantum key generation environment, the generated quantum keys are considered valuable, and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks. In this paper, for the QKD network with a trusted relay, which is mainly based on point-to-point quantum keys and has complex changes in network resources, we aim to allocate resources reasonably for data packet distribution. Firstly, we formulate a linear programming constraint model for the key resource allocation (KRA) problem based on the time-slot scheduling. Secondly, we propose a new scheduling scheme based on the graded key security requirements (GKSR) and a new micro-log key storage algorithm for effective storage and management of key resources. Finally, we propose a key resource consumption (KRC) routing optimization algorithm to properly allocate time slots, routes, and key resources. Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate, among others.
With the development of quantum computing and computer science, the risk of traditional cryptographic algorithms being cracked is increasing. Therefore, quantum key distribution (QKD) technology based on quantum physical properties has been developed to ensure the security of information communication. Large-scale QKD networks can be built using trusted relay technology, but the hops encryption and decryption process of trusted relay will consume extra keys, which makes it particularly important to choose a reasonable path to reduce the consumption of extra keys during key distribution. The existing routing algorithms mainly focus on the number of remaining keys and hops, but ignore the congestion information of the network, resulting in a high key exchange failure rate and an increase in key consumption. In view of this background, we propose a load balancing routing (LBR) algorithm, which can realize congestion control in QKD network by dynamically detecting link state with SDN controller. Simulation results show that LBR improves key request success rate by more than 10% and key utilization efficiency by about 5% compared with existing methods.
The paper investigates quantum key resource allocation in quantum-key-distribution optical data center networks (QKD-ODCNs). A novel framework of priority queue with multiple security levels is first proposed to achieve a multi-class networking environment with adaptive security level classification. Accordingly, a novel integer linear programming (ILP) model is developed for the quantum key resource allocation (QKRA) process. To overcome the high computation complexity in solving the ILP, two heuristic approaches are developed, namely QKRA with adaptive strong security level (QKRA-ASSL) and QKRA with adaptive weak security level (QKRA-AWSL), respectively, aiming to achieve as close performance to that by the ILP model as possible in terms of success rate of connection request and network security level. The simulation results verify that the proposed QKRA-ASSL and QKRA-AWSL approaches not only maximize the network security score, but also improve the timeslot resource utilization without compromising the establishment success rate of connection request.
The demand for secure communication in the age of quantum technologies has driven progress in quantum key distribution (QKD) techniques for optical networks. This research addresses the issues of high blocking probabilities (BPs) and the proper utilization of quantum resources in varying network loads by introducing a novel heuristic approach, termed dynamic security-aware quantum resource allocation (D-SQRA), designed for dynamic resource allocation in QKD-enabled optical networks. We propose two D-SQRA algorithms to employ an adaptive resource assignment (RA) strategy that concurrently addresses routing, wavelength, and time-slot selection while dynamically modifying security levels according to the real-time network load and resource availability. We evaluate the proposed D-SQRA performance against two conventional methods, namely, fixed security quantum resource allocation (F-SQRA) and baseline quantum resource allocation (B-QRA). We discuss the results for NSFNET and UBN24 topologies for network security performance metrics such as network security performance (NSP), BP, quantum key utilization (QKU), and time-slot utilization. The results show that the proposed D-SQRA algorithms provide significant improvement with respect to conventional techniques in addressing proper resource utilization and management by reducing BPs of the new incoming connection requests.
Datacenter networks (DCNs) with cloud–edge collaboration are emerging to satisfy the communication, computation, and caching (3C) requirements of future services such as cloud-based IoT services. However, the enroute data over DCNs with cloud–edge collaboration is likely to suffer from cyberattacks such as eavesdropping. A large number of services require not only 3C resources, but also cryptographic resources for encryption to ensure high security. Quantum key distribution (QKD) is a practical approach to provide secret keys for remote users with information-theoretic security against attacks from quantum computing. A QKD-secured DCN (QKD-DCN) with cloud–edge collaboration can be deployed to satisfy the communication, computation, caching, and cryptographic (4C) requirements of services. This article innovatively solves the new 4C resource-allocation (4CRA) problem in the network to minimize the cryptographic resource consumption. It formulates an integer linear programming (ILP) model and proposes a heuristic cryptographic-dependent 4CRA algorithm to find optimal solutions. The proposed algorithm is compared with two baseline 4CRA algorithms which, respectively, consider the minimized service delivery latency and the first-fit resource availability. Analytical simulations show that the proposed algorithm minimizes the key-resource-consumption ratio and the average key-resource consumption under static and dynamic traffic scenarios in different network topologies.
With quantum computing advancing, traditional encryption risks cracking, making quantum key distribution (QKD) crucial for its quantum-physics-based unconditional security. Large-scale QKD networks face high key consumption, uneven allocation, and reduced long-distance generation rates. This paper proposes MTSA, a time slot allocation-based multi-path routing scheme using linear programming and SDN for load balancing, with a two-level cache queue and optimized polling algorithm. Simulations on NSFNET/USNET show MTSA boosts key utilization by 15.565% and distribution success rate by 12.534%, optimizing QKD network performance.