Hierarchical Routing Scheme for Wide-Area Quantum Key Distribution Network

YANG Chao; ZHANG Hong-qi; SU Jin-hai; HU hao; ZHAO Dan; WANG Fang

doi:10.12263/DZXB.20170960

您当前的位置：

首页 >

文章列表页 >

Hierarchical Routing Scheme for Wide-Area Quantum Key Distribution Network

更新时间：2025-12-08

- Hierarchical Routing Scheme for Wide-Area Quantum Key Distribution Network
- Acta Electronica Sinica Vol. 49, Issue 5, Pages: 975-983(2021)
- 作者机构：
  
  1. 中国空气动力研究与发展中心计算空气动力研究所,四川,绵阳,621000
  2. 信息工程大学,河南,郑州,450004
  3. 中国空气动力研究与发展中心计算空气动力研究所,四川,绵阳,621000
  4. 信息工程大学,河南,郑州,450004
- 作者简介：
- 基金信息：
- DOI：10.12263/DZXB.20170960
  CLC： TP393.2
- Published：2021
- 稿件说明：
移动端阅览
YANG Chao, ZHANG Hong-qi, SU Jin-hai, et al. Hierarchical Routing Scheme for Wide-Area Quantum Key Distribution Network[J]. Acta Electronica Sinica, 2021, 49(5): 975-983.
DOI：

YANG Chao, ZHANG Hong-qi, SU Jin-hai, et al. Hierarchical Routing Scheme for Wide-Area Quantum Key Distribution Network[J]. Acta Electronica Sinica, 2021, 49(5): 975-983. DOI： 10.12263/DZXB.20170960.

摘要

针对现有可信中继QKD(Quantum Key Distribution)网络路由方案应用于广域环境时存在着密钥交换效率低、密钥资源无意义消耗大的问题

分析了影响密钥交换效率的因素

设计了适应广域QKD网络的分层路由方案.该方案将QKD网络划分为若干路由域

并通过拓扑聚合构建分层QKD网络

设计了基于最低层网络匹配的跨域密钥路由算法

使得高层路由域内一跳便可跨过多个低层路由域

极大地降低了密钥中继跳数

提高了密钥交换效率及密钥资源利用率.仿真结果表明分层路由方案相对于现有单层逐跳式路由方案能够提高大约77.6%密钥资源利用率

同时缩短一半密钥服务延时.

Abstract

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.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Method of Ant Colony Optimization and Quasi-Real-Time Key Pool Based on Survivability Virtual Network Embedding

Related Author

LIU Huan-lin

LIU Bo

CHEN Yong

MA Bing

QIU Yan

CHEN Hao-nan

Related Institution

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

Chongqing Institute of Engineering

⁰