TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning

Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas
{"title":"TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning","authors":"Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas","doi":"10.1109/TQE.2024.3509019","DOIUrl":null,"url":null,"abstract":"Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0000,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10771724","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Quantum Engineering","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10771724/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.00
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信