Mean-Field Stackelberg Game-Based Security Defense and Resource Optimization in Edge Computing

Abstract

Edge computing brings computation and storage resources to the edge of the mobile network to solve the problems of low latency and high real-time demand. However, edge computing is more vulnerable to malicious attacks due to its open and dynamic environments. In this article, we investigate security defense strategies in edge computing systems, focusing on scenarios with one attacker and multiple defenders to determine optimal defense strategies with minimal resource allocation. Firstly, we formulate the interactions between the defenders and the attackers as the mean-field Stackelberg game model, where the state and the objective functions of the defenders are coupled through the mean-field term, and are strongly influenced by the strategy of the attacker. Then, we analyze the local optimal strategies of the defenders given an arbitrary strategy of the attackers. We demonstrate the Nash equilibrium and the mean-field equilibrium for both the defenders and the attackers. Finally, simulation analysis will illustrate the dynamic evolution of the defense strategy of the defenders and the trajectory of the attackers based on the proposed Stackelberg game model.

A Binary-State Continuous-Time Markov Chain Model for Offshoring and Reshoring

“…For example, it can be hypothesized that the parameter γ (representing incentives) depends on the number of companies that have relocated: the higher this average, the higher the incentives. This modification turns the problem into a mean-field game (see [20] for an interesting application of mean-field game theory), which is difficult to treat but very rich in terms of information. This entire paper is structured to make this extension very easy and to allow for the easy extension of the research presented in this work to even more detailed and informative situations.…”

“…By continuity, there exists ε > 0 such that, for t ∈ [T − ε, T], there is |z t | ≤ θ. Hence, for every t ∈ [T − ε, T], żt = −δξ and we can solve the following Cauchy problem żt = −δξ z T = 0 (20) as long as |z t | ≤ θ. Therefore,…”