A convex-relaxation plus integer-programming method reduces network diameter to 12 in 1500-satellite Walker-Delta constellations, yielding end-to-end delays under 90 ms.
A data- driven parallel adaptive large neighborhood search algorithm for a large- scale inter-satellite link scheduling problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inter-Satellite Link Optimization for Low-Latency Global Networking
A convex-relaxation plus integer-programming method reduces network diameter to 12 in 1500-satellite Walker-Delta constellations, yielding end-to-end delays under 90 ms.