A Distributed Routing Protocol Based on Key Reservation in Quantum Key Distribution Networks

被引:0
作者
Wu, Jiaqi [1 ]
Chen, Lutong [1 ]
Zhang, Jing [2 ,3 ]
Huang, Zixuan [2 ]
Li, Zhonghui [1 ]
Li, Jian [1 ]
Xue, Kaiping [1 ]
Yu, Nenghai [1 ]
机构
[1] Univ Sci & Technol China USTC, Sch Cyber Sci & Technol, Hefei 230027, Peoples R China
[2] Inst Space Integrated Ground Network, Hefei 230088, Anhui, Peoples R China
[3] USTC, Grad Sch, Sci Isl Branch, Hefei 230031, Anhui, Peoples R China
来源
ICC 2024 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS | 2024年
基金
中国国家自然科学基金;
关键词
Quantum Network; Quantum Key Distribution; Routing Algorithm; Key Reservation; CRYPTOGRAPHY;
D O I
10.1109/ICC51166.2024.10622992
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, Quantum Key Distribution (QKD) has garnered widespread attention due to its ability to provide symmetric secret keys with information-theoretic security in point-to-point communication. Additionally, key relay technology has been introduced to complete end-to-end key distribution between remote parties by consuming keys in the intermediate links. The routing problem of selecting paths for key relay technology becomes crucial as it directly impacts the network's performance. In this paper, we focus on addressing the routing problem for a specific scenario to serve applications with real-time requirements. Real-time is a critical necessity for supporting various applications, such as video chatting and calling. To satisfy real-time requirements and achieve Quality of Service (QoS) provision to guarantee the completion time, we introduce a distributed routing protocol called Distributed Routing Protocol Based on Key Reservation (Q-RoKR). It reserves keys in advance along the selected path, thereby satisfying real-time requirements. We also propose a priority-awareness mechanism to address resource competition and make efficient use of keys in links. Extensive experiments demonstrate that our protocol effectively meets the real-time requirements and significantly improves throughput. Furthermore, our key efficiency approaches the optimal bound when compared to other comparison schemes.
引用
收藏
页码:509 / 514
页数:6
相关论文
共 20 条
[1]   Quantum cryptography: Public key distribution and coin tossing [J].
Bennett, Charles H. ;
Brassard, Gilles .
THEORETICAL COMPUTER SCIENCE, 2014, 560 :7-11
[2]   The Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet [J].
Cao, Yuan ;
Zhao, Yongli ;
Wang, Qin ;
Zhang, Jie ;
Ng, Soon Xin ;
Hanzo, Lajos .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2022, 24 (02) :839-894
[3]   ADA-QKDN: a new quantum key distribution network routing scheme based on application demand adaptation [J].
Chen, Li-Quan ;
Zhao, Meng-Nan ;
Yu, Kun-Liang ;
Tu, Tian-Yang ;
Zhao, Yong-Li ;
Wang, Ying-Chao .
QUANTUM INFORMATION PROCESSING, 2021, 20 (09)
[4]   APR-QKDN: A Quantum Key Distribution Network Routing Scheme Based on Application Priority Ranking [J].
Chen, Liquan ;
Zhang, Ziyan ;
Zhao, Mengnan ;
Yu, Kunliang ;
Liu, Suhui .
ENTROPY, 2022, 24 (11)
[5]   SimQN: A Network-Layer Simulator for the Quantum Network Investigation [J].
Chen, Lutong ;
Xue, Kaiping ;
Li, Jian ;
Yu, Nenghai ;
Li, Ruidong ;
Sun, Qibin ;
Lu, Jun .
IEEE NETWORK, 2023, 37 (05) :182-189
[6]  
Cheng XZ, 2011, PROCEEDINGS OF 2011 INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENCE AND AWARENESS INTERNET, IET AIAI2011, P220, DOI 10.1049/cp.2011.1461
[7]   Building the quantum network [J].
Elliott, C .
NEW JOURNAL OF PHYSICS, 2002, 4 :46.1-46.12
[8]  
Elliott C, 2003, ACM SIGCOMM COMP COM, V33, P227
[9]   How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits [J].
Gidney, Craig ;
Ekera, Martin .
QUANTUM, 2021, 5
[10]   Towards Large-Scale Quantum Networks [J].
Kozlowski, Wojciech ;
Wehner, Stephanie .
PROCEEDINGS OF THE 6TH ACM INTERNATIONAL CONFERENCE ON NANOSCALE COMPUTING AND COMMUNICATION, 2019,