Adaptive Service Function Chain Migration in Satellite–Terrestrial Integrated Networks

In satellite-terrestrial integrated networks (STINs), dynamically migrating service function chains (SFCs) across heterogeneous nodes is essential to maintain quality of service under changing link and node conditions. Conventional heuristics or static optimization either incur excessive migration overhead or fail to adapt to network volatility. In this paper, we propose DWAR (Dynamic Weighting–based Adaptive Reinforcement), a Proximal Policy Optimization (PPO)–driven framework that incorporates a self-attention module to dynamically adjust multi-objective reward weights—covering end-to-end delay, migration cost, energy consumption, and load balancing—based on real-time network state. We evaluate DWAR against four baselines (ILP-based SOLVER, MSDF, PAVM, and GREEDY) in a 1000-node STIN simulator under four stress scenarios: baseline, link degradation, node overload, and traffic burst. Results show that DWAR achieves 90–95% of the optimal SOLVER delay while reducing migration cost and energy by 15–20%, and maintaining robust load balance across all scenarios. These findings demonstrate DWAR’s practical efficacy for real-time SFC management in dynamic, large-scale STINs.

Authors

Institutions

Publication Details

Published
2025-08-10
DOI
https://doi.org/10.1109/iccc65529.2025.11148775
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Service Function Chain Migration in Satellite–Terrestrial Integrated Networks

Jin Zhao, Ya-Ru Zhang
Satellite Communication Systems
article

Adaptive Service Function Chain Migration in Satellite–Terrestrial Integrated Networks

Jin Zhao, Ya-Ru Zhang
article en

Abstract

In satellite-terrestrial integrated networks (STINs), dynamically migrating service function chains (SFCs) across heterogeneous nodes is essential to maintain quality of service under changing link and node conditions. Conventional heuristics or static optimization either incur excessive migration overhead or fail to adapt to network volatility. In this paper, we propose DWAR (Dynamic Weighting–based Adaptive Reinforcement), a Proximal Policy Optimization (PPO)–driven framework that incorporates a self-attention module to dynamically adjust multi-objective reward weights—covering end-to-end delay, migration cost, energy consumption, and load balancing—based on real-time network state. We evaluate DWAR against four baselines (ILP-based SOLVER, MSDF, PAVM, and GREEDY) in a 1000-node STIN simulator under four stress scenarios: baseline, link degradation, node overload, and traffic burst. Results show that DWAR achieves 90–95% of the optimal SOLVER delay while reducing migration cost and energy by 15–20%, and maintaining robust load balance across all scenarios. These findings demonstrate DWAR’s practical efficacy for real-time SFC management in dynamic, large-scale STINs.

Fudan University (CN)
Openalex Percentile: Top 67%
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.