一种基于KSP的QKD网络路由算法  

A ROUTING ALGORITHM BASED ON KSP FOR QKD NETWORK

作　　者：谢四江 潘俊学 冯雁 Xie Sijiang;Pan Junxue;Feng Yan(Department of Cyberspace Security,Beijing Electronic Science and Technology Institute,Beijing 100070,China)

机构地区：[1]北京电子科技学院网络空间安全系,北京100070

出　　处：《计算机应用与软件》2025年第2期144-151,共8页Computer Applications and Software

基　　金：国家重点研发计划项目(2018YFE0200600)。

摘　　要：传统网络的路由算法在QKD网络中无法快速感知链路变化,做出最优决策。针对这种情况,设计一种基于KSP的QKD网络多路径路由算法。算法首先以剩余密钥量作为初始链路成本求出前K条最短路径,同时引入密钥新鲜度这一重要因素,采用定时查询密钥生产时间差的方式衡量密钥新鲜度,通过比较K条路径的平均密钥新鲜度,最终选出一条最优路径。实验结果表明该算法通过使用多路径能解决单路径中的密钥消耗不均衡、密钥分发中断等问题,有效提高了密钥分发成功率和链路密钥消耗均匀性。Traditional network routing algorithms can not quickly perceive link changes and make optimal decisions in QKD network.In view of this,a multi-path routing algorithm for QKD network based on KSP is designed.The algorithm took the remaining key amount as the initial link cost to calculate the first K shortest paths.At the same time,it introduced the important factor of key freshness,measured the key freshness by regularly querying the key production time difference,and selected an optimal path by comparing the average key freshness of K paths.Experimental results show that the algorithm can solve the problems of unbalanced key consumption and interruption of key distribution in a single path,and effectively improve the success rate of key distribution and the uniformity of link key consumption.

关 键 词：QKD网络 多路径 KSP 密钥新鲜度 

分 类 号：TN918.4[电子电信—通信与信息系统] TP3[电子电信—信息与通信工程]