一种基于Prime算法的SDQKD网络路由方案

A SDQKD NETWORK ROUTING SCHEME BASED ON PRIME ALGORITHM

  • 摘要: 为解决当前QKD网络密钥量不足、链路状态信息更新不及时等导致的网络性能不佳问题,提出一种基于Prime算法的SDQKD网络路由方案。方案采用偏离思想,提出一种基于Prime的多路径算法,将链路剩余密钥量作为权重得出K条路径;再基于可用密钥生成率和中继跳数从K条路径中求出最优路径,实现路由时选择可用密钥量相对较大的路径,还综合考虑了中继跳数和可用密钥生成率。方案还针对SDQKD网络上报链路状态信息不及时或占用资源过多的问题,提出基于剩余密钥量变化幅度的启发式按需上报链路状态信息机制。实验仿真结果表明该方案在两个不同拓扑大量级数据下分别提高了密钥分发成功率9.6百分点~14.8百分点和7百分点~14百分点,还实现了根据请求强度按需上报链路状态信息。

     

    Abstract: 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.

     

/

返回文章
返回