Characterizing lowest-delay paths in low earth orbit satellite networks

Modern networks of Low Earth Orbit (LEO) satellites promise to offer low-latency connectivity between any pair of devices on Earth. However, as the length of inter-satellite links constantly changes, the lowest-delay paths between satellites change over time even if the network topology does not. In this paper, we characterize the lowest-delay paths in LEO satellite networks whose topologies are lattice graphs. We show how the shape of these paths can be determined by knowing the satellites’ orbits, their movement direction and the topological positions of source and destination satellites. Our characterization has the potential to inspire several practical applications, including fast, resource-efficient routing algorithms and protocols.

Authors

Institutions

Publication Details

Journal
Theoretical Computer Science
Published
2026-03-05
DOI
https://doi.org/10.1016/j.tcs.2026.115859
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Characterizing lowest-delay paths in low earth orbit satellite networks

Stefano Vissicchio, Mark Handley
Theoretical Computer Science
Satellite Communication Systems
article

Characterizing lowest-delay paths in low earth orbit satellite networks

Stefano Vissicchio, Mark Handley
article en

Abstract

Modern networks of Low Earth Orbit (LEO) satellites promise to offer low-latency connectivity between any pair of devices on Earth. However, as the length of inter-satellite links constantly changes, the lowest-delay paths between satellites change over time even if the network topology does not. In this paper, we characterize the lowest-delay paths in LEO satellite networks whose topologies are lattice graphs. We show how the shape of these paths can be determined by knowing the satellites’ orbits, their movement direction and the topological positions of source and destination satellites. Our characterization has the potential to inspire several practical applications, including fast, resource-efficient routing algorithms and protocols.

Theoretical Computer ScienceVol. 1072
University College London (GB)
Climate action
Openalex Percentile: Top 35%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.