检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨超 张红旗[2] 苏锦海[2] 胡浩[2] 赵丹[1] 王昉 YANG Chao;ZHANG Hong-qi;SU Jin-hai;HU hao;ZHAO Dan;WANG Fang(Computational Aerodynamics Institute,China Aerodynamics Research and Development Center,Mianyang,Sichuan 621000,China;Information Engineering University,Zhengzhou,Henan 450004,China)
机构地区:[1]中国空气动力研究与发展中心计算空气动力研究所,四川绵阳621000 [2]信息工程大学,河南郑州450004
出 处:《电子学报》2021年第5期975-983,共9页Acta Electronica Sinica
摘 要:针对现有可信中继QKD(Quantum Key Distribution)网络路由方案应用于广域环境时存在着密钥交换效率低、密钥资源无意义消耗大的问题,分析了影响密钥交换效率的因素,设计了适应广域QKD网络的分层路由方案.该方案将QKD网络划分为若干路由域,并通过拓扑聚合构建分层QKD网络,设计了基于最低层网络匹配的跨域密钥路由算法,使得高层路由域内一跳便可跨过多个低层路由域,极大地降低了密钥中继跳数,提高了密钥交换效率及密钥资源利用率.仿真结果表明分层路由方案相对于现有单层逐跳式路由方案能够提高大约77.6%密钥资源利用率,同时缩短一半密钥服务延时.Aimed at the problems,such as low key exchange efficiency and large meaningless consumption of secret key materials,when the existing routing schemes for trust relaying QKD(quantum key distribution)network used in the wide-area environment,a hierarchical routing scheme which is suitable for wide-area QKD network was designed.This routing scheme divided the QKD network into multiple routing areas,built a hierarchical network by topological aggregation and designed a cross-domain routing algorithm based on the principle of the lowest layer matching.Then the hop number in the routing path is decreased,and the efficiency of key exchange and the utilization rate of secret key materials ware increased.At last,the simulation results shows that our hierarchical routing scheme can increase about 77.6%utilization rate of secret key materials and reduce service delay by half compared with the existing routing schemes which just relaying secret key hop by hop in a single layer.
分 类 号:TP393.2[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7