Routing Methods for Latency and Resource Optimized in Trusted Relay QKD Networks

抄録

Quantum secure communication networks based on quantum key distribution (QKD) technology are gradually improving, which can provide remote and networked key services for multiple users. This paper proposes a key distribution solution for latency and resource optimization in trusted relay QKD networks. In this scheme, the key distribution process between trusted relay nodes is presented as a joint optimization problem by considering the constraints of service delay, bandwidth, path resource consumption, quality loss and remaining quantum key quantity. In this paper, we treat key distribution as a bi-objective minimization problem, maintaining a trade-off between service delay and path resource consumption. Specifically, we propose a dynamic key distribution framework based on linear programming and particle swarm optimization. Simulation results show that the key distribution path selection in this scheme can be adjusted according to the service delay, key quality, and path resource consumption. Compared with the Random and customized OSPF policies, this scheme has higher performance. More specifically, the solution reduced average service latency by 27% while reducing path resource consumption by 56%.