Statistical Analysis for Energy-Efficient Satellite Edge Computing with Latency Guarantees
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914552392712192 |
|---|---|
| author | Lyholm, Nicolai Dalsgaard Soret, Beatriz Devaja, Tijana Mulvad, Thomas Grundgaard Stefanovic, Cedomir Leyva-Mayorga, Israel |
| author_facet | Lyholm, Nicolai Dalsgaard Soret, Beatriz Devaja, Tijana Mulvad, Thomas Grundgaard Stefanovic, Cedomir Leyva-Mayorga, Israel |
| contents | Being able to provide latency guarantees for orbital edge computing applications through Low Earth Orbit (LEO) satellite constellations is a major milestone for their integration into 5G and 6G networks. However, achieving this is fundamentally challenged by the inherent randomness in both communication and computing latency, driven by complex network dynamics, satellite motion, and hardware variability. In this paper, we perform a statistical analysis of the latency of satellite edge computing using representative computing hardware and an object detection algorithm running on a satellite image dataset. The resulting model captures the trade-off between data availability and estimation uncertainty, enabling data-driven optimization methods to meet latency targets with statistical guarantees while minimizing energy consumption. Our results show that parametric estimation and quantile regression for the execution time of the image processing algorithms can be effectively combined with models for the communication latency to select an optimal GPU clock frequency. This achieves a 95% probability of meeting a $500$ ms end-to-end deadline while reducing energy consumption by more than 50% compared to a baseline that relies on a Chebyshev-Cantelli inequality to bound execution-time quantiles. The proposed framework is generalizable across satellite edge computing workloads and hardware platforms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_10215 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Statistical Analysis for Energy-Efficient Satellite Edge Computing with Latency Guarantees Lyholm, Nicolai Dalsgaard Soret, Beatriz Devaja, Tijana Mulvad, Thomas Grundgaard Stefanovic, Cedomir Leyva-Mayorga, Israel Networking and Internet Architecture Being able to provide latency guarantees for orbital edge computing applications through Low Earth Orbit (LEO) satellite constellations is a major milestone for their integration into 5G and 6G networks. However, achieving this is fundamentally challenged by the inherent randomness in both communication and computing latency, driven by complex network dynamics, satellite motion, and hardware variability. In this paper, we perform a statistical analysis of the latency of satellite edge computing using representative computing hardware and an object detection algorithm running on a satellite image dataset. The resulting model captures the trade-off between data availability and estimation uncertainty, enabling data-driven optimization methods to meet latency targets with statistical guarantees while minimizing energy consumption. Our results show that parametric estimation and quantile regression for the execution time of the image processing algorithms can be effectively combined with models for the communication latency to select an optimal GPU clock frequency. This achieves a 95% probability of meeting a $500$ ms end-to-end deadline while reducing energy consumption by more than 50% compared to a baseline that relies on a Chebyshev-Cantelli inequality to bound execution-time quantiles. The proposed framework is generalizable across satellite edge computing workloads and hardware platforms. |
| title | Statistical Analysis for Energy-Efficient Satellite Edge Computing with Latency Guarantees |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2605.10215 |