Deep reinforcement learning‐based routing and resource assignment in quantum key distribution‐secured optical networks

Abstract

In quantum key distribution‐secured optical networks (QKD‐ONs), constrained network resources limit the success probability of QKD lightpath requests (QLRs). Thus, the selection of an appropriate route and the efficient utilisation of network resources for establishment of QLRs are the essential and challenging problems. This work addresses the routing and resource assignment (RRA) problem in the quantum signal channel of QKD‐ONs. The RRA problem of QKD‐ONs is a complex decision making problem, where appropriate solutions depend on understanding the networking environment. Motivated by the recent advances in deep reinforcement learning (DRL) for complex problems and also because of its capability to learn directly from experiences, DRL is exploited to solve the RRA problem and a DRL‐based RRA scheme is proposed. The proposed scheme learns the optimal policy to select an appropriate route and assigns suitable network resources for establishment of QLRs by using deep neural networks. The performance of the proposed scheme is compared with the deep‐Q network (DQN) method and two baseline schemes, namely, first‐fit (FF) and random‐fit (RF) for two different networks, namely The National Science Foundation Network (NSFNET) and UBN24. Simulation results indicate that the proposed scheme reduces blocking by 7.19%, 10.11%, and 33.50% for NSFNET and 2.47%, 3.20%, and 19.60% for UBN24 and improves resource utilisation up to 3.40%, 4.33%, and 7.18% for NSFNET and 1.34%, 1.96%, and 6.44% for UBN24 as compared with DQN, FF, and RF, respectively.

Impact of fragmentation in quantum signal channel of quantum key distribution enabled optical networks

“…Various existing studies [20,22,[27][28][29][30][31] have addressed the resource assignment problem of QKD-enabled ONs [22]. Different routing and resource assignment strategies were designed for both static (where lightpath requests are known in advance) [20] and dynamic (where lightpath requests are not known in advance) [22] traffic scenarios.…”