Designing optimal Quantum Key Distribution Networks based on Time-Division Multiplexing of QKD transceivers: qTDM-QKDN REVISAR
Juan Carlos Hernandez-Hernandez, David Larrabeiti López, María Carmen Calderón Pastor, Ignacio Soto Campos, Bruno Cimoli, Hui Liu, Idelfonso Tafur Monroy
Time-sharing of Quantum Key Distribution (QKD) transceivers with the help of optical switches and a central Software-Defined Networking (SDN) controller is a promising technique to better amortize the large investments required to build a Quantum Key Distribution Network (QKDN). In this work, we investigate the implications of introducing Time-Division Multiplexing (TDM) in trusted-relay QKDNs at the wide-area network scale in terms of performance and cost-saving. To this end, we developed both a Mixed Integer Linear Programming (qTDM-MILP) model and a Heuristic Algorithm (qTDM-HA) to solve the allocation of QKD transceivers and network resources for a novel switched QKDN operating scheme: qTDM-QKDN. Our heuristic method provides a close-to-optimal resource planning for the offline problem that computes the minimum number of QKD transceivers and optical switch ports at each node, as well as the number of quantum channels on each link required to satisfy a target set of end-to-end secret-keyrate demands. Moreover, both the model and the heuristic provide the time fractions that each QKD transceiver needs to peer with each neighbor QKD transceiver. We compared our proposed model and heuristic algorithm for cost minimization with non-time sharing QKD transceivers (nTDM) as baseline. The results show that qTDM can achieve substantial cost-savings in the range of 10%-40% compared to nTDM. Furthermore, this work sheds light on the selection of the value for the working cycle T and its influence on network performance.
Time-sharing of Quantum Key Distribution (QKD) transceivers with the help of optical switches and a central Software-Defined Networking (SDN) controller is a promising technique to better amortize the large investments required to build a Quantum Key Distribution Network (QKDN). In this work, we investigate the implications of introducing Time-Division Multiplexing (TDM) in trusted-relay QKDNs at the wide-area network scale in terms of performance and cost-saving. To this end, we developed both a Mixed Integer Linear Programming (qTDM-MILP) model and a Heuristic Algorithm (qTDM-HA) to solve the allocation of QKD transceivers and network resources for a novel switched QKDN operating scheme: qTDM-QKDN. Our heuristic method provides a close-to-optimal resource planning for the offline problem that computes the minimum number of QKD transceivers and optical switch ports at each node, as well as the number of quantum channels on each link required to satisfy a target set of end-to-end secret-keyrate demands. Moreover, both the model and the heuristic provide the time fractions that each QKD transceiver needs to peer with each neighbor QKD transceiver. We compared our proposed model and heuristic algorithm for cost minimization with non-time sharing QKD transceivers (nTDM) as baseline. The results show that qTDM can achieve substantial cost-savings in the range of 10%-40% compared to nTDM. Furthermore, this work sheds light on the selection of the value for the working cycle T and its influence on network performance.
Time-sharing of Quantum Key Distribution (QKD) transceivers with the help of optical switches and a central Software-Defined Networking (SDN) controller is a promising technique to better amortize the large investments required to build a Quantum Key Distribution Network (QKDN). In this work, we investigate the implications of introducing Time-Division Multiplexing (TDM) in trusted-relay QKDNs at the wide-area network scale in terms of performance and cost-saving. To this end, we developed both a Mixed Integer Linear Programming (qTDM-MILP) model and a Heuristic Algorithm (qTDM-HA) to solve the allocation of QKD transceivers and network resources for a novel switched QKDN operating scheme: qTDM-QKDN. Our heuristic method provides a close-to-optimal resource planning for the offline problem that computes the minimum number of QKD transceivers and optical switch ports at each node, as well as the number of quantum channels on each link required to satisfy a target set of end-to-end secret-keyrate demands. Moreover, both the model and the heuristic provide the time fractions that each QKD transceiver needs to peer with each neighbor QKD transceiver. We compared our proposed model and heuristic algorithm for cost minimization with non-time sharing QKD transceivers (nTDM) as baseline. The results show that qTDM can achieve substantial cost-savings in the range of 10%–40% compared to nTDM. Furthermore, this work sheds light on the selection of the value for the working cycle T and its influence on network performance. • TDM optimizes QKD networks, enhancing efficiency and cost-effectiveness. • A MILP model and the qTDM-HA ease resource allocation in large-scale QKD networks. • The tools provide outstanding solutions from 10% to 40% in terms of cost-savings. • TDM minimizes the number of dedicated QKD transceivers by using shared ones wisely.
Quantum key distribution (QKD) combined with quantum-safe encryption algorithms offers a practical path to future-proof communication security. Currently, the BB84 QKD protocol is mature and can be deployed over legacy optical fiber infrastructure using commercial products, with trusted key relaying as a workaround for its distance limitations. However, designing cost-effective QKD networks is essential for widespread adoption by end users and telecom operators (Telcos). To address this challenge, we propose and study a novel, to our knowledge, strategy: periodic time sharing of QKD transceivers. This strategy, especially cost saving at low and medium workloads, allows for generating keys for pairs of nodes at deterministic rates decided a priori. This work presents an offline solution for allocating and scheduling QKD transceivers that are shared by the aforementioned time-division multiplexing (TDM) scheme in a QKD network. We propose a mixed-integer linear programming (MILP)-based scheduling (MBS) method to solve this problem, which is computationally expensive, even for small network topologies. As an alternative, we introduce allocation-driven scheduling (ADS), an algorithm that internally breaks the problem into two steps: allocate first and schedule later. The scheduling can be handled by either a relaxed-MBS (rMBS) or a round-robin scheduling (RRS) approach (ADS-rMBS and ADS-RRS, respectively). Both methods yield results comparable to MBS for small networks. Furthermore, simulations illustrate that both ADS-rMBS and ADS-RRS enable a pay-as-you-grow model, reducing the initial capital expenditure in low-load scenarios. Compared with the non-TDM baseline (i.e., QKD transceivers are non-shared), the cost savings range from 30% to 50%, making QKD deployment more economically viable. Moreover, ADS-rMBS generally outperforms ADS-RRS, but requires a higher runtime, reaching up to 2500 s in large networks. Conversely, ADS-RRS maintains a stable 1 ms runtime across all conditions, making both approaches viable depending on the traffic matrix update interval.
The maturity and developments of quantum key distribution (QKD) enable its application for encrypting dense wavelength-division multiplexing networks (DWDMNs), ensuring security in the presence of scalable quantum computers. The potential infrastructure reuse and costly deployment of a QKD network (QKDN) require jointly optimized deployment and utilization. We develop and solve a multi-layer problem formulation that fulfills the required keys of the DWDMN demands with the cost-minimized QKDN and maximized reuse of the present infrastructure. Our approach proves the feasibility of currently available QKD devices to encrypt nation-wide DWDMN with multi-period network planning. Furthermore, we compare static and dynamic routing approaches to quantify the advantage of software-defined networking for key management networks (KMNs). Depending on the network load, our multi-layer optimization shows potential savings between 9% and 45% of QKD devices compared to the baseline. Additionally optimizing the operation with dynamic routing increases the performance further, but the gain is negligible for encrypting DWDMNs.
Quantum key distribution (QKD) uses the laws of quantum mechanics to distribute secret keys with information-theoretic security. To realize QKD for secure communications among multiple distant users, fiber-based QKD networks can be deployed with today's available technologies. Incorporating QKD into existing wavelength-division multiplexing (WDM) network infrastructure provides a practical way to reduce the difficulty and cost of QKD networking. Nonetheless, the costs of QKD nodes and QKD links are still considered as the major barriers to long-distance QKD network deployment in practice. In this work, we study how to minimize the cost of deploying QKD-over-WDM backbone networks. We introduce a general architecture of QKD-over-WDM backbone networks. A novel cost-oriented model is defined to elaborate the cost-minimized problem, in which various QKD network components including QKD transceivers, QKD auxiliary equipment for QKD backbone nodes and trusted repeater nodes (TRNs), and QKD links are considered. The physical-layer parameters such as secret-key rate, physical distance, and the layout of TRNs are also incorporated in our defined model. We develop an integer linear programming (ILP) model and a novel cost-efficient QKD networking (CEQN) heuristic algorithm to address the cost-minimized problem. The extensive simulations indicate that our proposed approaches are effective in reducing the cost of deploying QKD-over-WDM backbone networks, where the designed CEQN algorithm is efficient to demonstrate similar to the ILP model. Finally, some open issues in future work are discussed, given that this work only presents an early highlevel analysis as opposed to a definitive detailed model.
Quantum Key Distribution (QKD) is currently being explored as a solution to the threats posed to current cryptographic protocols by the evolution of quantum computers and algorithms. However, single-photon quantum signals used for QKD permit to achieve key rates strongly limited by link performance (e.g., loss and noise) and propagation distance, especially in multi-node QKD networks, making it necessary to design a scheme to efficiently and timely distribute keys to the various nodes. In this work, we introduce the new problem of joint Routing, Channel, Key-rate and Time-slot Assignment (RCKTA), which is addressed with four different network settings, i.e., allowing or not the use of optical bypass (OB) and trusted relay (TR). We first prove the NP-hardness of the RCKTA problem for all network settings and formulate it using a Mixed Integer Linear Programming (MILP) model that combines both quantum channels and quantum key pool (QKP) to provide an optimized solution in terms of number of accepted key rate requests and key storing rate. To deal with problem complexity, we also propose a heuristic algorithm based on an auxiliary graph, and show that it is able to obtain near-optimal solutions in polynomial time. Results show that allowing OB and TR achieves an acceptance ratio of 39% and 14% higher than that of OB and TR, respectively. Remarkably, these acceptance ratios are obtained with up to 46% less QKD modules (transceivers) compared to TR and only few (less than 1 per path) additional QKD modules than OB.
Quantum key distribution (QKD) is a promising technology that can provide future-proof security. With the emergence of multiple advanced QKD protocols, the QKD protocol upgrading for a metropolitan quantum optical network (MQON) is critical for fulfilling the requirements of users for secret keys with a high security level. Conventionally, due to the lack of effective QKD protocol upgrading strategies for MQONs, massive amounts of resources have to be consumed during QKD protocol upgrading, resulting in high costs. In order to reduce the costs for practical implementation of QKD protocol upgrading, in this work, a new policy of QKD protocol upgrading is proposed, where the bypass technique is adopted to decouple multiple protocols from the linking patterns for efficient resource utilization. Moreover, we illustrate a multi-role QKD node structure for enabling the harmonious operation of multiple QKD protocols. A mixed integer linear programming (MILP) model and a novel divided-packet-based QKD protocol upgrading algorithm are designed to save costs by relying on flexible traffic management. We also propose a fixed-chain-based QKD protocol upgrading algorithm with fixed traffic management for achieving low costs. Simulation results indicate that the proposed heuristic algorithms are significantly more cost effective than the associated benchmark algorithms, while the MILP model can reduce the cost of protocol upgrading by 41% compared with the benchmark.