Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Rethinking LEO Constellations Routing with the Unsplittable Multi-Commodity Flows Problem

Abstract : This study investigates the performance of an innovative routing protocol inspired by the Unsplittable Multi-Commodity Flow (UMCF) problem. LEO routing schemes are often based on Shortest Path (SP) algorithms, the Floyd-Warshall algorithm is usually chosen to compute these network paths within the constellation and their end-toend latency. Instead of considering latency as a criterion, we seek to optimize the overall amount of IP traffic crossing the constellation. This criterion can be optimized by considering the Unsplittable Multi Commodity Flow problem associated with the system. To solve this problem, we use a heuristic algorithm based on randomized rounding that was shown to return solutions of good quality of the Unsplittable Multi Commodity Flow problem in the optimization literature. Using network simulation over Telesat constellation, we show this proposal significantly reduces the overall congestion level compared to the standard SP routing schemes.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-03739313
Contributeur : Emmanuel Lochin Connectez-vous pour contacter le contributeur
Soumis le : mercredi 27 juillet 2022 - 11:14:11
Dernière modification le : jeudi 4 août 2022 - 09:15:53

Fichier

2022144866.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-03739313, version 1

Collections

Citation

Paul Grislain, Nicolas Pelissier, François Lamothe, Oana Hotescu, Jérôme Lacan, et al.. Rethinking LEO Constellations Routing with the Unsplittable Multi-Commodity Flows Problem. The 11th Advanced Satellite Multimedia Systems Conference, Sep 2022, Graz, Austria. ⟨hal-03739313⟩

Partager