Affiliation:
1. Fédération ENAC ISAE‐SUPAERO ONERA Université de Toulouse Toulouse France
2. TéSA Laboratory Toulouse France
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.
Reference21 articles.
1. Spacex's Approach To Space Sustainability And Safety.https://www.spacex.com/updates/. Accessed: 2022‐07‐30.
2. Amazon receives FCC approval for Project Kuiper satellite constellation.https://www.aboutamazon.com/news/company-news/amazon-receives-fcc-approval-for-project-kuiper-satellite-constellation. Accessed: 2022‐07‐30.
3. Telesat Lightspeed Technology Infographic.https://www.telesat.com/wp-content/uploads/2021/04/Telesat-Lightspeed-Technology-Infographic.pdf. Accessed: 2022‐07‐30.
4. Satellite Communications in the New Space Era: A Survey and Future Challenges
5. HandleyM.Delay is not an option: Low latency routing in space.2018:85–91.