摘要
为了解决已有的基于信任中继的QKD网络路由方案存在的密钥浪费、传输效率低下等问题,该文针对已有的路由算法进行改进,提出了一种基于回溯的随机路由算法。该算法在选路过程中对每个分支添加回溯点,针对已选路径传输过程中遇到某条链路密钥量不足的情况,通过查找最近的回溯点,从回溯点开始沿着随机选择的新路径重新进行密钥传递。对比实验及分析结果表明,该算法在选路时间、密钥消耗量及密钥传输效率方面都有一定的优势。
In order to solve the problems of key waste and low transmission efficiency in the existing routing scheme of quantum key distribution(QKD)network based on trust relay,a random routing algorithm based on backtracking is proposed to improve the existing routing algorithm.In the process of routing,the algorithm adds backtracking points to each branch,in the transmission process along the selected path,when the key quantity of a certain link is insufficient,by looking for the nearest backtracking point,the key can be transferred along the randomly selected new path again from the backtracking point.The comparison experiment and analysis results show that the algorithm has certain advantages in routing time,key consumption and key transmission efficiency.
作者
徐雅斌
张梅舒
李艳平
XU Ya-bin;ZHANG Mei-shu;LI Yan-ping(Beijing Key Laboratory of Internet Culture and Digital Dissemination Research,Beijing Information Science&Technology University,Chaoyang Beijing,100101;School of Computer,Beijing Information Science&Technology University,Chaoyang Beijing,100101)
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2021年第4期565-571,共7页
Journal of University of Electronic Science and Technology of China
基金
中央引导地方科技发展专项(Z171100004717002)
网络文化与数字传播北京市重点实验室(ICDDXN004)的资助。
关键词
回溯
量子密钥分发
QKD网络
随机路由
信任中继
backtracking
quantum key distribution
QKD network
random routing
trust relay
