Duality-Guided Graph Learning for Real-Time Joint Connectivity and Routing in LEO Mega-Constellations

TL;DR

This paper introduces DeepLaDu, a deep learning framework guided by Lagrangian duality, for real-time joint connectivity and routing management in LEO mega-constellations, significantly improving throughput and computational efficiency.

Contribution

It develops a novel GNN-based approach that directly infers congestion prices for real-time network management, overcoming latency issues of traditional dual optimization methods.

Findings

DeepLaDu achieves up to 20% higher throughput than heuristics.

It matches iterative dual optimization performance with much lower computation time.

The method is scalable and suitable for real-time dynamic LEO network management.

Abstract

Laser inter-satellite links (LISLs) of low Earth orbit (LEO) mega-constellations enable high-capacity backbone connectivity in non-terrestrial networks, but their management is challenged by limited laser communication terminals, mechanical pointing constraints, and rapidly time-varying network topologies. This paper studies the joint problem of LISL connection establishment, traffic routing, and flow-rate allocation under heterogeneous global traffic demand and gateway availability. We formulate the problem as a mixed-integer optimization over large-scale, time-varying constellation graphs and develop a Lagrangian dual decomposition that interprets per-link dual variables as congestion prices coordinating connectivity and routing decisions. To overcome the prohibitive latency of iterative dual updates, we propose DeepLaDu, a Lagrangian duality-guided deep learning framework that trains a graph neural network (GNN) to directly infer per-link (edge-level) congestion prices from the constellation state in a single forward pass. We enable scalable and stable training using a subgradient-based edge-level loss in DeepLaDu. We analyze the convergence and computational complexity of the proposed approach and evaluate it using realistic Starlink-like constellations with optical and traffic constraints. Simulation results show that DeepLaDu achieves up to 20\% higher network throughput than non-joint or heuristic baselines, while matching the performance of iterative dual optimization with orders-of-magnitude lower computation time, suitable for real-time operation in dynamic LEO networks.