Matching Game Based Robust Service Recovery in Space-Air-Ground Integrated Network

As an important issue in the sixth generation communication technologies, the space-air-ground integrated network (SAG IN), mainly composed of satellites, unmanned aerial vehicles (UAVs), and ground stations, can provide global information services. However, it is challenging to provide robust services due to the dynamic characteristics of UAV s and satellites, as well as the resource incompatibility among different nodes. By introducing the network function virtualization technique to SAGIN, tasks can be converted into service function chains (SFCs) composed of multiple virtual network functions in series, and the resource allocation of SAGIN is deemed as the SFC deployment and scheduling. However, the node failure or link disconnections may occur in SAG IN, resulting in failures of SFC implementation. Hence, how to guarantee the robust service recovery of SFCs is challenging. In this paper, we propose the SFC deployment and recovery model to cope with the resource failure. The problem is formulated to minimize the total time consumption to complete the SFC deployment and recovery. Since the problem is an integer linear programming and intractable to solve, we propose an algorithm based on two-sided matching game to implement robust recovery of affected SFCs. Finally, simulation results verify the effectiveness and advantages of the proposed algorithm over other benchmark algorithms.