Table of Contents
Fetching ...

Quality of Service-Constrained Online Routing in High Throughput Satellites

Olivier Bélanger, Olfa Ben Yahia, Stéphane Martel, Antoine Lesage-Landry, Gunes Karabulut Kurt

TL;DR

This paper addresses internal routing and load balancing within high-throughput satellites (HTSs) by formulating the problem as a multi-commodity flow with $M$ modem banks and $P$ packet priorities, including queue dynamics, scheduler weights, and capacity constraints. It proposes an online Model Predictive Control (MPC) framework that uses mean flow forecasts $\hat{F_p}(t)=\mathbb{E}[F_p(t)]$ over a moving horizon $W$ to minimize the cumulative packet-loss cost $\sum_{\tau=t}^{t+W} \sum_{p=1}^P \mathcal{L}_p(\tau) k_p$, while enforcing constraints and allowing rapid adaptation to uncertain inflows. A batch optimization with hindsight serves as the gold standard, enabling direct comparison of performance. Numerical results show that MPC achieves nearly the same performance as the hindsight-optimal batch solution (within about $1.05\%$ of the optimum) and significantly outperforms static or windowless benchmarks, demonstrating the practical viability of online optimization for HTS internal routing and QoS maintenance in dynamic, high-rate environments.

Abstract

High throughput satellites (HTSs) outpace traditional satellites due to their multi-beam transmission. The rise of low Earth orbit mega constellations amplifies HTS data rate demands to terabits/second with acceptable latency. This surge in data rate necessitates multiple modems, often exceeding single device capabilities. Consequently, satellites employ several processors, forming a complex packet-switch network. This can lead to potential internal congestion and challenges in adhering to strict quality of service (QoS) constraints. While significant research exists on constellation-level routing, a literature gap remains on the internal routing within a single HTS. The intricacy of this internal network architecture presents a significant challenge to achieve high data rates. This paper introduces an online optimal flow allocation and scheduling method for HTSs. The problem is presented as a multi-commodity flow instance with different priority data streams. An initial full time horizon model is proposed as a benchmark. We apply a model predictive control (MPC) approach to enable adaptive routing based on current information and the forecast within the prediction time horizon while allowing for deviation of the latter. Importantly, MPC is inherently suited to handle uncertainty in incoming flows. Our approach minimizes the packet loss by optimally and adaptively managing the priority queue schedulers and flow exchanges between satellite processing modules. Central to our method is a routing model focusing on optimal priority scheduling to enhance data rates and maintain QoS. The model's stages are critically evaluated, and results are compared to traditional methods via numerical simulations. Through simulations, our method demonstrates performance nearly on par with the hindsight optimum, showcasing its efficiency and adaptability in addressing satellite communication challenges.

Quality of Service-Constrained Online Routing in High Throughput Satellites

TL;DR

This paper addresses internal routing and load balancing within high-throughput satellites (HTSs) by formulating the problem as a multi-commodity flow with modem banks and packet priorities, including queue dynamics, scheduler weights, and capacity constraints. It proposes an online Model Predictive Control (MPC) framework that uses mean flow forecasts over a moving horizon to minimize the cumulative packet-loss cost , while enforcing constraints and allowing rapid adaptation to uncertain inflows. A batch optimization with hindsight serves as the gold standard, enabling direct comparison of performance. Numerical results show that MPC achieves nearly the same performance as the hindsight-optimal batch solution (within about of the optimum) and significantly outperforms static or windowless benchmarks, demonstrating the practical viability of online optimization for HTS internal routing and QoS maintenance in dynamic, high-rate environments.

Abstract

High throughput satellites (HTSs) outpace traditional satellites due to their multi-beam transmission. The rise of low Earth orbit mega constellations amplifies HTS data rate demands to terabits/second with acceptable latency. This surge in data rate necessitates multiple modems, often exceeding single device capabilities. Consequently, satellites employ several processors, forming a complex packet-switch network. This can lead to potential internal congestion and challenges in adhering to strict quality of service (QoS) constraints. While significant research exists on constellation-level routing, a literature gap remains on the internal routing within a single HTS. The intricacy of this internal network architecture presents a significant challenge to achieve high data rates. This paper introduces an online optimal flow allocation and scheduling method for HTSs. The problem is presented as a multi-commodity flow instance with different priority data streams. An initial full time horizon model is proposed as a benchmark. We apply a model predictive control (MPC) approach to enable adaptive routing based on current information and the forecast within the prediction time horizon while allowing for deviation of the latter. Importantly, MPC is inherently suited to handle uncertainty in incoming flows. Our approach minimizes the packet loss by optimally and adaptively managing the priority queue schedulers and flow exchanges between satellite processing modules. Central to our method is a routing model focusing on optimal priority scheduling to enhance data rates and maintain QoS. The model's stages are critically evaluated, and results are compared to traditional methods via numerical simulations. Through simulations, our method demonstrates performance nearly on par with the hindsight optimum, showcasing its efficiency and adaptability in addressing satellite communication challenges.
Paper Structure (14 sections, 16 equations, 7 figures, 1 algorithm)

This paper contains 14 sections, 16 equations, 7 figures, 1 algorithm.

Figures (7)

  • Figure 1: HTS internal routing model for $M=2$ and $P=2$
  • Figure 2: HTS internal queuing model
  • Figure 3: Incoming flows across time (a) for a single run (b) averaged over 100 Monte-Carlo runs
  • Figure 4: Outgoing flows across time averaged over 100 Monte-Carlo runs
  • Figure 5: Lost packets across time averaged over 100 Monte-Carlo runs
  • ...and 2 more figures