TY - GEN
T1 - Adaptive Parallel SFC Joint Scheduling for Time-Varying Satellite-Terrestrial Integration Networks
AU - Zhang, Ying
AU - Wo, Tianyu
AU - Yang, Penglin
AU - Kawasa, Fortunatus
AU - Fu, Xingchen
AU - Feng, Xiao
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - The increasing demand for ultra-low-latency services in satellite-terrestrial integrated networks (STINs) necessitates adaptive resource orchestration to meet stringent QoS requirements under dynamic network conditions. While Network Function Virtualization (NFV) and Service Function Chaining (SFC) offer flexibility, existing approaches primarily focus on static scenarios and fail to adapt to time-varying topology and inter-SFC resource competition in STIN. To address these limitations, we propose an adaptive parallel SFC scheduling framework that optimizes real-time SFC offloading and virtual network function aggregation to minimize end-to-end latency. We formulate the problem as a Mixed-Integer Nonlinear Programming model that jointly optimizes computation offloading, node selection, and link mapping under dynamic network constraints. To avoid the local optimal solution, the proposed framework efficiently estimates and mitigates the global costs caused by offloading and transmission link conflicts. Extensive experimental results demonstrate that our approach reduces the average end-to-end latency by 28.37% compared to state-of-the-art methods under high task density.
AB - The increasing demand for ultra-low-latency services in satellite-terrestrial integrated networks (STINs) necessitates adaptive resource orchestration to meet stringent QoS requirements under dynamic network conditions. While Network Function Virtualization (NFV) and Service Function Chaining (SFC) offer flexibility, existing approaches primarily focus on static scenarios and fail to adapt to time-varying topology and inter-SFC resource competition in STIN. To address these limitations, we propose an adaptive parallel SFC scheduling framework that optimizes real-time SFC offloading and virtual network function aggregation to minimize end-to-end latency. We formulate the problem as a Mixed-Integer Nonlinear Programming model that jointly optimizes computation offloading, node selection, and link mapping under dynamic network constraints. To avoid the local optimal solution, the proposed framework efficiently estimates and mitigates the global costs caused by offloading and transmission link conflicts. Extensive experimental results demonstrate that our approach reduces the average end-to-end latency by 28.37% compared to state-of-the-art methods under high task density.
KW - Satellite-Terrestrial Integration Networks
KW - Service Function Chains
KW - Time-Varying Scheduling
UR - https://www.scopus.com/pages/publications/105036336048
U2 - 10.1109/GLOBECOM59602.2025.11432317
DO - 10.1109/GLOBECOM59602.2025.11432317
M3 - 会议稿件
AN - SCOPUS:105036336048
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 4619
EP - 4624
BT - GLOBECOM 2025 - 2025 IEEE Global Communications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE Global Communications Conference, GLOBECOM 2025
Y2 - 8 December 2025 through 12 December 2025
ER -