论文标题
狮子座巨型构造的按需分布式路由：Starlink案例研究
Distributed On-Demand Routing for LEO Mega-Constellations: A Starlink Case Study
论文作者
论文摘要
大规模卫星网络的设计和启动创造了对高效和延迟最少路由方法的迫在眉睫的需求。随着此类星座中卫星数量的增加，由于空间和时间限制，预先计算所有卫星之间的所有最短路线变得越来越不可行。即使为特定的LEO卫星网络配置开发了分布式的按需路由方法，但它们并不适用于越来越流行的基于Walker Delta编队的大型巨型构造。 本文的贡献是双重的。首先，我们介绍了一个正式的模型，该模型可以数学上捕获Walker Delta星座中卫星的时间不断变化的位置，并使用它来建立一个公式来计算两个给定卫星之间的最小数量ISL啤酒花。在第二部分中，我们提出了一种基于啤酒花型的路由算法，该算法近似于最佳路径，同时与经典的最短路径算法（如Dijkstra）相比，达到了卓越的性能。
The design and launch of large-scale satellite networks create an imminent demand for efficient and delay-minimising routing methods. With the rising number of satellites in such constellations, pre-computing all shortest routes between all satellites and for all times becomes more and more infeasible due to space and time limitations. Even though distributed on-demand routing methods were developed for specific LEO satellite network configurations, they are not suited for increasingly popular mega-constellations based on Walker Delta formations. The contributions of this paper are twofold. First, we introduce a formal model that mathematically captures the time-evolving locations of satellites in a Walker Delta constellation and use it to establish a formula to compute the minimum number of ISL hops between two given satellites. In the second part, we present an on-demand hop-count-based routing algorithm that approximates the optimal path while achieving superior performance compared to classical shortest-path algorithms like Dijkstra.
