A Partial Scattered Load Balancing Algorithm for LEO Mega-Constellation Networks

Due to the imbalance distribution of the ground traffic demand and the high mobility of the Low Earth Orbit (LEO) satellites, how to balance network load under dynamic topology is a key challenge for LEO communication networks. However, the conventional load balancing strategy mainly relies on colle...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on vehicular technology Ročník 74; číslo 11; s. 18324 - 18328
Hlavní autori: Wang, Siyuan, Zhang, Xingjian, Liao, Chen, Zhang, Yang, Xu, Xiaofan, Xu, Quansheng, Wang, Ye, Zhang, Qinyu, Li, Zhuoming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Communication networks
Convergence
Delays
Directed graph partition
Directed graphs
Graph theory
hop count
LEO mega-constellation networks
Load balancing
Load management
Logic gates
Low earth orbit satellites
Low earth orbits
Orbits
Routing
Satellites
Switches
Topology
ISSN:0018-9545, 1939-9359
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Due to the imbalance distribution of the ground traffic demand and the high mobility of the Low Earth Orbit (LEO) satellites, how to balance network load under dynamic topology is a key challenge for LEO communication networks. However, the conventional load balancing strategy mainly relies on collecting global information and the whole directed graph, which leads to low convergence speed. To enable the fast routing update of load balancing, this paper proposes a partial scattered load balancing (PSLB) algorithm that considers the size of different data flows and reroutes a suitable portion of data flows to new paths, which are calculated by a reduced directed graph. For cutting the directed graph, we jointly consider the relationship between the link load and the number of flows to speed up the routing convergence without excessively shrinking the directed graph, and achieve balance between the increasing of hop count and the amount of rerouted traffic load. PSLB algorithm reduces the load gap among mega constellation networks, which has the lowest convergence time and overall transmission delay compared with other benchmarks.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2025.3577723