LMCRA: A Reliable Satellite Internet Routing Method with Low Maintenance Cost

The current shortest path-based satellite routing algorithms do not consider the periodicity and persistence of links, resulting in high costs and unreliable maintenance of routing tables. In this regard, we propose a novel approach that leverages the periodicity and predictability of satellite constellation movements to rid repetitive route calculations and associated maintenance overheads across periods. Furthermore, within each period, we design a routing algorithm, named LMCRA (A Low Maintenance Cost and Reliable Routing Algorithm), which takes into account both the persistence and latency of inter-satellite links. Compared to traditional shortest path algorithms, LMCRA reduces the frequency of path switching caused by neighboring satellites moving out of communication range, thereby enhancing path stability, reducing maintenance costs, and maintaining low path latency. Additionally, a fast rerouting mechanism is considered to enhance the reliability of the routing algorithm. Simulation results demonstrate that, across various network configurations, time spans, and constellation densities, LMCRA significantly improves path stability compared to the conventional Dijkstra algorithm, while maintaining low latency costs.