Starvation-aware Entanglement Quantum Routing for Quantum Key Distribution

Starvation-aware Entanglement Quantum Routing for Quantum Key Distribution

연구 분야: Cryptography

학회: 2024 IEEE International Conference on Consumer Electronics (ICCE)

The conventional entanglement routing algorithms favor the shorter path to maximize the throughput, which leads to the starvation problem in Quantum Key Distribution (QKD). In this paper, we focus on solving the starvation problem in QKD. We design a starvation-aware entanglement routing algorithm, which gives higher priority to the QKD task facing the starvation problem. Specifically, we prioritize the QKD task with a longer Key Distribution Time (KDT). The entangled qubit pairs will first be assigned to the path with the highest priority. Simulation results show that our proposed starvation-aware entanglement routing algorithm can reduce the maximum KDT by up to ten times.