ASER: Scalable Distributed Routing Protocol for LEO Satellite Networks

Abstract

Low earth orbit (LEO) satellite networks are promising at constructing the satellite Internet. Dynamics of a large-scale LEO network topology induces critical problems on routing efficiency and scalability. Existing approaches either suffer from such routing problems, or have limited resilience against unpredictable link/node failures. We propose Area-based SatellitE Routing (ASER), a fully distributed routing protocol for LEO networks with high efficiency and scalability. ASER uses a hierarchical routing mechanism, which groups satellites into areas, in such a way that the inter-area routing never changes due to handovers of inter-satellite links. Routing can be quickly reconstructed with little overhead when either regular or unpredictable topology changes occur. We develop ASER based on OSPF, and propose an efficient algorithm to construct the forwarding table, enabling standard packet forwarding. Simulations validate that ASER can reduce the convergence time by more than 50%, and reduce computation and control overhead by orders of magnitude.3 Parameter θ in Fig. 1 and Fig. 2 means the half apex angle of the cone which is the reachable range of a satellite antenna.

A Local Pre-Rerouting Algorithm to Combat Sun Outage for Inter-Satellite Links in Low Earth Orbit Satellite Networks

“…The ASER (area-based satellite routing) algorithm [9] adopts a distributed domainbased routing mechanism. Only a few intra-domain routing tables need to be updated for most topology changes, while the inter-domain routing table is updated only when interdomain neighbor relationships change.…”

INTERLINK: A Digital Twin-Assisted Storage Strategy for Satellite-Terrestrial Networks

“…Pan et al [27] proposed the shortest path first routing of path prediction. Zhang et al [28] presented a region-based hierarchical routing to reduce routing overhead. Lowe et al [29] proposed a routing strategy named Spae to achieve efficient data routing in a store-carry-forward fashion.…”

“…Finally, we conclude this paper and highlight further directions of research in Section VI. For convenience, [20] receiving signal strength, remaining service time, satellites' idle channels [16] real-time handover trace angle, service time [21] graph-based path finding elevation angle, the number of free channels [24] user-centric handover satellite cluster, the length of handover window [25] MARL-based handover elevation angle, service state, channel budget [23] SDSN potential game-based handover bipartite graph, available channels, userspace reducing call blocking probability [17] STN Doppler-based prioritization doppler shift, terminals' geometric characteristics [22] channel assignment available channels, mission priority handover scenario analysis [18] common coverage area based handover service time, distance, number of idle channels [19] satellite network cross-layer handover instantaneous elevation angle, handover rate inter-satellite routing improving routing adaptability [26] satellite network ISL state information based routing logical topology, satellite link state information, actual location information, delay reducing routing overhead [27] memory-efficient routing location prediction, network recovery, flooding [28] area-based hierarchical routing satellite grouping, handover region size, neighbor avoiding data overcommitment [29] network-layer routing the information about the schedule of future contacts between network nodes, satellite motion routing arrival [31] evolving graph link connectivity prediction, the earliest path balancing delay and bandwidth [32] bandwidth-delay satellite routing delay, bandwidth, weight factor of satellite links optimizing throughput [33] network coding based multipath cooperative routing network coding, ACK, packet batch size, transmission times ensuring transmission QoS [34] storage time aggregated graph flow-maximizing, the shortest path saving energy consumption [36] set of power model link cost, recharge/discharge cycle number [37] DRL the acronyms of this paper are listed in Table I.…”

Distributed Probabilistic Congestion Control in LEO Satellite Networks

“…Changes in the traffic load are handled by an adaptive congestion threshold setting mechanism, similar to the proposed congestion control algorithm. Zhang et al [29] propose an Area-based Satellite Routing algorithm, which is a distributed routing protocol dividing the LEO network into areas, and thus segregating the routing decisions into inter-area routing and intra-area routing. It uses the link state protocol to update the division of the network into areas so as to minimize handover and link failure losses.…”