摘要
针对量子密钥分发QKD(Quantum Key Distribution)网络组密钥协商中的组密钥服务节点选址问题,根据组密钥服务节点数量确定和不确定两种不同情况,构建了常规的p-median选址模型和改进的p-median选址模型,并就每种选址模型分别设计了枚举法和贪婪算法两种选址算法。通过仿真模拟实验比较了两种算法的性能,并结合两种算法的不同性能特点阐述了各自的应用场景。结果表明,该算法步骤清晰,操作简单,易于掌握,具有一定的实际意义和参考价值。
To handle out the location problem for group key service nodes in quantum key distribution （QKD）networks, a normal p-median location model and a modified p-median location model are constructed separately in the light of whether the number of group key service nodes is decided or not. In each model, both enumeration algorithm and greedy algorithm are designed, and their different application scenarios are also presented. The results of simulation experiments show that the algorithms are clear and easy to practice, and the proposal will be reference to similar research.
作者
石磊
郭义喜
苏锦海
Shi Lei Guo Yixi Su Jinhai(PLA University of Information Engineering,Zhengzhou 450004 ,Henan, Chin)
出处
《计算机应用与软件》
2017年第3期243-247,共5页
Computer Applications and Software
