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

International Conference on Optical Communications and Networks (ICOCN)

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

Kaili Zhang, Xiaosong Yu, Yazi Wang, Yajie Li, Yongli Zhao, Jie Zhang

Published Aug 23, 2021• 3 citations
Publisher

Abstract

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.
DOI
10.1109/icocn53177.2021.9563868

Related papers

Joint Multi-Layer Routing and Resource Allocation in QKD-Embedded IP over Optical Networks

Kaili Zhang, Xiaosong Yu, Yongli Zhao

In this paper, we proposed a joint multi-layer routing and resource allocation algorithm in QKD-Embedded IP over optical networks to satisfy the security requirements of services. The performance of the proposed algorithm is evaluated by simulation.

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

Routing and Wavelength Allocation in Spatial Division Multiplexing Based Quantum Key Distribution Optical Networks

Shufeng Li, Xiaosong Yu, Yongli Zhao +3 more

We propose a routing and wavelength allocation method in spatial division multiplexing (SDM) based on quantum key distribution (QKD) optical networks. Especially, for the routing and wavelength allocation of quantum services, we design an auxilia/y matrix-based core allocation and a routing method based on inter-core crosstalk (IC-XT) evaluation. For classic services in SDM optical networks, we design a resource allocation method. Through the proposed hybrid resource allocation strategy, the IC-XT of quantum services can be reducedt Moreover, the amount of available secret keys stored by the node has also increased in SDM optical networks.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 1, 2020•10 citations

Priority Order-Based Key Distribution in QKD-Secured Optical Networks

Purva Sharma, Vimal Bhatia, Shashi Prakash

In quantum key distribution (QKD)-secured optical networks, blocking increases with the number of QKD lightpath requests as well as with the number of times modification required to improve the security level of QKD lightpath requests. The blocking is severe problem in such networks because of the limited number of resources (wavelengths and time-slots) in each fiber link. In this paper, we propose a priority order-based routing wavelength and time-slot allocation (POB-RWTA) scheme to reduce the blocking of QKD lightpath requests. In the proposed POB-RWTA scheme, the QKD lightpath requests are served according to their priority order. The priority order of each QKD lightpath request is based on the security level. The blocking of high priority lightpath requests (HPLRs) and total incoming QKD lightpath requests due to limited resources can be reduced using the above criterion of priority order. The performance analysis of the proposed POB-RWTA scheme is made in terms of the success probability of QKD lightpath requests considering different wavelengths for QSCh and the probability of secret key update failure. We compared the proposed POB-RWTA scheme with a non-priority order-based routing wavelength and time-slot allocation (NPOB-RWTA) scheme. Simulations performed on NSFNET topology show that by using the POB-RWTA scheme, the success probability of HPLRs and total incoming QKD lightpath requests are significantly improved as compared to NPOB-RWTA.

IEEE International Conference on Advanced Networks and Telecommunications Systems•Dec 14, 2020•9 citations

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

Protection Schemes for Key Service in Optical Networks Secured by Quantum Key Distribution (QKD)

Hua Wang, Yongli Zhao, Xiaosong Yu +5 more

Quantum key distribution (QKD) is considered a secure solution for key distribution and applied in optical networks to overcome security issues by providing key services in different lightpaths. In optical networks, lightpaths in fibers can be used for the delivery of QKD due to their good transmission performance. Accordingly, optical networks secured by QKD have been regarded as an important paradigm, and survivability in this paradigm is an issue worthy of study. In this paper, we focus on the protection schemes for key services in optical networks secured by QKD. Specifically, in consistency with two characteristics of key services (i.e., the key-updating process and key-volume adaptive routing), two key-volume adaptive protection schemes (i.e., dedicated protection and shared protection) are proposed for the networks against link failures. In such scenarios, the designed key-protection threshold can alleviate the tight network resources caused by the key-updating process. Simulation work has been conducted to evaluate the performance of the proposed schemes in terms of blocking probability, resource utilization, and proportion of secret-key consumption with different key-protection thresholds and update periods. Numerical results show that the two proposed schemes are effective in providing protection. Furthermore, evaluating the impact of protection on network security verifies a trade-off that exists between how much protection can be provided for key services versus the overall security of the network, given a certain resource budget.

Journal of Optical Communications and Networking•Feb 6, 2019•46 citations

Quantum key pool construction and key distribution scheme in multi-domain QKD optical networks (QKD-ON)

Qingping Wang, Xiaosong Yu, Qingcheng Zhu +2 more

In this paper, we propose a multi-domain quantum key pool (QKP) capacity adaptive supplement scheme based on balance between key resource and routing hop in multi-domain QKD-ON, and we conduct the simulation and evaluate the performance of the proposed scheme in terms of service blocking probability and utilization of key resource. Results show that the algorithm can reduce service blocking probability.

Optics Young Scientist Summit (OYSS)•Feb 28, 2021•15 citations
We propose a routing and wavelength allocation method in spatial division multiplexing (SDM) based on quantum key distribution (QKD) optical networks. Especially, for the routing and wavelength allocation of quantum services, we design an auxilia/y matrix-based core allocation and a routing method based on inter-core crosstalk (IC-XT) evaluation. For classic services in SDM optical networks, we design a resource allocation method. Through the proposed hybrid resource allocation strategy, the IC-XT of quantum services can be reducedt Moreover, the amount of available secret keys stored by the node has also increased in SDM optical networks.
In quantum key distribution (QKD)-secured optical networks, blocking increases with the number of QKD lightpath requests as well as with the number of times modification required to improve the security level of QKD lightpath requests. The blocking is severe problem in such networks because of the limited number of resources (wavelengths and time-slots) in each fiber link. In this paper, we propose a priority order-based routing wavelength and time-slot allocation (POB-RWTA) scheme to reduce the blocking of QKD lightpath requests. In the proposed POB-RWTA scheme, the QKD lightpath requests are served according to their priority order. The priority order of each QKD lightpath request is based on the security level. The blocking of high priority lightpath requests (HPLRs) and total incoming QKD lightpath requests due to limited resources can be reduced using the above criterion of priority order. The performance analysis of the proposed POB-RWTA scheme is made in terms of the success probability of QKD lightpath requests considering different wavelengths for QSCh and the probability of secret key update failure. We compared the proposed POB-RWTA scheme with a non-priority order-based routing wavelength and time-slot allocation (NPOB-RWTA) scheme. Simulations performed on NSFNET topology show that by using the POB-RWTA scheme, the success probability of HPLRs and total incoming QKD lightpath requests are significantly improved as compared to NPOB-RWTA.
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.
Quantum key distribution (QKD) is considered a secure solution for key distribution and applied in optical networks to overcome security issues by providing key services in different lightpaths. In optical networks, lightpaths in fibers can be used for the delivery of QKD due to their good transmission performance. Accordingly, optical networks secured by QKD have been regarded as an important paradigm, and survivability in this paradigm is an issue worthy of study. In this paper, we focus on the protection schemes for key services in optical networks secured by QKD. Specifically, in consistency with two characteristics of key services (i.e., the key-updating process and key-volume adaptive routing), two key-volume adaptive protection schemes (i.e., dedicated protection and shared protection) are proposed for the networks against link failures. In such scenarios, the designed key-protection threshold can alleviate the tight network resources caused by the key-updating process. Simulation work has been conducted to evaluate the performance of the proposed schemes in terms of blocking probability, resource utilization, and proportion of secret-key consumption with different key-protection thresholds and update periods. Numerical results show that the two proposed schemes are effective in providing protection. Furthermore, evaluating the impact of protection on network security verifies a trade-off that exists between how much protection can be provided for key services versus the overall security of the network, given a certain resource budget.