Service Function Chain Migration in LEO Satellite Networks

With the advancements of software defined network (SDN) and network function virtualization (NFV), service function chain (SFC) placement becomes a crucial enabler for flexible resource scheduling in low earth orbit (LEO) satellite networks. While due to the scarcity of bandwidth resources and dynam...

Full description

Saved in:
Bibliographic Details
Published in:China communications 2024-03, Vol.21 (3), p.247-259
Main Authors: Yuhui, Geng, Niwei, Wang, Xi, Chen, Xiaofan, Xu, Changsheng, Zhou, Junyi, Yang, Zhenyu, Xiao, Xianbin, Cao
Format: Article
Language:English
Subjects:
Bandwidth
Costs
Heuristic algorithms
Low earth orbit satellites
network function virtualization (NFV)
Quality of service
resource allocation
satellite networks
Satellites
service function chain (SFC)
SFC migration
SFC placement
software defined network (SDN)
Topology
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the advancements of software defined network (SDN) and network function virtualization (NFV), service function chain (SFC) placement becomes a crucial enabler for flexible resource scheduling in low earth orbit (LEO) satellite networks. While due to the scarcity of bandwidth resources and dynamic topology of LEO satellites, the static SFC placement schemes may cause performance degradation, resource waste and even service failure. In this paper, we consider migration and establish an online migration model, especially considering the dynamic topology. Given the scarcity of bandwidth resources, the model aims to maximize the total number of accepted SFCs while incurring as little bandwidth cost of SFC transmission and migration as possible. Due to its NP-hardness, we propose a heuristic minimized dynamic SFC migration (MDSM) algorithm that only triggers the migration procedure when new SFCs are rejected. Simulation results demonstrate that MDSM achieves a performance close to the upper bound with lower complexity.
ISSN:1673-5447
DOI:10.23919/JCC.fa.2023-0459.202403