Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

Ziye Jia, Yilu Cao, Lijun He, Guangxia Li, Fuhui Zhou, Qihui Wu, Zhu Han

TL;DR

The paper addresses robust service recovery for NFV-enabled SAGIN under dynamic resource failures by introducing a reconfigurable time expansion graph (RTEG) to discretize the problem and a two-sided matching-game algorithm (FRMG-SAGIN) for rapid SFC redeployment. It formulates the SFC deployment under resource constraints as an NP-hard ILP and then derives a practical recovery method based on stable matching between SFCs and available nodes, achieving significant time reductions. The approach is validated through simulations showing about 25% improvement in total deployment time over benchmark methods, highlighting its potential for reliable, low-latency SAGIN operations in the presence of failures. The work advances SAGIN resilience by integrating NFV, SFC concepts, and game-theoretic recovery, with implications for scalable and robust 6G-era networks.

Abstract

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods.

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

TL;DR

The paper addresses robust service recovery for NFV-enabled SAGIN under dynamic resource failures by introducing a reconfigurable time expansion graph (RTEG) to discretize the problem and a two-sided matching-game algorithm (FRMG-SAGIN) for rapid SFC redeployment. It formulates the SFC deployment under resource constraints as an NP-hard ILP and then derives a practical recovery method based on stable matching between SFCs and available nodes, achieving significant time reductions. The approach is validated through simulations showing about 25% improvement in total deployment time over benchmark methods, highlighting its potential for reliable, low-latency SAGIN operations in the presence of failures. The work advances SAGIN resilience by integrating NFV, SFC concepts, and game-theoretic recovery, with implications for scalable and robust 6G-era networks.

Abstract

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods.

Paper Structure

This paper contains 25 sections, 29 equations, 9 figures, 3 tables, 3 algorithms.

Table of Contents

  1. Introduction
  2. Related Work
  3. System Model
  4. Network Model
  5. Channel Model
  6. Channel Model of G2U, U2G, U2U, and S2G
  7. Channel Model of U2S and S2S
  8. Energy Model
  9. Energy Cost of UAV
  10. Energy Cost of Satellite
  11. Problem Formulation
  12. Constraints
  13. SFC Deployment Constraints
  14. Resource Constraints
  15. Formulation
  16. ...and 10 more sections

Figures (9)

  • Figure 1: Scenario of SFC deployments in SAGIN.
  • Figure 2: SFC redeployment with failing nodes and links. (a) SFC deployments in SAGIN before resource failure. (b) SFC re-deployments corresponding to (a).
  • Figure 3: The flow diagram of SFC redeployment.
  • Figure 4: The time consumption with different numbers of UAVs.
  • Figure 5: Maximum completion time for an SFC under different numbers of failed nodes.
  • ...and 4 more figures