Results indicate that effectiveness emerges from the iterative feedback-driven process enabled by LARGE, highlighting the potential of framework-driven LLM-in-the-loop optimization for RL-based routing in dynamic satellite networks.
Abstract
Routing in Low Earth Orbit (LEO) satellite networks is challenging due to highly dynamic topologies and spatio-temporal network conditions. Reinforcement Learning (RL) has emerged as a promising approach for adaptive routing; however, its performance critically depends on reward function design, which must balance objectives such as goodput and end-to-end delay. In practice, reward design remains a complex manual process requiring significant domain expertise and extensive trial-and-error. Recent works have explored Large Language Models (LLMs) for automated reward design, but their application to highly dynamic systems such as LEO satellite networks remains largely unexplored. We propose LARGE, a framework that automates reward design for RL-based routing by combining LLM- driven generation with iterative simulator-in-the-loop evaluation. LARGE generates an initial reward from LLM prior knowledge and iteratively refines it using simulation feedback. This loop enables exploration of diverse reward formulations while aligning them with network objectives. Results show that LARGE improves reward quality within a few iterations through feedback-driven refinement. Across different backbones, the framework achieves performance comparable to an expert-designed baseline, with the best-performing configuration reaching goodput within approximately 3% of the baseline and slightly lower end-to-end delay, without manual reward engineering. These results indicate that effectiveness emerges from the iterative feedback-driven process enabled by LARGE, highlighting the potential of framework-driven LLM-in-the-loop optimization for RL-based routing in dynamic satellite networks.
This paper introduces Effective Congestion (EC), a deadline-aware metric family that quantifies interface congestion by packet urgency and proactively filters non-viable traffic, coupled with a Uniform Path Grouping (UPG) distribution heuristic promoting robust load-balancing; the resulting policies are embedded into M...
V. N. Vitale, Mohammad Solki, A. Tulino et al.· 0 citations
Low Earth orbit (LEO) satellite systems are expected to deliver ubiquitous broadband connectivity, but their dynamic topology and limited on-board resources challenge beam hopping (BH) scheduling and inter-satellite load balancing. This paper proposes a multi-satellite cooperative BH algorithm based on multi-agent flow...
Sheng-Tong Xie, Cheng Wang, Gao-Feng Cui et al.· International Symposium on N...· 0 citations
Timely and cost-efficient data transfers in large-scale networks remain challenging due to diverse topologies, non-uniform pricing models, and variable traffic demands. Existing literature often relies on multi-objective optimization, employing heuristic methods to reduce computational complexity; however, these approa...
Bita Fatemipour, Zhe Zhang, Marc St-Hilaire· IEEE Transactions on Network...· 0 citations
This paper fuses deterministic inter-domain planning with DRL-based intra-domain forwarding in a single hierarchical framework and develops a greedy–beam–Dijkstra fallback ladder that guarantees reachability whenever the subgraph stays connected.
Yue-Hao Zhuo, Yi Ren, Yun-Xiang Zhang et al.· Applied Sciences· 0 citations
Low Earth orbit (LEO) satellite networks constitute a critical space-segment infrastructure for integrated space-aerial-terrestrial networks, where autonomous and reliable control is essential for mission-critical service orchestration. To support scalable space-layer control, LEO satellite networks require dynamic dom...
The proposed hierarchical multi-agent proximal policy optimization framework can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
Li-Jing Liu, James M. Shihua, Qi-Yu Yan et al.· MATEC Web of Conferences· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.