2020
DOI: 10.1109/access.2020.3017615
|View full text |Cite
|
Sign up to set email alerts
|

A Load Balancing Routing Strategy for LEO Satellite Network

Abstract: The LEO network composed of massive satellite nodes is a hot research field at present. In such a network, the problem of load balancing should be reconsidered due to the large number of satellite nodes, the frequently changing topology, and the uneven distribution of global ground users. To solve such problem, a selective iterative Dijkstra algorithm (SIDA) is proposed to optimize the path finding process by reducing the reuse frequency of nodes. On the basis of SIDA, a selective split load balancing strategy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(17 citation statements)
references
References 11 publications
0
16
0
Order By: Relevance
“…proposed a load balancing routing scheme by hybrid-traffic-detour [ 24 ]. They calculated and designed the shortest path and a long-distance traffic detour path to forward packets and determine which path to use for forwarding to against link congestion [ 25 ]. The scheme tried to avoid a situation in which the routing path between a node and its neighbors were directed toward the same destination node.…”
Section: Related Workmentioning
confidence: 99%
“…proposed a load balancing routing scheme by hybrid-traffic-detour [ 24 ]. They calculated and designed the shortest path and a long-distance traffic detour path to forward packets and determine which path to use for forwarding to against link congestion [ 25 ]. The scheme tried to avoid a situation in which the routing path between a node and its neighbors were directed toward the same destination node.…”
Section: Related Workmentioning
confidence: 99%
“…In TLR, the ISL congestion is predicted to re-calculate routing. Another proactive distributed routing method is the selective split load balancing strategy (SSLB) [ 26 ], in which the traffic flow of congestion nodes is diverted to neighboring nodes. However, all ISLs are assumed to have equal length, it can hardly reflect the time-varying feature of propagation delay in real satellite networks.…”
Section: Related Workmentioning
confidence: 99%
“…Meanwhile, packet delay, throughput and packet drop rate are adopted as the performance metrics. In the experiments, the proposed TSR algorithm is compared with the Dijkstra Shortest-Path (DSP) [ 23 ], Traffic-Light-based Routing (TLR) [ 25 ], Netgrid-based Shortest path Routing (NSR) [ 21 ] and Selective Split Load Balancing routing Strategy (SSLB) [ 26 ]. Specifically, DSP adopts the gathered global propagation delay to find the optimal routing path, TLR is a load balancing routing scheme, which considers local route adjustment, NSR utilizes static cubes to find the shortest distance path, and SSLB is a distributed strategy, which diverts the traffic flow of congestion nodes to neighboring nodes.…”
Section: Simulation and Analysismentioning
confidence: 99%
“…These multiple paths cause route oscillations, generated by the memoryless nature of the Dijkstra's algorithm. The proposed algorithm stores some candidates for the next hop from the previously generated routing table . Liu et al [27] propose a selective iterative Dijkstra algorithm, which changes the order in which nodes are traversed (as in classic Dijkstra's), so that the load in the network is distributed fairly. Then, to reduce congestion, the authors propose Selective Shunt Load Balancing (SSLB), which is a distributed congestion control algorithm, using the traffic flow as an estimate of congestion in a part of the network.…”
Section: Related Workmentioning
confidence: 99%