{"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}
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.