The real-time routing for satellite communication of the mega-constellations is being challenged due to the large-scale of network nodes, especially on devices with limited computation such as onboard embedded systems. In this paper, a fast routing method is proposed for mega-constellation backbone networks. Firstly, inspired by the regularity and sparse characteristics of mega-constellations, the 4-degree percolation theory is proposed to describe the node search process. Then, dynamic minimum search and mapping methods are used to narrow down the traversal range. The proposed method performs as well as the heap-optimized Dijkstra algorithm with less memory space and dynamic access. The experimental results show that the method proposed in this paper can significantly reduce routing computation time, especially on the onboard, edge-computing or other computation-limited devices.

翻译：针对超大规模星座的卫星通信实时路由问题，由于网络节点规模庞大，尤其是在星载嵌入式系统等计算受限设备上，传统方法面临严峻挑战。本文提出一种适用于巨型星座骨干网的快速路由方法。首先，受巨型星座规则性与稀疏特性的启发，提出四度渗流理论描述节点搜索过程；进而采用动态最小搜索与映射方法缩小遍历范围。该方法在占用更少内存空间与动态访问次数的前提下，性能与堆优化迪杰斯特拉算法相当。实验结果表明，本文方法能显著缩短路由计算时间，尤其适用于星载、边缘计算及其他计算受限设备。