Orchestrating Security Protection Resource for Space-Ground Integrated Networks

The space-ground integrated networks (SGIN) is vulnerable to complex and evolving threats due to its open nature. However, the dynamic topology and limited resources of SGIN present significant challenges for security resource orchestration. Most existing studies focus on network function orchestration and resource allocation for service flows, overlooking the offensive and defensive characteristics of security resource orchestration. Moreover, they fail to adequately address the difficulties posed by the dynamic topology of SGIN. To address these gaps, we utilize a virtual node method and network structure characteristics to transform the dynamic network topology into a static scale-free network. The orchestration strategy generation problem is then modeled as a minimum spanning tree truncation game on the network. Given the NP-hard nature of the problem, we propose the OSG algorithm based on Benders decomposition to solve it. To further improve the OSG algorithm’s efficiency, we introduce an initial value algorithm and four cutting plane inequalities, culminating in the AOSG algorithm. Extensive experiments conducted on networks of varying scales demonstrate that the AOSG algorithm, incorporating the initial feasible solution and Hamming inequality, delivers superior performance and generates optimal orchestration strategies within a feasible time frame.