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

IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)

Disaster-Resilient Trusted Repeater Node Placement for Traffic-Aware QKD Optical Networks

Adolph Timothy Kasegenya, Shailendra Raghuwanshi, Vimal Bhatia, Bowen Chen

Published Jul 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/conecct68978.2026.11700633

Related papers

Trusted Repeater Placement in QKD-enabled Optical Networks

Arup Kumar Marik, Basabdatta Palit, Sadananda Behera

Quantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using a composite score, which is a weighted combination of betweenness centrality and eigenvector centrality to enable a secure and scalable TRN deployment. Simulation results on a reference topology show that our method covers 10.77% more shortest paths compared to traditional metrics like degree centrality, using the same number (around eight) of TRNs, making it suitable for TRN selection to maximize secure connectivity.

arXiv:2509.10338•IEEE Globecom Workshops (GC Wkshps)•Dec 8, 2025•1 citation

Security-aware non-uniform multipath traffic partitioning for QKD networks: A MILP-based squeezing protection approach

K. D. R. Assis, Raul C. Almeida, Anderson A. Tomkelski +2 more

Quantum Key Distribution (QKD) enables information-theoretic secure key exchange, but the deployment of large-scale QKD networks introduces new challenges related to routing, resource allocation, and security exposure in trusted-node-based architectures. In multipath QKD networks, the secret key rate can be partitioned and transmitted over multiple link-disjoint paths, so that an adversary must simultaneously compromise all paths to reconstruct the complete secret key. However, traffic is often equally distributed across the available disjoint paths, although such uniform partitioning may be suboptimal when candidate paths exhibit heterogeneous vulnerability levels. This paper proposes a security-aware optimization framework for QKD-enabled optical networks that determines a non-uniform multipath traffic partitioning strategy aimed at minimizing the expected amount of eavesdropped traffic. The proposed approach is formulated as a Mixed-Integer Linear Programming (MILP) model that integrates probabilistic secrecy metrics derived from trusted node compromise probabilities, a traffic vulnerability threshold that limits partial information exposure, and adaptive bandwidth squeezing protection to ensure service continuity under failure scenarios. The model jointly optimizes traffic allocation and excess key capacity, allowing the protection overhead to be dynamically determined according to security and resilience requirements. Numerical evaluations conducted on both a toy topology and the Pan-European network demonstrate that the proposed exposure-aware partitioning strategy significantly reduces the expected eavesdropped traffic compared to conventional equal-splitting approaches while maintaining resilience guarantees. These results highlight the potential of security-driven traffic engineering for the design of resilient and efficient multipath QKD networks.

Optical Fiber Technology•Jul 21, 2026•1 citation

Disaster Aware QKD Routing Algorithm

Dandetikar Vidyasagar, Parul Garg, Anand Srivastava

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.

International Conference on Innovative Sustainable Computational Technologies (CISCT)•Jul 1, 2026•0 citations

TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning

Ilora Maity, Junaid ur Rehman, Symeon Chatzinotas

Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.

IEEE Transactions on Quantum Engineering•Nov 28, 2024•11 citations

Reliability-Guided Trusted Repeater Node Selection in QKD-Enabled Metro Optical Networks

Arup Kumar Marik, Basabdatta Palit, Sadananda Behera

Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.

arXiv:2609.18797•Sep 16, 2026•0 citations

Survivability of QKD-enabled optical network during link failure

Rahul Verma, Vimal Bhatia, Suman Palrecha +1 more

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.

Journal of Nonlinear Optical Physics & Materials•Oct 16, 2026•0 citations
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) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using a composite score, which is a weighted combination of betweenness centrality and eigenvector centrality to enable a secure and scalable TRN deployment. Simulation results on a reference topology show that our method covers 10.77% more shortest paths compared to traditional metrics like degree centrality, using the same number (around eight) of TRNs, making it suitable for TRN selection to maximize secure connectivity.
Quantum Key Distribution (QKD) enables information-theoretic secure key exchange, but the deployment of large-scale QKD networks introduces new challenges related to routing, resource allocation, and security exposure in trusted-node-based architectures. In multipath QKD networks, the secret key rate can be partitioned and transmitted over multiple link-disjoint paths, so that an adversary must simultaneously compromise all paths to reconstruct the complete secret key. However, traffic is often equally distributed across the available disjoint paths, although such uniform partitioning may be suboptimal when candidate paths exhibit heterogeneous vulnerability levels. This paper proposes a security-aware optimization framework for QKD-enabled optical networks that determines a non-uniform multipath traffic partitioning strategy aimed at minimizing the expected amount of eavesdropped traffic. The proposed approach is formulated as a Mixed-Integer Linear Programming (MILP) model that integrates probabilistic secrecy metrics derived from trusted node compromise probabilities, a traffic vulnerability threshold that limits partial information exposure, and adaptive bandwidth squeezing protection to ensure service continuity under failure scenarios. The model jointly optimizes traffic allocation and excess key capacity, allowing the protection overhead to be dynamically determined according to security and resilience requirements. Numerical evaluations conducted on both a toy topology and the Pan-European network demonstrate that the proposed exposure-aware partitioning strategy significantly reduces the expected eavesdropped traffic compared to conventional equal-splitting approaches while maintaining resilience guarantees. These results highlight the potential of security-driven traffic engineering for the design of resilient and efficient multipath QKD networks.
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\mathbf{1 4}14-node and 21\mathbf{2 1}21-link NSFNET topology.
Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.
Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.
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.