Optimization of Hierarchical Routing and Resource Allocation for Power Communication Networks With QKD

The current power service communication relies on classical cryptographic systems, which is vulnerable to attacks from quantum computers. The emerging quantum key distribution (QKD) technology offers information theoretical security, which makes it a promising solution for securing the power backbone communication network. However, integrating QKD and classical power communication on the same fiber can result in significant interference. The primary challenge is to ensure the success rate of QKD and the quality of service (QoS) of power services simultaneously. To address this challenge, this article proposes a network slicing algorithm based on hierarchical routing and dynamic resource allocation (HRDRA). Specifically, a multi-constrained acyclic k shortest path algorithm based on the hierarchical mechanism is developed to achieve differentiated resource mapping of QKD and power service slices. Furthermore, a slicing resource allocation scheme based on chance constrained optimization is designed to improve the flexibility and utilization of resources. Simulation results indicate that the proposed algorithm effectively guarantee the isolation of QKD and power services, and achieve a high key exchange success rate and better QoS for power services.