Problem representation of dynamic resource allocation for flexible high throughput satellities

Abstract

Within the next years, flexible high-throughput (HT) satellite with 100s-1000s of beams will be launched to provide broadband connectivity to a variety of customers on Earth. The user demand, especially in the mobility sector, is expected to have large diurnal variations. To follow this dynamic demand behavior, many HT satellites will be equipped with flexible power and bandwidth capabilities. This flexibility comes with a large number of adjustable parameters. Optimization of these parameters ensures that the demand can be met with the minimum required resources, resulting in an efficient utilization of assets on orbit. The challenge lies in the high dimensionality of the problem, where manual resource allocation will quickly become impractical. This paper develops a representation of the dynamic resource allocation problem and outlines an approach to solve the problem including different sets of algorithms such as deterministic solvers and heuristic approaches from artificial intelligence.