Multi-Dimensional Routing, Wavelength, and Timeslot Allocation (RWTA) in Quantum Key Distribution Optical Networks (QKD-ON)

Abstract

Currently, with the continuous advancement of network and communication technology, the amount of data carried by the optical network is very huge. The security of high-speed and large-capacity information in optical networks has attracted more and more attention. Quantum key distribution (QKD) provides information-theoretic security based on the laws of quantum mechanics. Introducing QKD into an optical network can greatly improve the security of the optical network. In order to reduce the cost of deployment on QKD infrastructure, quantum signals in QKD and classical signals in optical networks are multiplexed in the same fiber by wavelength-division manner. Moreover, due to the limited wavelength resources in an optical fiber, time-division technology is adopted to construct different kinds of channels in QKD system for efficient utilization of wavelength resources. Under such situation, how to satisfy the security requirements of service requests and complete the efficient scheduling of multi-dimensional resources, i.e., wavelengths and timeslots, is a challenging problem. This paper addresses this problem by considering multi-dimensional routing, wavelength, and timeslot allocation (RWTA) in short-distance quantum key distribution optical networks (QKD-ON), in which any two nodes can directly establish a quantum channel, and the maximum distance between any two nodes is less than the distance that can carry out point-to-point quantum key distribution process. While accommodating services with security requirements in QKD optical networks, to avoid the wavelength time-slot fragmentation caused by the constraints of wavelength consistency and time-slot continuity, we propose a time-window-based security orchestration strategy as well as relative-loss of time continuous compactness based RWTA strategy. We conducted the simulations under various scenarios, e.g., different key updating periods and different distributions on wavelength resources, etc., and the results show that the proposed strategy can achieve better performance compared with the baselines in terms of key success rate, key-updating delay, and blocking probability.

An Optimal SDN-Based Wavelength Allocation and Routing Method for 5G Network

“…Second, different scheduling methods will have an impact on the operating effect of the system. Yu et al [12] developed a set of heuristic algorithms for all-optical networks that can solve the RWA issue in polynomial time while consuming less energy from network resources. Jaumard and Daryalal [13] studied the problem of optical path rearrangement in RWA and used the e-optimal method to evaluate the minimum number of optical path rearrangements required to maximize the service level.…”

“…In order to avoid the phenomenon of stagnation in multiple iterations and the inability to obtain the optimal solution, the E value shown in (12) can be added to (11) to jump out of this iteration and continue to accelerate the convergence.…”

Quantum Key Distribution Secured Optical Networks: A Survey

“…Fig. 21: An example of a hybrid trusted/untrusted relay QKD chain [165] Various strategies have been proposed in the literature to solve the RWTA problem [173], [174], [175], [176], [177]. Initially, the RWTA problem was investigated in [12], and an RWTA strategy for resource allocation in a static traffic scenario was proposed.…”

APR-QKDN: A Quantum Key Distribution Network Routing Scheme Based on Application Priority Ranking

“…Currently, most of the research results on the routing problem of trusted relay-based QKD networks have improved according to the characteristics of QKD networks by drawing on the proven classical network routing scheme. Yu et al [ 18 ] transformed link resources in QKD networks into time-slice resources based on time-division multiplexing techniques, and the scheme developed a method to measure link time-slice continuity to reduce the secret key request conflicts caused by link resource fragmentation. However, the scheme does not start from a practical application scenario and ignores the difference in demand between applications and the particular case of high concurrency, which can lead the resource allocation to apply solely to the ideal case.…”