量子密钥分发网络端端密钥协商最优路径选择算法  

Optimal routing selection algorithm of end-to-end key agreement in quantum key distribution network

作　　者：石磊[1] 苏锦海[1] 郭义喜[1] 

机构地区：[1]信息工程大学,郑州450004

出　　处：《计算机应用》2015年第12期3336-3340,3397,共6页journal of Computer Applications

摘　　要：针对量子密钥分发(QKD)网络端端密钥协商路径选择问题,设计了一种基于改进Dijkstra算法的端端密钥协商最优路径选择算法。首先,基于有效路径策略,剔除网络中的失效链路;然后,基于最短路径策略,通过改进Dijkstra算法,得到密钥消耗最少的多条最短路径;最后,基于最优路径策略,从多条最短路径中选择一条网络服务效率最高的最优路径。分析结果表明,该算法很好地解决了最优路径不唯一、最优路径非最短、最优路径非最优等问题,可以降低QKD网络端端密钥协商时密钥消耗量,提高网络服务效率。Focusing on the routing selection of end-to-end key agreement in Quantum Key Distribution（ QKD） network,an optimal routing selection algorithm of end-to-end key agreement based on the Dijkstra algorithm was designed. Firstly, the unavailable links in the QKD networks were eliminated based on the strategy of choosing the available paths. Secondly, based on the strategy of choosing the shortest paths, the Dijkstra algorithm was improved to find out all the shortest paths with the least key consumption. Finally, according to the strategy of choosing the optimal path, the optimal path with the highest network service efficiency was selected from the shortest paths. The analysis results show that, the proposed algorithm solves the problems such as the optimal path is not unique, the best path is not the shortest, the optimal path is not optimal, and so on. The proposed algorithm can reduce the key consumption of end-to-end key agreement in QKD network, and improve the efficiency of network services.

关 键 词：量子密钥分发网络 端端密钥协商 路径选择 最短路径 DIJKSTRA算法 密钥消耗 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]