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 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.
In this article, the network performance of equilibrium allocation of quantum key resources was investigated in quantum key distribution (QKD)-enabled optical data center networks. To effectively use quantum key resources, we propose three novel efficient load balancing routing, wavelength, and time-slot assignment (LB-RWTA) approaches, including LB-RWTA with flexible security level (LB-RWTA-FSL), LB-RWTA with specific security level (LB-RWTA-SSL), and LB-RWTA without security level (LB-RWTA-NSL). Particularly, the proposed LB-RWTA-FSL approach is uniquely featured by adaptive security level classification (ASLC) and load balancing (LB), aiming to demarcate the security level (SL) and reduce the overall network congestion. We introduce an existing routing, wavelength, and time-slot assignment (E-RWTA) approach without SL, called E-RWTA, for comparison. Simulation results show the effectiveness of our proposed approaches in terms of much higher quantum key resource efficiency and thus much higher network security performance than the state-of-the-art quantum key resource allocation approaches compared with the E-RWTA approach in QKD-enabled optical data center networks.
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.
Elastic Optical Network (EON) is a promising solution to address the high capacity, low latency, and flexibility requirements of the upcoming 5th-generation (5G) networks. Furthermore, Multi-Core Fibers (MCFs) and Space Division Multiplexing (SDM) technique can be utilized to overcome the capacity limitation of the conventional Single Mode Fibers (SMFs). On the other hand, Quantum Key Distribution (QKD) is an effective solution to address the security issues in 5G transport networks. In this paper, we investigate the performance of QKD over elastic optical networks with multi-core fibers and address the resource allocation problem for quantum and classical channels of QKD (QChs and CChs) and conventional data channels (DChs). To do so, we calculate the background noise caused by different noise sources and accordingly calculate the Secret Key Rate (SKR) in quantum channels. Then, we propose an Integer Linear Programming formulation and a heuristic algorithm to allocate network resources (spectrum, core, and links) to QChs, CChs, and DChs, with the objective of maximizing the secret key rate and minimizing the number of utilized frequency slots (FSs). Finally, we evaluate the proposed ILP and heuristic algorithm in terms of SKR and the number of utilized FSs. In our simulations, we consider core and metro topologies, fixed and distance adaptive launch power for classical signals, different fiber specifications, and different assumptions regarding the relative locations of quantum and classical channels in a multi-core fiber.
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.
Data transmission with optical fiber is vulnerable to eavesdropping. Moreover, conventional key distribution technology suffers from increasing computational power and upgraded attack algorithms. To address these issues, quantum key distribution (QKD), a quantum technology that secures secret information (such as a cryptographic key) exchange between two parties, can be used to guarantee secure data transmission. Integrating QKD into existing wavelength division multiplexing optical networks has been verified through a series of experiments, which contribute to ensuring network security and saving fiber resources. This paper addresses the resource assignment problem in QKD-enabled optical networks. First, a QKD-enabled optical network architecture is introduced. A small fraction of wavelength channels are segmented into multiple time slots with optical time division multiplexing technology to construct quantum key channels (QKChs) and measuring-basis channels, and then the remaining wavelengths can construct traditional data channels. Second, a static routing, wavelength, and time-slot assignment (RWTA) strategy is proposed and verified by the integer linear programming formulation and a heuristic algorithm. In the RWTA, QKChs are assigned for service requests according to the security levels specified by relevant key-updating periods. Thus, the secret keys for data encryption can update periodically to enhance security. Simulation results indicate that there is a trade-off between security (i.e., security levels and security-level types) and resource utilization.