INNER: interface-aware neighborhood routing in large-scale low-Earth-orbit satellite networks
Varghese, Evan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/129624
Description
Title
INNER: interface-aware neighborhood routing in large-scale low-Earth-orbit satellite networks
Author(s)
Varghese, Evan
Issue Date
2025-05-05
Director of Research (if dissertation) or Advisor (if thesis)
Gupta, Indranil
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
satellite routing
low-Earth-orbit satellite networking
routing algorithms
Abstract
The development of large-scale Low-Earth-Orbit satellite constellations for broadband internet (LEO-NETs) suggests a new kind of internet backbone, built out of a flat network of satellites instead of a hierarchical, highly-provisioned network of core routers. Much current research focuses on how the mobility of the satellite network leads to unreliability. As opposed to current research, this thesis will focus instead on the implicit characteristics of LEO-NET topology design and how mobility affects congestion as well as reliability.
Using this evidence, we design Interface-Aware Neighborhood Routing (INNER), a novel routing algorithm that takes advantage of the characteristics of a typical LEO-NET topology and properties of how congestion emerges in a LEO-NET. By utilizing the limited branching factor of satellite networks and the unique properties of long-term congestion in the network, INNER can estimate propagation delay and queuing delay to select a low-delay path without requiring excessive communication between neighbors. We additionally prove that INNER is loop-free without requiring additional memory overhead.
Finally, we experimentally evaluate INNER and find that it is competitive with existing research baselines despite requiring less inter-node communication and permitting greater generalizability.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
