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

Asia Communications and Photonics Conference

Dynamic Time-Aware Path Optimization Scheme in TDM based Quantum Key Distribution Optical Networks

Xinyang Li, Xiaosong Yu, Yongli Zhao, Yajie Li, Jie Zhang

Published Jan 1, 2020• 0 citations
Publisher

Abstract

A dynamic time-aware path optimization algorithm is proposed to re-configure established services in TDM based quantum key distribution optical networks. Simulation shows it has good performance in terms of success rate of QKD services.
DOI
10.1364/acpc.2020.m4a.200

Related papers

Availability-Aware Dedicated Path Protection Schemes for Key Service in Quantum-Key-Distribution Optical Networks

Bin He, Yuxuan Lu, Hong Chen +5 more

Two availability-aware dedicated path protection schemes for key service were proposed to improve the availability in quantum-key-distribution (QKD) optical network. Simulation results show that the proposed schemes performs well in terms of success ratio, timeslot occupancy, and average unavailability of key services.

Asia Communications and Photonics Conference•Nov 4, 2023•3 citations

A Timeslot-Aware Shared Path Protection Scheme in QKD-based Optical Networks

Bin He, Weike Ma, Hong Chen +4 more

A timeslot-aware shared path protection scheme is proposed to improve the timeslot utilization in the quantum key distribution (QKD) optical network. Simulation results show that the proposed scheme performs well in terms of success probability, timeslot utilization of secret-key requests, and the number of secret-key consumption.

Asia Communications and Photonics Conference•Nov 5, 2022•1 citation

Service Priority Based Cross-Layer Routing and Resource Allocation in Quantum Key Distribution Enabled Optical Networks (QKD-ON)

Kaili Zhang, Xiaosong Yu, Yazi Wang +3 more

This paper proposes a service priority based cross-layer routing and resource allocation algorithm in QKD-ON. Results show it achieves good performance in terms of service success ratio and resource utilization.

International Conference on Optical Communications and Networks (ICOCN)•Aug 23, 2021•3 citations

Dynamic key management strategy based on Lagrangian relaxation multi-constraint optimization

Dongyue Wang, Lin Bi, Gopal Verma +1 more

Abstract With the rapid development of quantum communication technology, quantum key distribution (QKD) provides unconditional secure communication based on the principles of quantum mechanics. In the scenario of multi-service concurrency, it faces the challenges of dynamic resource allocation and complex network scheduling. The traditional key pool management mechanism has problems such as low key resource utilization and difficulty in coordinating multi-dimensional constraints in path optimization, which cannot meet the dynamically changing service quality requirements. This study proposes a quantum key pool architecture with dynamic resource management capabilities. The architecture adopts hierarchical key pool management and adds key recovery mechanism and key dynamic transfer function. For the path optimization problem under multiple constraints, the Lagrangian dual decomposition method is used to establish a mathematical model. The model considers multiple key factors such as bandwidth and delay, and designs an efficient heuristic algorithm to solve the optimal routing strategy. The simulation results show that the proposed algorithm has good performance in terms of service request success rate, key resource utilization, key remaining rate, etc. This study provides a new idea for key distribution and resource allocation in quantum networks, which will help promote the further development of quantum communication technology.

Physica Scripta•Aug 22, 2025•2 citations

Availability-Aware Key Service With Dedicated Path Protection in Quantum Key Distribution Optical Networks

Bowen Chen, Bing He, Nianying Zheng +5 more

Quantum key distribution (QKD)-based optical networks utilize quantum mechanics to secure communications by establishing secure, albeit expensive, quantum channels. A critical criterion for these QKD networks is to ensure network availability, which requires each service to adhere to a minimum unavailability constraint to maintain maximum network availability. This paper tackles the challenge of providing dedicated path protection for a select set of key services within QKD optical networks, adhering to specific unavailability constraints to ensure the gap between working and protection paths' unavailability remains within the allowable limit for each services. Considering the constraints of the limited timeslot resources and unavailability for the dedicated-path protection, we develop integer linear programming (ILP) models, to minimize the overall timeslot consumption in QKD optical networks. Additionally, we propose two novel algorithms for timeslot and availability management as minimum timeslot consumption (MTC) algorithm, and maximum availability (MA) algorithm to reduce the timeslot consumption. Simulations indicate that the ILP model based solution achieves the lowest timeslot consumption, however, it requires considerably more processing time compared to the proposed MTC and MA algorithms. Moreover, the MTC and MA algorithms outperform conventional dedicated-path protection (CDP) and fixed routing (FR) algorithms in reducing total timeslot consumption and improving average unavailability.

Journal of Lightwave Technology•Sep 5, 2025•2 citations

Multidimensional Resource Allocation Strategy Optimization of Quantum Key Distribution Network: Based on Improved A* Heuristic Algorithm

Xu Zhang, Li Liu, Wentao Dong +2 more

The convergence of quantum key distribution (QKD) and classical optical networks faces a serious challenge of dynamic resource allocation. In this paper, a three-dimensional resource optimization method based on the improved multipath A* algorithm is proposed, which solves the inefficiency problems brought by path redundancy of the traditional KSP algorithm and blind search of BFS/DFS by pre-computing node-level heuristic functions with dynamic link weight adjustment mechanism. A joint path-time slot-wavelength-key resource allocation model is constructed on NSFNET topology, and the experimental results show that the algorithm reduces the demand blocking rate, improves the success rate of high security transmission, and reduces the computational overhead. The results provide an efficient heuristic framework for the dynamic scheduling of quantum optical network resources, which significantly improves the reliability and security of quantum key relay service.

International Conference on Electronic Information Technology (EIT)•Aug 22, 2025•0 citations
Abstract With the rapid development of quantum communication technology, quantum key distribution (QKD) provides unconditional secure communication based on the principles of quantum mechanics. In the scenario of multi-service concurrency, it faces the challenges of dynamic resource allocation and complex network scheduling. The traditional key pool management mechanism has problems such as low key resource utilization and difficulty in coordinating multi-dimensional constraints in path optimization, which cannot meet the dynamically changing service quality requirements. This study proposes a quantum key pool architecture with dynamic resource management capabilities. The architecture adopts hierarchical key pool management and adds key recovery mechanism and key dynamic transfer function. For the path optimization problem under multiple constraints, the Lagrangian dual decomposition method is used to establish a mathematical model. The model considers multiple key factors such as bandwidth and delay, and designs an efficient heuristic algorithm to solve the optimal routing strategy. The simulation results show that the proposed algorithm has good performance in terms of service request success rate, key resource utilization, key remaining rate, etc. This study provides a new idea for key distribution and resource allocation in quantum networks, which will help promote the further development of quantum communication technology.
Quantum key distribution (QKD)-based optical networks utilize quantum mechanics to secure communications by establishing secure, albeit expensive, quantum channels. A critical criterion for these QKD networks is to ensure network availability, which requires each service to adhere to a minimum unavailability constraint to maintain maximum network availability. This paper tackles the challenge of providing dedicated path protection for a select set of key services within QKD optical networks, adhering to specific unavailability constraints to ensure the gap between working and protection paths' unavailability remains within the allowable limit for each services. Considering the constraints of the limited timeslot resources and unavailability for the dedicated-path protection, we develop integer linear programming (ILP) models, to minimize the overall timeslot consumption in QKD optical networks. Additionally, we propose two novel algorithms for timeslot and availability management as minimum timeslot consumption (MTC) algorithm, and maximum availability (MA) algorithm to reduce the timeslot consumption. Simulations indicate that the ILP model based solution achieves the lowest timeslot consumption, however, it requires considerably more processing time compared to the proposed MTC and MA algorithms. Moreover, the MTC and MA algorithms outperform conventional dedicated-path protection (CDP) and fixed routing (FR) algorithms in reducing total timeslot consumption and improving average unavailability.
The convergence of quantum key distribution (QKD) and classical optical networks faces a serious challenge of dynamic resource allocation. In this paper, a three-dimensional resource optimization method based on the improved multipath A* algorithm is proposed, which solves the inefficiency problems brought by path redundancy of the traditional KSP algorithm and blind search of BFS/DFS by pre-computing node-level heuristic functions with dynamic link weight adjustment mechanism. A joint path-time slot-wavelength-key resource allocation model is constructed on NSFNET topology, and the experimental results show that the algorithm reduces the demand blocking rate, improves the success rate of high security transmission, and reduces the computational overhead. The results provide an efficient heuristic framework for the dynamic scheduling of quantum optical network resources, which significantly improves the reliability and security of quantum key relay service.