A SDQKD NETWORK ROUTING SCHEME BASED ON PRIME ALGORITHM

An SDQKD network routing scheme based on Prime algorithm is proposed in order to solve the problems of poor network performance caused by insufficient key quantity and untimely update of link state information. The scheme proposed a multi-path algorithm based on Prime by adopting the idea of the deviation, which took the residual key quantity of the link as the weight to obtain K paths. The optimal path was obtained from the K paths based on the key generation rate and the number of relay hops, which achieved the selection of the path with relatively large available key amount when routing, and integrated the number of relay hops and the available key generation rate. Targeting the problem that the SDQKD network did not report the link status information in time or occupy too many resources, a heuristic on-demand link state information reporting mechanism based on the change range of residual key quantity was put forward in the scheme. The experimental simulation results show that the scheme improves the key distribution success rate by 9.6~14.8 percentage points and 7~14 percentage points in two different topologies with large amount of level data, and realizes the reporting of link state information according to the request strength.