# Network Attack and Defense Modeling and System Security Analysis: A Novel Approach Using Stochastic Evolutionary Game Petri Net

Authors: Zenan Wu; Liqin Tian; Yi Zhang; Yan Wang; Yuquan Du
Journal: Security and Communication Networks
 (2021)

---

## Abstract

At present, most network security analysis theory assumes that the players are completely rational. However, this is not consistent with the actual situation. In this paper, based on the effectiveness constraints on both sides with network attack and defense, with the help of stochastic Petri net and evolutionary game theory, the Petri net model of network attack and defense stochastic evolutionary game is reconstructed, the specific definition of the model is given, and the modeling method is given through the network connection relationship and attack and defense strategy set. Using this model, a quantitative analysis of network attack events is carried out to solve a series of indicators related to system security, namely, attack success rate, average attack time, and average system repair time. Finally, the proposed model and analysis method are applied to a classic network attack and defense process for experimental analysis, and the results verify the rationality and accuracy of the model and analysis method.


---

## Body

## 1. Introduction

In recent years, with the rapid development of information technology, it has provided great convenience for the country's scientific and technological development and the people's living needs. However, the increasing complexity of network scale also brings growing security problems since malicious entity behaviors are turning to be more threatening, such as the loss of private data, attacks against the network, and detection of these attacks [1, 2]. It is particularly important to note that the threat behavior of malicious users poses a great threat to the security of the network system [3]. For example, in a network session, when a malicious user pretends to be a normal user to access the system and conducts unsafe behavior, the network system will be misled by fraudulent behavior. If an entity in the network threatens the security of the system, the network administrator should exercise certain control over it.However, the traditional passive security defense strategy has been unable to meet the actual needs of network development. It is urgent to analyze and predict the network attack events and then implement the new technology of active security defense [4, 5]. In network attack events, the basic characteristics of game theory are target opposition, strategic dependence, and noncooperation. Therefore, game theory has become a popular method for theoretical analysis and modeling of network security proposed in recent years [6, 7]. Roy et al. [8] summarize the application results of existing game theory in solving network security problems and classify the solutions according to the applicability of the method. Anderson [9] applied game theory to the problem of network security offense and defense based on the opposition between the two parties in the game and the interdependence of the two parties' strategy selection. Shamma [10] proposed two person zero sum games and noncooperative intrusion detection system models and introduced the application of game theory in decision system. Wu et al. [11] proposed a two-stage game model to provide the optimal security detection strategy for heterogeneous network systems; Li et al. [12] proposed a Stackelberg game model to solve the problem of interactive decision-making between attackers and defenders in network control systems. Liu et al. [13] proposed a network attack and defense game model based on Bayes Nash equilibrium, solved the attack and defense problem through the utility maximization problem, and focused on the attack and defense game problem of insecure information network based on risk aversion. In Zhang et al. [14], in order to more accurately describe the timely response of network confrontation combining with the theory of differential game, the game model of attack and defense differential game is established. Guan et al. [15] believed that the effectiveness of network attack and defense depends on some network performance indicators, which are defined to evaluate the performance of the whole network system. They propose a networked colonial bottom game for the attack defense strategy, which enables attackers and defenders to reasonably allocate limited network resources on each node. In addition, this paper also proposes a coevolution algorithm to obtain the actual behavior set and finally realizes the Nash equilibrium of the mixed strategy. Tan et al. [16] used game theory to analyze the continuous network attack defense process based on the dynamic spatiotemporal confrontation characteristics of network attack and defense, established a FlipIt-based moving target defense and temporospatial strategies model, and gave the quantitative calculation method for the utility of the attacker and the defender. Gao et al. [17] focused on the research of offensive and defensive games between multiple groups of terminals in wireless networks and proposed an optimal strategy selection algorithm based on differential game between multiple attackers and multiple defenders. Finally, through simulation experiments, we demonstrated the evolution trajectory of the optimal strategy.In summary, in the early research work of network security game models, most researchers pay more attention to preventing attacks in network systems. Later research focuses on designing the system's security mechanism, which is the system's active defense function of network security by detecting and preventing malicious attacks.Although the above methods provide a lot of research ideas for network security analysis, these methods also have some limitations [18]. Firstly, in a cyber security incident, the actions of both offensive and defensive parties influence each other, and both parties are in a state of ebb and flow. Pure game theory does not have enough modeling ability to completely describe complex network attack events; secondly, as far as we know, almost all of the existing modeling methods based on game theory set the players in the game as completely rational, but such assumptions are often inconsistent with our actual situation. As a qualitative experimental simulation, sometimes, we can consider this assumption to be reasonable. However, in practical applications, we doubt the rationality of this assumption. In the real network environment, network attack is a kind of man-made behavior. The fundamental reason for its formation is closely related to human interests. The behavior of both sides of the network attack and defense can not be a completely rational behavior; they show more effective rational behavior. Therefore, if we regard both sides of the game as completely rational players for modeling and analysis, the results will deviate from the actual situation. Similarly, this assumption will greatly weaken the accuracy and guiding significance of the results obtained by the model.In view of the limitations of the above methods, we transform and upgrade the traditional modeling methods. We find that Petri net is a tool with parallel processing ability and graphical problem description [19]. In addition, in the actual process of network attack and defense, the choice of attack and defense strategies, the change of system environment, and the interference of external factors all have a certain randomness. There are many references [20, 21], which have applied the analysis method based on stochastic model to network security evaluation. However, the stochastic Petri net is formed on the basis of the Petri net. In addition to the basic characteristics of the Petri net, it also has the ability to dynamically analyze the concurrency, asynchrony, and uncertainty of the network system [22]. It can be conveniently used to model and analyze complex systems, such as system performance analysis and reliability evaluation. In addition, stochastic Petri nets have good expansibility [23], and new constructions can be added easily. Therefore, we believe that stochastic Petri nets are more suitable for modeling and security analysis of network systems.Taking into account the two characteristics of bounded rationality and repeated games in network confrontation games [24], they are the premise of evolutionary game theory; and evolutionary game theory abandons the defect of traditional game theory that players are completely rational. Therefore, evolutionary game theory can be better used to describe the influence of human factors on the development of network attack and defense and is more suitable for the modeling and analysis of network attack and defense confrontation behavior [25].Therefore, in order to improve the rationality and accuracy of the model, this paper will take the attack and defense sides of the network under the condition of bounded rationality as the problem object, with the help of evolutionary game theory and stochastic Petri net, construct a network attack and defense model based on stochastic evolutionary game Petri net, and analyze the security of the attacked network system.The contributions of this paper are threefold:(1)
We first analyzed the strategies that the offensive and defensive parties can adopt in a cyber attack event, provided an evaluation program closer to the real world, enabled the research community to conduct systematically, and evaluated a trust model.(2)
We propose to apply stochastic Petri net and evolutionary game theory in the evaluation process of network trust model and discuss the detailed simulation scenarios of modeling.(3)
We apply our stochastic evolutionary game Petri net model to an example classic attack event. The evaluation results suggest that our model can describe in detail the complete process of an attack event. Since the evolutionary game theory is used in the model, after many games, the malicious entity will converge to a final state, which is also the best state. Therefore, the method we propose is more scientific and accurate for the trust evaluation results of network entities.The rest of the paper is organized as follows. First, we introduce the basic definition and related attributes of stochastic evolutionary game Petri net model in Section2. Then, we introduce the specific methods of modeling in Section 3. In Section 4, through an example, the proposed model is applied to the actual network attack and defense events. In Section 5, we analyze the experimental results. Finally, we summarize our paper with feature work in Section 6.


## 2. Petri Net Model of Stochastic Evolutionary Game for Network Attack and Defense

The traditional network attack and defense game model is based on the complete rationality of both sides of the game. In practice, the behavior of both sides of the network attack and defense is a kind of limited rationality. Based on evolutionary game and stochastic Petri net, this paper constructs a Petri net model of network attack defense stochastic evolutionary game.Definition 1.
A Petri net model of stochastic evolutionary game of network attack and defense can be represented by a 9-tuple:(1)AD−SEGPN=N,P,T,F,π,λ,Δ,U,M.(1)
N=Na,Nd denotes the set of players; Na is the attacker, and Nd is the defender.(2)
P=P1,P2,…,Pn is a finite set of places; Pi represents the state of the system after the attack event.(3)
T=TNa∪TNd is a finite set of transitions; transition represents the player's behavior strategy. For example, a represents the set of strategies that the defender can adopt.(4)
F∈I∪O is a set of arcs, where I⊆P×T and O⊆T×P such that P∩T≠φ and P∪T≠φ, where φ is an empty set.(5)
π:T⟶0,1 represents the probability that the transition is selected, that is, the probability that the player chooses a certain behavior strategy.(6)
λ=λ1,λ2,…,λn is a collection of change implementation rates.(7)
Δ=δNa,δNb is the set of random interference intensity coefficients; δNa is the influence strength coefficient of random interference on the attacker; δNd is the influence intensity coefficient of random interference on the defender.(8)
U=UNa,UNd represents the set of game revenue functions; UNaand UNd represent the game revenue set of attacker and defender, respectively.(9)
M=m1,m2,…,mn is the set of identifications, and the identifications are the elements in the Markov chain. Every state in the model has its corresponding identifications in the Markov chain.
For AD-SEGPN model, the behavior choice and implementation of each player depend on their own state and the state and potential behavior of other players. Therefore, it is necessary to build an appropriate model and set the rules of transition according to the specific situation. This paper is based on the trigger rule of transition in classical Petri nets. Token is used to mark the state of the players. If there is a mark inPi, it means that the player is in this position. Any change may lead to the change of the player's state, which is graphically displayed in the model by the flow of markers.Definition 2.
For a given stochastic evolutionary game Petri netSEGPN=N,P,T,F,π,λ,Δ,U,M, the attacker's strategy can be expressed as follows.
πNa=πtNa1,πtNa2,…,πtNaTNa, and πtNai is he probability that the attacker chooses to implement behavior ti; the defender's strategy is expressed as πNd=πtNd1,πtNd2,…,πtNd|TNd| where πtNdj is the probability that the defender chooses to carry out the action tj.


## 3. Modeling Method in AD-SEGPN

### 3.1. Modeling Method

The Petri net model of stochastic evolutionary game inherits the basic elements of stochastic Petri net, such as position, transition, and arc. At the same time, it absorbs the return, utility, strategy, and other elements of player's behavior in evolutionary game theory, so as to realize the modeling and analysis of game process visualization. The specific modeling steps are as follows:(1)
Determine the players in the game and analyze the types of the game.(2)
Construct the behavior setT of players. The behavior set of players includes the behavior strategies that players may choose in each stage of the game. tji∈T is the behavior of player i in state j.(3)
The position set P of players is constructed. The set of players' positions contains all the states produced in the game.(4)
Establish arc connection. The occurrence of players' behavior, that is, triggering the occurrence of changes, will make the state of the whole system change, that is, from one state to another, and connect them by using arcs, so as to form a complete system model.(5)
Determine the utilityR. In AD-SEGPN model, utility R is the income that the actor can obtain after the implementation of transition T, which is recorded as R:T⟶r1,r2,…,rn,ri∈−∞,+∞. If ri<0, it means that the actor has paid the price. Utility can be expressed by letters or utility function. The variables of the function can be associated with their own state parameters and can also be associated with the state parameters of other players in the game.(6)
Evolutionary equilibrium solution. Under the condition of bounded rationality, both sides of evolutionary game will conduct dynamic repeated game through the process of “imitation-learning-strategy adjustment” and finally reach the stable equilibrium state of the game [26]. Refer to Section 3.2 for the specific method of solving evolutionary equilibrium.(7)
According to the equilibrium strategy obtained in (6), as the probability of transition being selected in the model, and then, given the transition rate, according to the calculation method of stochastic Petri net, the important results related to network security analysis are further calculated.


### 3.2. Evolutionary Equilibrium Solution

In network attack, attackerNa and defender Nd have a variety of strategies to choose from. Suppose that the attacker Na can choose TNa=a1,a2,…,an and the defender NdTNd=d1,d2,…,dm, where m,n∈N and m,n≥2. Because network attack event can be regarded as a multistage game process, attackers and defenders will choose strategies with different probabilities in different stages, and the probabilities will change with the passage of time under the effect of learning mechanism, so that the selection of attack and defense strategies will form a dynamic change process. Finally, the attack and defense sides will find their own equilibrium stable strategy (ESS) [27].Definition 3.
Equilibrium stable strategy in offensive and defensive events. In a network attack and defense event, there is a strategy; if all members of the attacker or defender adopt it, then any mutation strategy will not invade the population under the influence of natural selection.
The condition for a strategyx to be ESS of the offensive and defensive events is that for any strategy y≠x.(2)μx,x≥μy,x,μx,y≥μy,y,where μx,y is the payoff of attacker’s strategy x when interacting with defensive’s strategy y.
Letpi be the probability that the attacker chooses the attack strategy ai, and let qj be the probability that the defender chooses the attack strategy dj, i∈n,j∈m：(3)∑i=1npi=1,∑j=1mqj=1.
UNaij and UNdij are the respective gains of the attacker and the defender when they tke ai and dj, respectively. In the attack event, the two sides of the game adopt different strategies, which will produce the corresponding income value. The benefits obtained by the attacker and the defender after choosing strategies with different probabilities at a certain stage of the game are shown in Figure 1.
Furthermore, we can calculate the expected return and average return of different strategies chosen by both sides of the game:(1)
The expected revenueUNaiand average revenue U¯Na of the attacker are as follows:(4)UNa1=q1⋅UNa11+q2⋅UNa12+q3⋅UNa13+⋯+qm⋅UNa1m,UNa2=q1⋅UNa21+q2⋅UNa22+q3⋅UNa23+⋯+qm⋅UNa2m,⋮⋮,UNan=q1⋅UNan1+q2⋅UNan2+q3⋅UNan3+⋯+qm⋅UNanm,U¯Na=p1⋅UNa1+p2⋅UNa2+q3⋅UNa3+⋯+pnUNan.(2)
The expected returnUNdj and average return U¯d of the defender are as follows:(5)UNd1=p1⋅UNd11+p2⋅UNd21+p3⋅UNd31+⋯+pn⋅UNdn1,UNd2=p1⋅UNd12+p2⋅UNd22+p3⋅U3232+⋯+pn⋅UNdn2,⋮⋮,UNdm=p1⋅UNd1m+p2⋅UNd2m+p3⋅UNd3m+⋯+pn⋅UNdnm,U¯Nd=q1⋅UNd1+q2⋅UNd2+q3⋅UNd3+⋯+qmUNdm.
In the evolutionary game of network attack and defense, when the attacker chooses a strategy that leads to low profit, he will adjust the current strategy to improve his own profit; similarly, it is the same for the defender. Therefore, for both sides of the game, the probability of the behavior strategy available for them to choose is a time function, which can be expressed bypit and qjt, and its dynamic change rate can be expressed by copying the dynamic equation:(6)Ap=dpitdt=pUai−U¯a,(7)Dp=dqjtdt=pUdj−U¯d.
By combining formulas (6) and (7), let Y=ApDP=fY,t=0 be solved, and the evolutionary stable equilibrium solution of both attack and defense sides of the network can be obtained. The calculation results provide a basis for the selection probability of transition in AD-SEGPN model.Figure 1
Attack and defense game trees.


## 3.1. Modeling Method

The Petri net model of stochastic evolutionary game inherits the basic elements of stochastic Petri net, such as position, transition, and arc. At the same time, it absorbs the return, utility, strategy, and other elements of player's behavior in evolutionary game theory, so as to realize the modeling and analysis of game process visualization. The specific modeling steps are as follows:(1)
Determine the players in the game and analyze the types of the game.(2)
Construct the behavior setT of players. The behavior set of players includes the behavior strategies that players may choose in each stage of the game. tji∈T is the behavior of player i in state j.(3)
The position set P of players is constructed. The set of players' positions contains all the states produced in the game.(4)
Establish arc connection. The occurrence of players' behavior, that is, triggering the occurrence of changes, will make the state of the whole system change, that is, from one state to another, and connect them by using arcs, so as to form a complete system model.(5)
Determine the utilityR. In AD-SEGPN model, utility R is the income that the actor can obtain after the implementation of transition T, which is recorded as R:T⟶r1,r2,…,rn,ri∈−∞,+∞. If ri<0, it means that the actor has paid the price. Utility can be expressed by letters or utility function. The variables of the function can be associated with their own state parameters and can also be associated with the state parameters of other players in the game.(6)
Evolutionary equilibrium solution. Under the condition of bounded rationality, both sides of evolutionary game will conduct dynamic repeated game through the process of “imitation-learning-strategy adjustment” and finally reach the stable equilibrium state of the game [26]. Refer to Section 3.2 for the specific method of solving evolutionary equilibrium.(7)
According to the equilibrium strategy obtained in (6), as the probability of transition being selected in the model, and then, given the transition rate, according to the calculation method of stochastic Petri net, the important results related to network security analysis are further calculated.


## 3.2. Evolutionary Equilibrium Solution

In network attack, attackerNa and defender Nd have a variety of strategies to choose from. Suppose that the attacker Na can choose TNa=a1,a2,…,an and the defender NdTNd=d1,d2,…,dm, where m,n∈N and m,n≥2. Because network attack event can be regarded as a multistage game process, attackers and defenders will choose strategies with different probabilities in different stages, and the probabilities will change with the passage of time under the effect of learning mechanism, so that the selection of attack and defense strategies will form a dynamic change process. Finally, the attack and defense sides will find their own equilibrium stable strategy (ESS) [27].Definition 3.
Equilibrium stable strategy in offensive and defensive events. In a network attack and defense event, there is a strategy; if all members of the attacker or defender adopt it, then any mutation strategy will not invade the population under the influence of natural selection.
The condition for a strategyx to be ESS of the offensive and defensive events is that for any strategy y≠x.(2)μx,x≥μy,x,μx,y≥μy,y,where μx,y is the payoff of attacker’s strategy x when interacting with defensive’s strategy y.
Letpi be the probability that the attacker chooses the attack strategy ai, and let qj be the probability that the defender chooses the attack strategy dj, i∈n,j∈m：(3)∑i=1npi=1,∑j=1mqj=1.
UNaij and UNdij are the respective gains of the attacker and the defender when they tke ai and dj, respectively. In the attack event, the two sides of the game adopt different strategies, which will produce the corresponding income value. The benefits obtained by the attacker and the defender after choosing strategies with different probabilities at a certain stage of the game are shown in Figure 1.
Furthermore, we can calculate the expected return and average return of different strategies chosen by both sides of the game:(1)
The expected revenueUNaiand average revenue U¯Na of the attacker are as follows:(4)UNa1=q1⋅UNa11+q2⋅UNa12+q3⋅UNa13+⋯+qm⋅UNa1m,UNa2=q1⋅UNa21+q2⋅UNa22+q3⋅UNa23+⋯+qm⋅UNa2m,⋮⋮,UNan=q1⋅UNan1+q2⋅UNan2+q3⋅UNan3+⋯+qm⋅UNanm,U¯Na=p1⋅UNa1+p2⋅UNa2+q3⋅UNa3+⋯+pnUNan.(2)
The expected returnUNdj and average return U¯d of the defender are as follows:(5)UNd1=p1⋅UNd11+p2⋅UNd21+p3⋅UNd31+⋯+pn⋅UNdn1,UNd2=p1⋅UNd12+p2⋅UNd22+p3⋅U3232+⋯+pn⋅UNdn2,⋮⋮,UNdm=p1⋅UNd1m+p2⋅UNd2m+p3⋅UNd3m+⋯+pn⋅UNdnm,U¯Nd=q1⋅UNd1+q2⋅UNd2+q3⋅UNd3+⋯+qmUNdm.
In the evolutionary game of network attack and defense, when the attacker chooses a strategy that leads to low profit, he will adjust the current strategy to improve his own profit; similarly, it is the same for the defender. Therefore, for both sides of the game, the probability of the behavior strategy available for them to choose is a time function, which can be expressed bypit and qjt, and its dynamic change rate can be expressed by copying the dynamic equation:(6)Ap=dpitdt=pUai−U¯a,(7)Dp=dqjtdt=pUdj−U¯d.
By combining formulas (6) and (7), let Y=ApDP=fY,t=0 be solved, and the evolutionary stable equilibrium solution of both attack and defense sides of the network can be obtained. The calculation results provide a basis for the selection probability of transition in AD-SEGPN model.Figure 1
Attack and defense game trees.


## 4. Experimental Simulation

In this section, we will analyze the rationality and accuracy of our scheme by experimental evaluation.


### 4.1. Experiment Simulation Environment

Figure2 shows a typical network topology, which consists of Internet and intranet. Among them, intranet includes web server, information center, and some private PCs, which are usually chosen by attackers as the target of stealing confidential information. In addition, in the basic network system, IDS is often used to build the basic security control defense system. In practical applications, attackers will steal the confidential information in the system by installing sniffers. The responsibility of network administrators is to obtain the attacker's evidence and relevant information as much as possible and organize the occurrence of attacks.Figure 2
Simulation experiment system structure.


### 4.2. Attack and Defense Information

When attackers and defenders choose different behavior strategies with different probabilities, the system will transfer from one state to another in a probabilistic way. According to the network topology shown in Figure2, we can describe the attack and defense process as follows.


#### 4.2.1. Attack Process

(i)
The attacker scans the port of the web server in the target network and analyzes the network services provided by the target server(ii)
The attacker takes advantage of the vulnerability of the web server to obtain the login account and password(iii)
The attacker successfully logs into the system and obtains the root operation permission(iv)
The attacker uses the root privilege to install sniffer on the web server to steal the confidential information on the terminal host


#### 4.2.2. Defense Process

(i)
IDS detects the attack and reports it to the server(ii)
According to the reported dangerous behavior information, the server notifies the firewall and trap machine for further observation and tracking(iii)
The trap machine induces the attacker to continue to visit the server, records the attack behavior, and obtains the attack evidence of the attacker(iv)
The server blocks the attacker's IP and clears the snifferBased on the above attack and defense process, we can get the behavior set of attack and defense in AD-SEGPN model, as shown in Table1.Table 1
Attack and defense behavior set.
PlayersActionSymbolDescriptionAttackerScan_Vulnerabilitya1Vulnerability scan of network systemCrack_Passworda2Obtain user login informationEnhance_permissiona3Enhance the operating permissionInstall_sniffera4Install sniffer software to invade the hostSteal_informationa5Steal system confidential data resourcesφa6Do nothingDefenderIDS_scand1Delete the threatening account and restartCheat_attackerd2Restore the network and delete the threatening accountBlockade_IPd3Install sniffer monitoring programRemove_snifferd4Clear sniffer monitoring programφd5Do nothing


### 4.3. Modeling and Parameter Setting

#### 4.3.1. Modeling Analysis

According to the definition of AD-SEGPN model in Section3.1 and the attack information in Sections 4.1 and 4.2, we can build a Petri net model of network attack defense stochastic evolutionary game.The detailed description of the location set and transition set in the model is shown in Table2.Table 2
The meaning of place and transition.
PlaceMeaningTransitionMeaningP0The normal state of the systemT0Vulnerability scan of network systemP1The vulnerability of the web server was discoveredT1Obtain user login informationP2Get normal operation permissionT2Enhance the operating permissionP3Get root operation authorityT3Install sniffer software to invade the hostP4Implant snifferT4Steal system confidential data resourcesP5System confidential data resources was stolenT5,T6,T7T8,T9IDS_scanP6Admin_knowT10Blockade_IPP7Attack_terminatedT11Remove_snifferP8Sniffer_removedT12Return


#### 4.3.2. Parameter Setting

According to the model diagram of Figure3, the parameter information needed in the AD-SEGPN model is given in Table 3, where λ represents the behavior ability of transition and π represents the probability of behavior being selected. The exact value of λ can be assumed according to the difficulty in the actual attack process, and the exact value of π is the calculation result of evolutionary equilibrium strategy in Section 3.2.Figure 3
Structure of AD-SEGPN model.Table 3
Parameter setting.
TransitionλπOffensive behaviorScan_Vulnerability60.2365Crack_Password100.3768Enhance_permission60.6679Install_sniffer50.9013Steal_information100.8451Defensive behaviorIDS_scan80.3256Cheat_attacker80.4531Blockade_IP80.8215Remove_sniffer100.9324


## 4.1. Experiment Simulation Environment

Figure2 shows a typical network topology, which consists of Internet and intranet. Among them, intranet includes web server, information center, and some private PCs, which are usually chosen by attackers as the target of stealing confidential information. In addition, in the basic network system, IDS is often used to build the basic security control defense system. In practical applications, attackers will steal the confidential information in the system by installing sniffers. The responsibility of network administrators is to obtain the attacker's evidence and relevant information as much as possible and organize the occurrence of attacks.Figure 2
Simulation experiment system structure.


## 4.2. Attack and Defense Information

When attackers and defenders choose different behavior strategies with different probabilities, the system will transfer from one state to another in a probabilistic way. According to the network topology shown in Figure2, we can describe the attack and defense process as follows.


### 4.2.1. Attack Process

(i)
The attacker scans the port of the web server in the target network and analyzes the network services provided by the target server(ii)
The attacker takes advantage of the vulnerability of the web server to obtain the login account and password(iii)
The attacker successfully logs into the system and obtains the root operation permission(iv)
The attacker uses the root privilege to install sniffer on the web server to steal the confidential information on the terminal host


### 4.2.2. Defense Process

(i)
IDS detects the attack and reports it to the server(ii)
According to the reported dangerous behavior information, the server notifies the firewall and trap machine for further observation and tracking(iii)
The trap machine induces the attacker to continue to visit the server, records the attack behavior, and obtains the attack evidence of the attacker(iv)
The server blocks the attacker's IP and clears the snifferBased on the above attack and defense process, we can get the behavior set of attack and defense in AD-SEGPN model, as shown in Table1.Table 1
Attack and defense behavior set.
PlayersActionSymbolDescriptionAttackerScan_Vulnerabilitya1Vulnerability scan of network systemCrack_Passworda2Obtain user login informationEnhance_permissiona3Enhance the operating permissionInstall_sniffera4Install sniffer software to invade the hostSteal_informationa5Steal system confidential data resourcesφa6Do nothingDefenderIDS_scand1Delete the threatening account and restartCheat_attackerd2Restore the network and delete the threatening accountBlockade_IPd3Install sniffer monitoring programRemove_snifferd4Clear sniffer monitoring programφd5Do nothing


## 4.2.1. Attack Process

(i)
The attacker scans the port of the web server in the target network and analyzes the network services provided by the target server(ii)
The attacker takes advantage of the vulnerability of the web server to obtain the login account and password(iii)
The attacker successfully logs into the system and obtains the root operation permission(iv)
The attacker uses the root privilege to install sniffer on the web server to steal the confidential information on the terminal host


## 4.2.2. Defense Process

(i)
IDS detects the attack and reports it to the server(ii)
According to the reported dangerous behavior information, the server notifies the firewall and trap machine for further observation and tracking(iii)
The trap machine induces the attacker to continue to visit the server, records the attack behavior, and obtains the attack evidence of the attacker(iv)
The server blocks the attacker's IP and clears the snifferBased on the above attack and defense process, we can get the behavior set of attack and defense in AD-SEGPN model, as shown in Table1.Table 1
Attack and defense behavior set.
PlayersActionSymbolDescriptionAttackerScan_Vulnerabilitya1Vulnerability scan of network systemCrack_Passworda2Obtain user login informationEnhance_permissiona3Enhance the operating permissionInstall_sniffera4Install sniffer software to invade the hostSteal_informationa5Steal system confidential data resourcesφa6Do nothingDefenderIDS_scand1Delete the threatening account and restartCheat_attackerd2Restore the network and delete the threatening accountBlockade_IPd3Install sniffer monitoring programRemove_snifferd4Clear sniffer monitoring programφd5Do nothing


## 4.3. Modeling and Parameter Setting

### 4.3.1. Modeling Analysis

According to the definition of AD-SEGPN model in Section3.1 and the attack information in Sections 4.1 and 4.2, we can build a Petri net model of network attack defense stochastic evolutionary game.The detailed description of the location set and transition set in the model is shown in Table2.Table 2
The meaning of place and transition.
PlaceMeaningTransitionMeaningP0The normal state of the systemT0Vulnerability scan of network systemP1The vulnerability of the web server was discoveredT1Obtain user login informationP2Get normal operation permissionT2Enhance the operating permissionP3Get root operation authorityT3Install sniffer software to invade the hostP4Implant snifferT4Steal system confidential data resourcesP5System confidential data resources was stolenT5,T6,T7T8,T9IDS_scanP6Admin_knowT10Blockade_IPP7Attack_terminatedT11Remove_snifferP8Sniffer_removedT12Return


### 4.3.2. Parameter Setting

According to the model diagram of Figure3, the parameter information needed in the AD-SEGPN model is given in Table 3, where λ represents the behavior ability of transition and π represents the probability of behavior being selected. The exact value of λ can be assumed according to the difficulty in the actual attack process, and the exact value of π is the calculation result of evolutionary equilibrium strategy in Section 3.2.Figure 3
Structure of AD-SEGPN model.Table 3
Parameter setting.
TransitionλπOffensive behaviorScan_Vulnerability60.2365Crack_Password100.3768Enhance_permission60.6679Install_sniffer50.9013Steal_information100.8451Defensive behaviorIDS_scan80.3256Cheat_attacker80.4531Blockade_IP80.8215Remove_sniffer100.9324


## 4.3.1. Modeling Analysis

According to the definition of AD-SEGPN model in Section3.1 and the attack information in Sections 4.1 and 4.2, we can build a Petri net model of network attack defense stochastic evolutionary game.The detailed description of the location set and transition set in the model is shown in Table2.Table 2
The meaning of place and transition.
PlaceMeaningTransitionMeaningP0The normal state of the systemT0Vulnerability scan of network systemP1The vulnerability of the web server was discoveredT1Obtain user login informationP2Get normal operation permissionT2Enhance the operating permissionP3Get root operation authorityT3Install sniffer software to invade the hostP4Implant snifferT4Steal system confidential data resourcesP5System confidential data resources was stolenT5,T6,T7T8,T9IDS_scanP6Admin_knowT10Blockade_IPP7Attack_terminatedT11Remove_snifferP8Sniffer_removedT12Return


## 4.3.2. Parameter Setting

According to the model diagram of Figure3, the parameter information needed in the AD-SEGPN model is given in Table 3, where λ represents the behavior ability of transition and π represents the probability of behavior being selected. The exact value of λ can be assumed according to the difficulty in the actual attack process, and the exact value of π is the calculation result of evolutionary equilibrium strategy in Section 3.2.Figure 3
Structure of AD-SEGPN model.Table 3
Parameter setting.
TransitionλπOffensive behaviorScan_Vulnerability60.2365Crack_Password100.3768Enhance_permission60.6679Install_sniffer50.9013Steal_information100.8451Defensive behaviorIDS_scan80.3256Cheat_attacker80.4531Blockade_IP80.8215Remove_sniffer100.9324


## 5. Network System Security Analysis

After modeling the network system based on the model proposed above, we use the pipe software to calculate and analyze the AD-SEGPN model shown in Figure3. Next, we analyze the security of the network system from two aspects. Firstly, we discussed the typical evaluation factors of network system security; then, we made an overall evaluation of network system security from two aspects.


### 5.1. Typical Network Security Factors

#### 5.1.1. Attack Success Rate

Attack success rate is the probability that an attacker can attack a target successfully. In our model, the initial positionP0 contains a token, which represents the normal state of the system at the beginning. With the attack, the identity begins to flow. When the identity flows to the location Pi, it means that the attacker has successfully invaded a part of the system. Therefore, the attack success rate of the attacker to the system component i can be expressed as(8)PNa⟶Pi=PmPi=1=1−PmPi=0,where PmPi=1 is the probability that the location Pi contains a token.The calculation results are obtained by the software package pipe. In Figure4, we get the change of attack success rate with system time under different attack rates.Figure 4
The probability of successful attack changes in the network, withλ=1,5,10,15, respectively.It can be seen from the figure that, with the increase of attack rate, the probability of successful attack also increases. However, after a period of time, the time required for successful attack becomes longer. This is because the higher the attack rate is, the more frequent the attack occurs, and the easier it is to be detected by the defender. At the same time, when the attack rate is greater than 10, and the system time tends to be stable, the attack success rate is no longer affected by the attack rate. This is an important result. According to this result, in this case, the defense mechanism of the system only needs to care about the attacker's attack ability and expected benefits and can not consider the attacker's attack rate.


#### 5.1.2. Average Time of Successful Intrusion

Because the whole attack process is a progressive process, the attacker through step-by-step intrusion system components ultimately achieves the goal of stealing system confidential data. Therefore, the average timeT¯a of an attacker's successful intrusion can be calculated as follows.First of all, the response timeTai=1/THa of an attacker to complete an attack on a subtarget, where THa is the throughput of transition in the model.Secondly,THa=∑M∈HPMλa, where H is the marker set of attack transition, and λa is the rate of attack transition;Finally,T¯a=∑i=1nTai/n, where n refers to the number of subattack targets protected in the whole attack process.Figure5 shows that the average time of successful intrusion of attackers varies with the system time under different attack rates.Figure 5
Mean time for a successful attack changes in the network, withλ=1,5,10,15, respectively.We find that the attack time of attackers increases with time under different attack rates. Moreover, the higher the attack rate is, the more attack time is needed. This is because the higher the attack rate is, the easier the attack behavior is to be found. On the contrary, the smaller the attack rate is, the less it is to be found. Therefore, less time is needed for the successful attack. This result is completely in line with the actual situation.


#### 5.1.3. Mean Time to Repair (MTTR) of the System

System repair time refers to the time from system failure to normal operation. If the location of the identifier in the model is regarded as a queue, the average repair time of the system can be understood as the average time of the identifier starting fromP1 and returning to P0. Therefore, we define the average repair time of the system as follows: MTTR=N¯/λ∗, where N¯ is the average length of the queue and λ∗ is the average rate of arrival of the queue.Figure6 shows the average system repair time versus system time under different attack rates.Figure 6
Mean time to repair (MTTR), withλ=1,5,10,15, respectively.As shown in Figure6, the average repair time of the system increases first and then decreases. This is because, in the initial stage of system attack, the system needs to spend a certain amount of time to find the intrusion point and then repair it. Moreover, we also found that the higher the attack rate, the longer the average repair time of the system. This is because higher intrusion frequency will bring more difficulties to the repair of the system.In addition, through the analysis of the above experiments, we should note that, in the initial stage of the attack, the lower the frequency of the attack, the smaller the intrusion time, ultimately making the average repair time of the system not lower than that of the high-frequency attack, which is an important conclusion that is easy to be ignored. From this result, we conclude that low-frequency attack behaviors will also have a serious impact on the security of the system, and sometimes even more destructive than high-frequency behaviors, because it occurs at the beginning of the attack event.


### 5.2. Overall Evaluation of Network System Security

#### 5.2.1. Reliability

Reliability refers to the probability that the network system will continue to provide a certain network service within a certain period of time, and it reflects the continuity of the network system's safe operation [28]. Therefore, in the security research of the network system, we are concerned about the ability of the network system to provide certain network services normally and continuously.IfSR is the state set when the system provides a certain normal network service, and Xt represents the state of the system at time t, the mathematical expression of the instantaneous reliability Areliablittyt of the system in time 0,t is as follows.SupposeX0∈SR,τ=inft:Xt∉SR, and then Areliabilityt=Pτ>t.When performing quantitative calculations, we generally use MTTF to describe the steady-state reliability of the system, also known as the inherent reliability of the system, which can express mathematical expectations:(9)MTTF=Eτ.


#### 5.2.2. Availability

Availability refers to the ability to complete the specified functions in a repairable network system in a specified manner of use and maintenance, and within a given time [29]. In the security research of the network system, we are concerned about the steady-state availability of the repairable system, which is mainly used to reflect the specific performance of the process of alternate changesnormal↔failure between the state of the network system. Suppose that Xu represents the state of the system at time u, SA is the set of the system in a normal operating state, and πi is the steady-state probability of the system at time i. Then, the mathematical expression of the steady-state availability Aavailability of the network system in time 0,t is(10)Aavailability=limt⟶∞∫0tPXu∈SAdut=∑i∈sAπi.According to the above formula and the parameter settings in Section4, we can obtain the changes of reliability and availability with system time, as shown in Figure 7.Figure 7
The changes of reliability and availability with system time.From the figure, we can clearly find that the change trend of reliability and availability is that it will gradually decrease at the beginning and then slowly rise to a certain value over time. This performance result is fully in line with the development trend of network attack events. Therefore, for network system administrators, attack behavior should be detected as early as possible, or the attack behavior can be predicted in advance, which is very important to the security of the network system.


## 5.1. Typical Network Security Factors

### 5.1.1. Attack Success Rate

Attack success rate is the probability that an attacker can attack a target successfully. In our model, the initial positionP0 contains a token, which represents the normal state of the system at the beginning. With the attack, the identity begins to flow. When the identity flows to the location Pi, it means that the attacker has successfully invaded a part of the system. Therefore, the attack success rate of the attacker to the system component i can be expressed as(8)PNa⟶Pi=PmPi=1=1−PmPi=0,where PmPi=1 is the probability that the location Pi contains a token.The calculation results are obtained by the software package pipe. In Figure4, we get the change of attack success rate with system time under different attack rates.Figure 4
The probability of successful attack changes in the network, withλ=1,5,10,15, respectively.It can be seen from the figure that, with the increase of attack rate, the probability of successful attack also increases. However, after a period of time, the time required for successful attack becomes longer. This is because the higher the attack rate is, the more frequent the attack occurs, and the easier it is to be detected by the defender. At the same time, when the attack rate is greater than 10, and the system time tends to be stable, the attack success rate is no longer affected by the attack rate. This is an important result. According to this result, in this case, the defense mechanism of the system only needs to care about the attacker's attack ability and expected benefits and can not consider the attacker's attack rate.


### 5.1.2. Average Time of Successful Intrusion

Because the whole attack process is a progressive process, the attacker through step-by-step intrusion system components ultimately achieves the goal of stealing system confidential data. Therefore, the average timeT¯a of an attacker's successful intrusion can be calculated as follows.First of all, the response timeTai=1/THa of an attacker to complete an attack on a subtarget, where THa is the throughput of transition in the model.Secondly,THa=∑M∈HPMλa, where H is the marker set of attack transition, and λa is the rate of attack transition;Finally,T¯a=∑i=1nTai/n, where n refers to the number of subattack targets protected in the whole attack process.Figure5 shows that the average time of successful intrusion of attackers varies with the system time under different attack rates.Figure 5
Mean time for a successful attack changes in the network, withλ=1,5,10,15, respectively.We find that the attack time of attackers increases with time under different attack rates. Moreover, the higher the attack rate is, the more attack time is needed. This is because the higher the attack rate is, the easier the attack behavior is to be found. On the contrary, the smaller the attack rate is, the less it is to be found. Therefore, less time is needed for the successful attack. This result is completely in line with the actual situation.


### 5.1.3. Mean Time to Repair (MTTR) of the System

System repair time refers to the time from system failure to normal operation. If the location of the identifier in the model is regarded as a queue, the average repair time of the system can be understood as the average time of the identifier starting fromP1 and returning to P0. Therefore, we define the average repair time of the system as follows: MTTR=N¯/λ∗, where N¯ is the average length of the queue and λ∗ is the average rate of arrival of the queue.Figure6 shows the average system repair time versus system time under different attack rates.Figure 6
Mean time to repair (MTTR), withλ=1,5,10,15, respectively.As shown in Figure6, the average repair time of the system increases first and then decreases. This is because, in the initial stage of system attack, the system needs to spend a certain amount of time to find the intrusion point and then repair it. Moreover, we also found that the higher the attack rate, the longer the average repair time of the system. This is because higher intrusion frequency will bring more difficulties to the repair of the system.In addition, through the analysis of the above experiments, we should note that, in the initial stage of the attack, the lower the frequency of the attack, the smaller the intrusion time, ultimately making the average repair time of the system not lower than that of the high-frequency attack, which is an important conclusion that is easy to be ignored. From this result, we conclude that low-frequency attack behaviors will also have a serious impact on the security of the system, and sometimes even more destructive than high-frequency behaviors, because it occurs at the beginning of the attack event.


## 5.1.1. Attack Success Rate

Attack success rate is the probability that an attacker can attack a target successfully. In our model, the initial positionP0 contains a token, which represents the normal state of the system at the beginning. With the attack, the identity begins to flow. When the identity flows to the location Pi, it means that the attacker has successfully invaded a part of the system. Therefore, the attack success rate of the attacker to the system component i can be expressed as(8)PNa⟶Pi=PmPi=1=1−PmPi=0,where PmPi=1 is the probability that the location Pi contains a token.The calculation results are obtained by the software package pipe. In Figure4, we get the change of attack success rate with system time under different attack rates.Figure 4
The probability of successful attack changes in the network, withλ=1,5,10,15, respectively.It can be seen from the figure that, with the increase of attack rate, the probability of successful attack also increases. However, after a period of time, the time required for successful attack becomes longer. This is because the higher the attack rate is, the more frequent the attack occurs, and the easier it is to be detected by the defender. At the same time, when the attack rate is greater than 10, and the system time tends to be stable, the attack success rate is no longer affected by the attack rate. This is an important result. According to this result, in this case, the defense mechanism of the system only needs to care about the attacker's attack ability and expected benefits and can not consider the attacker's attack rate.


## 5.1.2. Average Time of Successful Intrusion

Because the whole attack process is a progressive process, the attacker through step-by-step intrusion system components ultimately achieves the goal of stealing system confidential data. Therefore, the average timeT¯a of an attacker's successful intrusion can be calculated as follows.First of all, the response timeTai=1/THa of an attacker to complete an attack on a subtarget, where THa is the throughput of transition in the model.Secondly,THa=∑M∈HPMλa, where H is the marker set of attack transition, and λa is the rate of attack transition;Finally,T¯a=∑i=1nTai/n, where n refers to the number of subattack targets protected in the whole attack process.Figure5 shows that the average time of successful intrusion of attackers varies with the system time under different attack rates.Figure 5
Mean time for a successful attack changes in the network, withλ=1,5,10,15, respectively.We find that the attack time of attackers increases with time under different attack rates. Moreover, the higher the attack rate is, the more attack time is needed. This is because the higher the attack rate is, the easier the attack behavior is to be found. On the contrary, the smaller the attack rate is, the less it is to be found. Therefore, less time is needed for the successful attack. This result is completely in line with the actual situation.


## 5.1.3. Mean Time to Repair (MTTR) of the System

System repair time refers to the time from system failure to normal operation. If the location of the identifier in the model is regarded as a queue, the average repair time of the system can be understood as the average time of the identifier starting fromP1 and returning to P0. Therefore, we define the average repair time of the system as follows: MTTR=N¯/λ∗, where N¯ is the average length of the queue and λ∗ is the average rate of arrival of the queue.Figure6 shows the average system repair time versus system time under different attack rates.Figure 6
Mean time to repair (MTTR), withλ=1,5,10,15, respectively.As shown in Figure6, the average repair time of the system increases first and then decreases. This is because, in the initial stage of system attack, the system needs to spend a certain amount of time to find the intrusion point and then repair it. Moreover, we also found that the higher the attack rate, the longer the average repair time of the system. This is because higher intrusion frequency will bring more difficulties to the repair of the system.In addition, through the analysis of the above experiments, we should note that, in the initial stage of the attack, the lower the frequency of the attack, the smaller the intrusion time, ultimately making the average repair time of the system not lower than that of the high-frequency attack, which is an important conclusion that is easy to be ignored. From this result, we conclude that low-frequency attack behaviors will also have a serious impact on the security of the system, and sometimes even more destructive than high-frequency behaviors, because it occurs at the beginning of the attack event.


## 5.2. Overall Evaluation of Network System Security

### 5.2.1. Reliability

Reliability refers to the probability that the network system will continue to provide a certain network service within a certain period of time, and it reflects the continuity of the network system's safe operation [28]. Therefore, in the security research of the network system, we are concerned about the ability of the network system to provide certain network services normally and continuously.IfSR is the state set when the system provides a certain normal network service, and Xt represents the state of the system at time t, the mathematical expression of the instantaneous reliability Areliablittyt of the system in time 0,t is as follows.SupposeX0∈SR,τ=inft:Xt∉SR, and then Areliabilityt=Pτ>t.When performing quantitative calculations, we generally use MTTF to describe the steady-state reliability of the system, also known as the inherent reliability of the system, which can express mathematical expectations:(9)MTTF=Eτ.


### 5.2.2. Availability

Availability refers to the ability to complete the specified functions in a repairable network system in a specified manner of use and maintenance, and within a given time [29]. In the security research of the network system, we are concerned about the steady-state availability of the repairable system, which is mainly used to reflect the specific performance of the process of alternate changesnormal↔failure between the state of the network system. Suppose that Xu represents the state of the system at time u, SA is the set of the system in a normal operating state, and πi is the steady-state probability of the system at time i. Then, the mathematical expression of the steady-state availability Aavailability of the network system in time 0,t is(10)Aavailability=limt⟶∞∫0tPXu∈SAdut=∑i∈sAπi.According to the above formula and the parameter settings in Section4, we can obtain the changes of reliability and availability with system time, as shown in Figure 7.Figure 7
The changes of reliability and availability with system time.From the figure, we can clearly find that the change trend of reliability and availability is that it will gradually decrease at the beginning and then slowly rise to a certain value over time. This performance result is fully in line with the development trend of network attack events. Therefore, for network system administrators, attack behavior should be detected as early as possible, or the attack behavior can be predicted in advance, which is very important to the security of the network system.


## 5.2.1. Reliability

Reliability refers to the probability that the network system will continue to provide a certain network service within a certain period of time, and it reflects the continuity of the network system's safe operation [28]. Therefore, in the security research of the network system, we are concerned about the ability of the network system to provide certain network services normally and continuously.IfSR is the state set when the system provides a certain normal network service, and Xt represents the state of the system at time t, the mathematical expression of the instantaneous reliability Areliablittyt of the system in time 0,t is as follows.SupposeX0∈SR,τ=inft:Xt∉SR, and then Areliabilityt=Pτ>t.When performing quantitative calculations, we generally use MTTF to describe the steady-state reliability of the system, also known as the inherent reliability of the system, which can express mathematical expectations:(9)MTTF=Eτ.


## 5.2.2. Availability

Availability refers to the ability to complete the specified functions in a repairable network system in a specified manner of use and maintenance, and within a given time [29]. In the security research of the network system, we are concerned about the steady-state availability of the repairable system, which is mainly used to reflect the specific performance of the process of alternate changesnormal↔failure between the state of the network system. Suppose that Xu represents the state of the system at time u, SA is the set of the system in a normal operating state, and πi is the steady-state probability of the system at time i. Then, the mathematical expression of the steady-state availability Aavailability of the network system in time 0,t is(10)Aavailability=limt⟶∞∫0tPXu∈SAdut=∑i∈sAπi.According to the above formula and the parameter settings in Section4, we can obtain the changes of reliability and availability with system time, as shown in Figure 7.Figure 7
The changes of reliability and availability with system time.From the figure, we can clearly find that the change trend of reliability and availability is that it will gradually decrease at the beginning and then slowly rise to a certain value over time. This performance result is fully in line with the development trend of network attack events. Therefore, for network system administrators, attack behavior should be detected as early as possible, or the attack behavior can be predicted in advance, which is very important to the security of the network system.


## 6. Conclusion

This paper presents a novel modeling method for analyzing network attack events (AD-SEGPN), which can deal with the dynamic game problems in network attack and defense environment. This model not only inherits the game framework of evolutionary game theory, but also fully absorbs the advantages of stochastic Petri net, which can be used to model flexibly.Through a series of experimental analysis, we can conclude that when the system is in a stable state, the success rate of the attacker's attack has little to do with the rate of attack behavior, which is an important conclusion. According to this conclusion, for a network system, if the system has established a defense mechanism, then the administrator of the system should focus on the attacker's attack ability and his expected return, regardless of the attacker's attack frequency. In addition, we also calculate the trend of intrusion success rate, average intrusion time, and average system repair time with system time under different attack rates. The results show that, for a repairable network system, the lower the attack frequency, the greater the damage to the network, which requires the administrator of the network system to pay attention to the low-frequency detection and prevention of frequent attacks. In the future, our work will focus on optimizing models to meet the needs of more complex network environments and multiple types of network systems [30].



---

*Source: 4005877-2021-11-13.xml*