量子卫星网络中一种基于多目标优化的路由方案

Miao Zhao, Na Deng, Haichao Wei
{"title":"量子卫星网络中一种基于多目标优化的路由方案","authors":"Miao Zhao, Na Deng, Haichao Wei","doi":"10.1109/ICCC57788.2023.10233495","DOIUrl":null,"url":null,"abstract":"In quantum satellite networks, routing is an important task for providing key relay services to ground stations (GSs). For the demand of quantum keys for multiple concurrent requests between GS pairs, we formulate a multi-objective optimization routing (MOOR) problem to allocate the quantum key and time-slot resources to find routes for simultaneous services. The proposed optimization scheme maximizes the number of successful requests while minimizing the routing cost. Specifically, we consider that the fewer available quantum keys on the link, the greater the cost of occupying the link. Then we use the reciprocal of the number of available keys on links to represent link costs, and find the route with the minimum link costs. Simulation results show that the success probability of MOOR scheme is higher than that of the comparison routing strategy based on Dijkstra algorithm, especially when the number of keys forwarded by a request is not too large, the improvement is significant.","PeriodicalId":191968,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Routing Scheme Based on Multi-Objective Optimization in Quantum Satellite Networks\",\"authors\":\"Miao Zhao, Na Deng, Haichao Wei\",\"doi\":\"10.1109/ICCC57788.2023.10233495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In quantum satellite networks, routing is an important task for providing key relay services to ground stations (GSs). For the demand of quantum keys for multiple concurrent requests between GS pairs, we formulate a multi-objective optimization routing (MOOR) problem to allocate the quantum key and time-slot resources to find routes for simultaneous services. The proposed optimization scheme maximizes the number of successful requests while minimizing the routing cost. Specifically, we consider that the fewer available quantum keys on the link, the greater the cost of occupying the link. Then we use the reciprocal of the number of available keys on links to represent link costs, and find the route with the minimum link costs. Simulation results show that the success probability of MOOR scheme is higher than that of the comparison routing strategy based on Dijkstra algorithm, especially when the number of keys forwarded by a request is not too large, the improvement is significant.\",\"PeriodicalId\":191968,\"journal\":{\"name\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC57788.2023.10233495\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC57788.2023.10233495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在量子卫星网络中,路由是向地面站提供关键中继服务的一项重要任务。针对GS对之间多个并发请求对量子密钥的需求,提出了一个多目标优化路由(MOOR)问题,通过分配量子密钥和时隙资源来寻找同时服务的路由。提出的优化方案使成功请求的数量最大化,同时使路由开销最小化。具体来说,我们认为链路上可用的量子密钥越少,占用链路的成本就越大。然后我们用链路上可用键数的倒数来表示链路开销,并找到链路开销最小的路由。仿真结果表明,MOOR方案的成功概率高于基于Dijkstra算法的比较路由策略,特别是当一个请求转发的密钥数量不太大时,改进效果显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Routing Scheme Based on Multi-Objective Optimization in Quantum Satellite Networks
In quantum satellite networks, routing is an important task for providing key relay services to ground stations (GSs). For the demand of quantum keys for multiple concurrent requests between GS pairs, we formulate a multi-objective optimization routing (MOOR) problem to allocate the quantum key and time-slot resources to find routes for simultaneous services. The proposed optimization scheme maximizes the number of successful requests while minimizing the routing cost. Specifically, we consider that the fewer available quantum keys on the link, the greater the cost of occupying the link. Then we use the reciprocal of the number of available keys on links to represent link costs, and find the route with the minimum link costs. Simulation results show that the success probability of MOOR scheme is higher than that of the comparison routing strategy based on Dijkstra algorithm, especially when the number of keys forwarded by a request is not too large, the improvement is significant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信