Iterative Region-Based Probabilistic Forwarding Algorithm for Traffic Engineering in LEO Satellite Networks

The rapid development of satellite communication technologies has significantly enhanced global connectivity, with Low Earth Orbit (LEO) satellite networks playing a crucial role. However, the high-speed movement of LEO satellites introduces dynamic and unstable network topologies, presenting challenges in routing and traffic engineering. Traditional routing algorithms, such as Dijkstra’s, often struggle to adapt to these dynamic conditions, leading to inefficiencies in load balancing and resource utilization. In response, this paper proposes an Iterative Region-Based Probabilistic Forwarding (IRPF) strategy within a Software-Defined Satellite Networking (SDSN) framework. Our strategy dynamically assigns forwarding probabilities to satellite ports based on link traffic weights, optimizing routing paths through a feedback iteration process. To prevent the algorithm from converging to local optima, we introduce a local adjustment mechanism that fine-tunes forwarding probabilities. The experimental results show that when the scale of the satellite network is relatively small, the IRPF strategy incurs lower total link traffic costs compared to the Dijkstra algorithm. Additionally, it improves the Gini coefficient and packet loss rate by approximately 20% and 30%, respectively. These results demonstrate the effectiveness and stability of this method in routing and traffic engineering.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/hpcc64274.2024.00134
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Iterative Region-Based Probabilistic Forwarding Algorithm for Traffic Engineering in LEO Satellite Networks

Chenxin Wang, Yan Dong, Bo Ouyang, Bin Zhou et al.
1 links
Satellite Communication Systems
article

Iterative Region-Based Probabilistic Forwarding Algorithm for Traffic Engineering in LEO Satellite Networks

Chenxin Wang, Yan Dong, Bo Ouyang, Bin Zhou, Rui Cai
article en

Abstract

The rapid development of satellite communication technologies has significantly enhanced global connectivity, with Low Earth Orbit (LEO) satellite networks playing a crucial role. However, the high-speed movement of LEO satellites introduces dynamic and unstable network topologies, presenting challenges in routing and traffic engineering. Traditional routing algorithms, such as Dijkstra’s, often struggle to adapt to these dynamic conditions, leading to inefficiencies in load balancing and resource utilization. In response, this paper proposes an Iterative Region-Based Probabilistic Forwarding (IRPF) strategy within a Software-Defined Satellite Networking (SDSN) framework. Our strategy dynamically assigns forwarding probabilities to satellite ports based on link traffic weights, optimizing routing paths through a feedback iteration process. To prevent the algorithm from converging to local optima, we introduce a local adjustment mechanism that fine-tunes forwarding probabilities. The experimental results show that when the scale of the satellite network is relatively small, the IRPF strategy incurs lower total link traffic costs compared to the Dijkstra algorithm. Additionally, it improves the Gini coefficient and packet loss rate by approximately 20% and 30%, respectively. These results demonstrate the effectiveness and stability of this method in routing and traffic engineering.

Huazhong University of Science and Technology (CN)
Research and Development
Openalex Percentile: Top 48%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.