The integration of Quantum Key Distribution (QKD) into optical network requires a routing mechanism that can ensure survivability. In the physical world, there are disasters, both natural and man-made. Such disasters result in node failure, link failure, etc. For a seamless QKD network, this paper formulates a cost function to reroute the communication to a less vulnerable and error-free path. The proposed cost function incorporates the Quantum bit error rate (QBER), disaster vulnerability score (DVS), keyrate and latency. Further, the proposed routing algorithm is compared with other routing algorithms by considering failures like node failure, link failure and regional failure on a $\mathbf{1 4}$-node and $\mathbf{2 1}$-link NSFNET topology.
The integration of Quantum Key Distribution (QKD) into optical network requires a routing mechanism that can ensure survivability. In the physical world, there are disasters, both natural and man-made. Such disasters result in node failure, link failure, etc. For a seamless QKD network, this paper formulates a cost function to reroute the communication to a less vulnerable and error-free path. The proposed cost function incorporates the Quantum bit error rate (QBER), disaster vulnerability score (DVS), keyrate and latency. Further, the proposed routing algorithm is compared with other routing algorithms by considering failures like node failure, link failure and regional failure on a 14-node and 21-link NSFNET topology.
Quantum key distribution (QKD) enables information-theoretically secure communication but is limited by transmission distance and vulnerable to network disruptions. Trusted repeater nodes (TRNs) extend QKD transmission over large-scale optical networks, although their deployment introduces significant cost and planning complexity under heterogeneous traffic and disaster conditions. This paper proposes a traffic-aware and disaster-resilient mixed-integer linear programming (MILP) framework for TRN placement in QKD optical networks considering physical-layer feasibility (SKR/QBER), security-dependent transmission limits, and link-disjoint protection under multiple disaster scenarios. Evaluations on the NSFNET topology show that, compared with a protection-aware shortest-path greedy (SP-Greedy) baseline, the proposed framework achieves up to 70-80% reduction in TRN deployment and more than 50% cost savings while maintaining survivability under severe multi-link failures. Results further demonstrate efficient traffic-aware scalability through adaptive resource allocation, providing a practical and physically-grounded solution for resilient QKD-enabled optical networks.
Quantum Key Distribution (QKD) networks enable unconditionally secure key exchange using quantum mechanical principles. However, routing cryptographic keys across multi-hop quantum networks introduces challenges unique to quantum communication. This survey analyzes and classifies 26 routing strategies proposed between 2013 and 2024 for terrestrial, satellite, and hybrid QKD infrastructures. Dynamic, key-aware routing algorithms have been shown to reduce service rejection rates by 25-40% compared to static shortest-path methods by incorporating real-time key pool availability and link error rates. Multi-path strategies improve resilience against trusted-node compromise by distributing keys across disjoint routes, albeit with an increase in key consumption of 30-60%. SDN-based orchestration frameworks emerge as essential enablers of flexible, QoS-aware routing for hybrid networks integrating terrestrial fibers and intermittent satellite links. Critical research directions include reducing dependence on trusted nodes through quantum repeaters or post-quantum cryptography, developing standardized key management interfaces for interoperability, and adopting AI-driven predictive routing for adapting to fluctuating network states. This comprehensive synthesis of routing algorithms, performance trade-offs, and unresolved issues offers practical guidance for engineering secure, adaptable, and large-scale QKD networks capable of meeting real-world deployment demands.
Growing practicality and deployment of optical Quantum Key Distribution (QKD) has renewed interest in Information-Theoretic Secure (ITS) key exchange for future communication networks. Providing ITS keys as a service over existing optical network infrastructures is feasible, however it poses significant challenges, particularly due to limited access to large-scale QKD testbeds and the need to ensure reliability under network failures. To address this gap, this work presents a discrete-event QKD optical network simulator designed to study ITS key-as-a-service provisioning under fiber link failure conditions. The simulator integrates survivability and resource management concepts inspired by wavelength-division multiplexed optical networks. Using this framework, the performance of a Time-Slot Key-Rate-Aware Shared Path Protection (TSKRA-SPP) scheduling algorithm is evaluated in terms of throughput, failure tolerance, and Quality of Service (QoS). TSKRA-SPP provides high failure tolerance while keeping resource consumption significantly low compared to baseline Shared Path Protection (SPP) algorithm. The results validate the proposed simulation framework to be an effective tool for analyzing resilient ITS key provisioning in QKD-enabled optical networks.
Quantum key distribution (QKD) provides information-theoretic security based on quantum mechanics, and as quantum key distribution becomes increasingly practical, questions of how to employ it effectively over largescale networks and large distances becomes increasingly important. In this work, we investigate the B92 entanglement based QKD protocol and a five-layer QKD network architecture consisting of trusted relay nodes. Previous research seldom focused on the ground routing mechanism of QKD networks in detail. Since no intersecting links are beneficial to reducing the key consumption rate and improving link security, combined with the core idea of reducing the number of link relay hops, we propose a minimum path cost multi-path routing algorithm for no intersecting links in quantum key distribution networks. By analyzing the security of the link, we effectively reduce the number of relay nodes and the number of relay links that pass through and give priority to the routing scheme with the minimum number of hops in the number of relay hops, which avoids the congestion and waste caused by the existence of interleaved multi-path in traditional multi-path routing. Meanwhile, the scheme effectively improves the quality of service index, avoids the generation and consumption of redundant keys, and reduces the waste of quantum key resources.
We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote nodes, i.e., not directly connected by a QKD link, through multiple non-overlapping paths. This approach focuses on the security of a QKD network by minimizing potential vulnerabilities associated with individual trusted nodes. The algorithm ensures a balanced allocation of the workload across the QKD network links, while aiming for the target key generation rate between directly connected and remote nodes. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes. The testing demonstrates the ability of the algorithm to distribute secure keys among the nodes of the network in an all-to-all manner, ensuring that the information-theoretic security of the keys between remote nodes is maintained even when one of the trusted nodes is compromised. These results highlight the potential of the algorithm to improve the performance of QKD networks.
The application of quantum key distribution, satellite communication, and programmable wireless access in future secure wireless networks is anticipated to enhance secure communication infrastructure.However, their realisation demands more than the physical implementation of quantum links.A network controller must determine when a quantum-secured wireless link can serve a request, how orbit type and weather conditions affect usable key volume, and whether the secure key rate is high enough to admit a route.This paper introduces Q-SARA, a quantum-secure access and routing admission model for satellite-assisted quantum wireless networks.Q-SARA assesses candidate QKD access links using secure key rate (SKR), quantum bit error rate (QBER), link loss, contact duration, visibility probability, and propagation delay.A smaller pre-processed dataset is derived from the public Satellite-to-Ground QKD SKR dataset, which contains calculated key performance indicators for Low Earth Orbit, Medium Earth Orbit, and Geostationary satellite-to-ground QKD links using prepare-and-measure and entanglement-based protocols.The empirical analysis examines 7,200 link-level records and evaluates Q-SARA across orbit, protocol, optical ground station, elevation, atmospheric, and service classes.The findings demonstrate that link selection based only on key volume can be misleading when assessing service quality, while the multi-criteria score provides a better balance between security, visibility, and latency.LEO links provide better instantaneous key rates, GEO links provide better visibility, and MEO links lie between them and can be exploited when link quality and service are considered jointly.The results suggest that quantum wireless access should be considered a service admission problem rather than only a physical-layer key generation problem.