STARVERI: Efficient and Accurate Verification for Risk-Avoidance Routing in Leo Satellite Networks

Emerging satellite Internet constellations such as SpaceX's Starlink will deploy thousands of broadband satellites and construct Low-Earth Orbit (LEO) satellite networks (LSNs) in space, significantly expanding the boundaries of today's terrestrial Internet. However, due to the unique global LEO dynamics, satellite routers will inevitably pass through uncontrolled areas, suffering from security threats. It should be important for satellite network operators (SNOs) to enable verifiable riskavoidance routing to identify path anomalies. In this paper, we present STARVERI, a novel network path verification framework tailored for emerging LSNs. STARVERI addresses the limitations of existing crypto-based and delay-based verification approaches and accomplishes efficient and accurate path verification by: (i) adopting a dynamic relay selection mechanism deployed in SNO's operation center to judiciously select verifiable relays for each communication pair over LSNs; and (ii) incorporating a lightweight path verification algorithm to dynamically verify each segment path split by distributed relays. We build an LSN simulator based on real constellation information and the results demonstrate that STARVERI can significantly improve the path verification accuracy and achieve lower router overhead compared with existing approaches.

Authors

Institutions

Publication Details

Published
2024-10-28
DOI
https://doi.org/10.1109/icnp61940.2024.10858518
Citations
2
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
2.60
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

STARVERI: Efficient and Accurate Verification for Risk-Avoidance Routing in Leo Satellite Networks

Hewu Li, Chenwei Gu, Qian Wu, Zeqi Lai et al.
2 citations
Satellite Communication Systems
2.60
article

STARVERI: Efficient and Accurate Verification for Risk-Avoidance Routing in Leo Satellite Networks

Hewu Li, Chenwei Gu, Qian Wu, Zeqi Lai, Jihao Li, Weisen Liu, Jun Liu, Qi Zhang, Yuanjie Li
article en
2 citations

Abstract

Emerging satellite Internet constellations such as SpaceX's Starlink will deploy thousands of broadband satellites and construct Low-Earth Orbit (LEO) satellite networks (LSNs) in space, significantly expanding the boundaries of today's terrestrial Internet. However, due to the unique global LEO dynamics, satellite routers will inevitably pass through uncontrolled areas, suffering from security threats. It should be important for satellite network operators (SNOs) to enable verifiable riskavoidance routing to identify path anomalies. In this paper, we present STARVERI, a novel network path verification framework tailored for emerging LSNs. STARVERI addresses the limitations of existing crypto-based and delay-based verification approaches and accomplishes efficient and accurate path verification by: (i) adopting a dynamic relay selection mechanism deployed in SNO's operation center to judiciously select verifiable relays for each communication pair over LSNs; and (ii) incorporating a lightweight path verification algorithm to dynamically verify each segment path split by distributed relays. We build an LSN simulator based on real constellation information and the results demonstrate that STARVERI can significantly improve the path verification accuracy and achieve lower router overhead compared with existing approaches.

Tsinghua University (CN)
Climate action
Openalex Percentile: Top 7%
Satellite Communication Systems
2.60
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.