Paul Grislain, Alexia Auddino, Anna Barraqué, François Lamothe, Oana Hotescu, Jérôme Lacan, José Radzik, Emmanuel Lochin
{"title":"Rethinking LEO constellations routing","authors":"Paul Grislain, Alexia Auddino, Anna Barraqué, François Lamothe, Oana Hotescu, Jérôme Lacan, José Radzik, Emmanuel Lochin","doi":"10.1002/sat.1514","DOIUrl":null,"url":null,"abstract":"SummaryThis study investigates the unsplittable multicommodity flow (UMCF) as a routing algorithm for LEO constellations. Usually, LEO routing schemes enable the Floyd–Warshall algorithm (shortest path) to minimize the end‐to‐end latency of the flows crossing the constellation. We propose to solve the UMCF problem associated with the system as a solution for routing over LEO. We use a heuristic algorithm based on randomized rounding known in the optimization literature to efficiently solve the UMCF problem. Furthermore, we explore the impact of choosing the first/last hop before entering/exiting the constellation. Using network simulation over Telesat constellation, we show that UMCF maximizes the end‐to‐end links usage, providing better routing while minimizing the delay and the congestion level, which is an issue today over new megaconstellations.","PeriodicalId":50289,"journal":{"name":"International Journal of Satellite Communications and Networking","volume":"53 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Satellite Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1002/sat.1514","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, AEROSPACE","Score":null,"Total":0}
引用次数: 0
Abstract
SummaryThis study investigates the unsplittable multicommodity flow (UMCF) as a routing algorithm for LEO constellations. Usually, LEO routing schemes enable the Floyd–Warshall algorithm (shortest path) to minimize the end‐to‐end latency of the flows crossing the constellation. We propose to solve the UMCF problem associated with the system as a solution for routing over LEO. We use a heuristic algorithm based on randomized rounding known in the optimization literature to efficiently solve the UMCF problem. Furthermore, we explore the impact of choosing the first/last hop before entering/exiting the constellation. Using network simulation over Telesat constellation, we show that UMCF maximizes the end‐to‐end links usage, providing better routing while minimizing the delay and the congestion level, which is an issue today over new megaconstellations.
期刊介绍：
The journal covers all aspects of the theory, practice and operation of satellite systems and networks. Papers must address some aspect of satellite systems or their applications. Topics covered include:
-Satellite communication and broadcast systems-
Satellite navigation and positioning systems-
Satellite networks and networking-
Hybrid systems-
Equipment-earth stations/terminals, payloads, launchers and components-
Description of new systems, operations and trials-
Planning and operations-
Performance analysis-
Interoperability-
Propagation and interference-
Enabling technologies-coding/modulation/signal processing, etc.-
Mobile/Broadcast/Navigation/fixed services-
Service provision, marketing, economics and business aspects-
Standards and regulation-
Network protocols
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
