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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Satellite Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
