Dynamic resource management algorithm reconfiguration for multibeam satellite constellations

Abstract

Satellite mega constellations are a reality. The new generation of High Throughput Satellites has motivated the research in Dynamic Resource Management (DRM) strategies for satellite communications. Unprecedented levels of flexibility, granted by adjustable payloads able to reallocate resources such as power or frequency in real time, have placed manual resource allocation in a disadvantageous position. Many algorithmic solutions have been specifically proposed to address this issue. However, the majority of the proposed models have mostly been proven under conditions that do not represent the upcoming satellite communications scenarios. Failure to scale up those algorithmic solutions to current high-dimensional constellations might result in a poor resource allocation, or even worse, a service agreement violation. In addition, since many of the elements that are input to these algorithms change over time, new requirements impose being able to not only scale up but also reconfigure in real time in order to make the best use of capacity. To that end, this work presents and tests a methodology to dynamically configure DRM algorithms with the aim of granting viability of operation under multiple possible scenarios that reflect realistic operations. Using the specific frequency assignment problem as a test case, we show that adapting the algorithm's configuration based on analyzing the input scenario results in up to 79% reduction in computing time, allowing for more operation cycles. Thanks to the adapted configurations, the algorithm is able to reach a frequency assignment of the same quality in 88% less time compared to using a unique baseline configuration for all scenarios.