.png){kind=icon}
.png){kind=icon}
Return
A distributed congestion avoidance routing algorithm in mega-constellation network with multi-gateway
.png){kind=icon}
PRE
AI
DOI：10.1016/j.actaastro.2019.05.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently several large-scale constellation networks have been proposed, requiring inter-satellite links and multiple gateways to be equipped. The gateway assignment and traffic congestion avoidance issues are of fundamental importance for the network. In this work, we establish the network model for mega-constellation network with multi-gateway by introducing the concept of satellite router and satellite gateway. We propose a distributed routing algorithm consisting of three processes: 1) Gateway assignment; 2) Path candidate region partitioning and 3) Optimal path generation. In Optimal path generation, Longer Side Priority (LSP) strategy is proposed, aiming at maximizing the path searching space. By solving the path survival problem, LSP strategy is proved to perform better in congestion avoidance. Through simulation, we verify the routing algorithm and find the significant effects of seam movement in network performance. Results suggest that the proposed strategy performs better in load balance and congestion avoidance compared with the minimum delay strategy.
Keywords:
Load balancing
Mega-constellation network
Routing
Congestion avoidance
Multiple gateways
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.1W
Citations:
2.1W