Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
Enhanced Forecasting of Equity Fund Returns Using Machine Learning
Next Article in Special Issue
Reduced-Order Model for Cell Volume Homeostasis: Application to Aqueous Humor Production
Previous Article in Journal
Application of Generalized Finite Difference Method and Radial Basis Function Neural Networks in Solving Inverse Problems of Surface Anomalous Diffusion
Previous Article in Special Issue
Efficient Finite-Difference Estimation of Second-Order Parametric Sensitivities for Stochastic Discrete Biochemical Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis and Optimal Control of Propagation Model for Malware in Multi-Cloud Environments with Impact of Brownian Motion Process

1
Department of Physics and Engineering Mathematics, Faculty of Engineering, Ain Shams University, Cairo 11517, Egypt
2
Department of Physics and Engineering Mathematics, Higher Institute of Engineering, El-Shorouk Academy, El-Shorouk City 11837, Egypt
3
Department of Mathematics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
4
Department of Mathematics, Faculty of Science, Helwan University, Cairo 11795, Egypt
5
Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria 21526, Egypt
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2025, 30(1), 8; https://doi.org/10.3390/mca30010008
Submission received: 7 October 2024 / Revised: 6 January 2025 / Accepted: 8 January 2025 / Published: 13 January 2025

Abstract

:
Today, cloud computing is a widely used technology that provides a wide range of services to numerous sectors around the world. This technology depends on the interaction and cooperation of virtual machines (VMs) to complete various computing tasks, propagating malware attacks quickly due to the complexity of cloud computing environments and users’ interfaces. As a result of the rising demand for cloud computing from multiple perspectives for complete analysis and decision-making across a range of life disciplines, multi-cloud environments (MCEs) are established. Therefore, in this work, we discuss impacted mathematical modeling for the MCEs’ network dynamics using two deterministic and stochastic approaches. In both approaches, appropriate assumptions are considered. Then, the proposed networks’ VMs are classified to have six different possible states covering media, healthcare, finance, and educational servers. After that, the two developed modeling approaches’ solution existence, uniqueness, equilibrium, and stability are carefully investigated. Using an optimal control strategy, both proposed models are tested for sustaining a certain level of security of the VMs’ states and reducing the propagation of malware within the networks. Finally, we verify the theoretical results by employing numerical simulations to track the malware’s propagation immunization. Results showed how the implemented control methods maintained the essential objectives of managing malware infections.

1. Introduction

In cloud computing, virtualization is a crucial method that enables the transcendence of temporal and physical boundaries. It accomplishes this by splitting a single physical computing resource into several virtual machines (VMs) with identical functions. This enables VM migration [1] to enable the on-demand deployment of computing resources. Regretfully, malware attacks are becoming more frequent targets for the new hidden risks that virtualization has brought about [2]. In addition to resulting in financial losses, these vulnerabilities have the potential to seriously injure people and organizations and even endanger lives [3]. Thus, investigating practical ways to protect virtual environments against malware attacks in the cloud is essential. The issue of malware spreading in cloud systems has grown in prominence due to the rapid development of the cloud computing industry [4]. Large-scale, quickly spreading, and hard-to-track-and-control malware are typical traits found in cloud systems. Furthermore, cloud providers enable users to install applications and upload items (such pictures, movies, and other documents) to the cloud. This makes it possible for hackers to infiltrate the cloud with malware like ransomware and spyware. In addition, ransomware attacks rank among the most prevalent in recent years, indicating that hackers are increasingly likely to exploit user private data for financial benefit [5]. For this purpose, numerous related efforts have been presented by researchers to control the spread of malware in cloud systems. These efforts mostly consist of malware detection, analysis of the malware propagation path, and control of the malware propagation. In cloud systems, malware detection is an essential technique for limiting the spread of malware. To detect malware, researchers currently use feature-based and machine learning-based approaches [6]. Researchers can successfully identify malware by examining its behavior and code [7]. Understanding the laws and mechanisms of malware propagation in cloud systems also requires an understanding of malware propagation paths. Furthermore, one of the most important technologies for limiting the spread of malware in cloud systems is malware propagation control. Certain models of the epidemic dynamics of malware spread have been proposed, based on comparisons between malware and biological counterparts. These models include the SEIQR model [8], the SIR1R2 model [9], the SE1E2IQR model [10], the SIWQ model [11], the SIAR model [12,13], the SEIRF model [14], the SDIQTPR model [15], and the SV1V2EIRF model [16]. These models, however, are not specifically made for cloud environments. The authors in [17] suggested a five-state dynamic model—susceptible, infected high, infected low, first recovered, and completely recovered—to enhance the security and resilience of IoT networks against malicious activities. This model offers a robust solution for mitigating cyber threats using model predictive control (MPC) to effectively manage malware propagation rates by reducing the number of infected IoT devices during periods of high infection. In [18], the authors applied a different optimal control strategy in the dynamic model in [17], considering the count of IoT devices infected during the high infection stage, costs related to executing the immediate response strategy for the restricted environment and additional security defenses, and the costs linked to the installation of the latest and most resilient cybersecurity patch during the complete recovery stage. The SPI (susceptible–protected–infected) model was presented by the authors of [19], who investigated the impact of anti-malware with infectious nodes in cloud environments. However, they made the assumption that all machines interacting with the cloud were vulnerable, which is not realistic in real-world scenarios, because the cost and efficacy of malware control are beyond the scope of this model. Moreover, the authors assert that this is the first mathematical model to investigate how anti-malware software affects malware’s ability to proliferate in cloud environments. Conversely, the susceptible–infected–protected–susceptible (SIPS) model was a novel dynamical model put forth by the authors in [20]. Nonetheless, it is important to note that this model assumes that all virtual machines (VMs) join the virtual network cleanly and were developed in an initially uninfected cloud environment.
In light of all potential devices joining the presumptive dynamic cloud network, this work introduces novel six-state VMs, deterministic and stochastic dynamic models, and four popular multi-cloud environments: media, healthcare, finance, and educational servers with solution existence, uniqueness, positiveness, and stability examination. In addition, a unique integration of assumptions in the cloud network simulates the reality of defensive behavior against malware propagation. Further, the dynamic interaction between the six-state VMs and malware propagation is fully studied and visualized. Finally, a security control function is employed to control the dynamic behavior of some states for investment loss reduction against malware propagation.
The remaining material of our work is organized as follows: Section 2 introduces the suggested deterministic dynamic model of multi-cloud environments with mathematical uniqueness and existence investigation and presents the model optimality control criteria for minimizing a predefined cost function of servers’ isolation, tracing, and protection. Section 3 investigates the constructed stochastic model of multi-cloud environments with full mathematical analysis and shows how model controllability can be achieved. Finally, Section 4 shows the two obtained models numerical results and conclusions.

2. Deterministic MMCE Model

With reference to the flowchart presented in Figure 1, we accumulate a mathematical model of malware in multi-cloud environments (MMCE) that consists of twelve ordinary differential equations. The compartments of the mathematical model are divided into susceptible servers S ( Z ) , infected academic and educational servers I 1 ( Z ) , infected healthcare servers I 2 ( Z ) , infected financial services servers I 3 ( Z ) , infected media servers I 4 ( Z ) , isolated academic and educational servers Q 1 ( Z ) , isolated healthcare servers Q 2 ( Z ) , isolated financial services servers Q 3 ( Z ) , isolated media servers Q 4 ( Z ) , traced servers T ( Z ) , semi-protected servers P 1 ( Z ) , and protected servers P 2 ( Z ) , where S ( Z ) + k = 1 4 I k ( Z ) + k = 1 4 Q k ( Z ) + T ( Z ) + k = 1 2 P k ( Z ) = N ( t ) .
Through Figure 1, the following presumptions are taken into account:
(1)
All of the involved transmission rates are positive.
(2)
New servers are added to the dynamic network in every possible network state.
(3)
The virus can only propagate across infected servers.
(4)
Susceptible servers have the ability to transition from one state to the protected one without going through further phases.
(5)
Without first going through the tracing state, isolated servers are unable to transition to the semi-protected state.
(6)
Traced servers have the ability to enter the protective state instantly.
(7)
There is a constant rate of disconnection for every server on the network.
We are now on the model formulation. The flow diagram presented in Figure 1 illustrates how the various states of the servers nodes display behaviors that may be explained by the subsequent governing equations.
System (1) presents the suggested deterministic model equations:
d S ( Z ) d Z = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) d I 1 ( Z ) d Z = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) d I 2 ( Z ) d Z = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) d I 3 ( Z ) d Z = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) d I 4 ( Z ) d Z = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) d Q 1 ( Z ) d Z = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) d Q 2 ( Z ) d Z = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) d Q 3 ( Z ) d Z = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) d Q 4 ( Z ) d Z = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) d T ( Z ) d Z = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) d P 1 ( Z ) d Z = η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) d P 2 ( Z ) d Z = η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z )
with initial conditions
S ( 0 ) = S ˘ ,   I 1 ( 0 ) = I 1 ˘ , ,   I 4 ( 0 ) = I 4 ˘ ,   Q 1 ( 0 ) = Q 1 ˘ , ,   Q 4 ( 0 ) = Q 4 ˘ ,   T ( 0 ) = T ˘ ,   P 1 ( 0 ) = P 1 ˘ ,   P 2 ( 0 ) = P 2 ˘
where the feasible region is
Ξ = { ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) R 12 + : 0 S + k = 1 4 I k + k = 1 4 Q k + T + P 1 + P 2 k = 1 12 η k / d }
Table 1 provides a comprehensive interpretation of the parameters used in the model.
Lemma 1.
The set Ξ is positive invariant and attracts all solutions in R 12 + .
Remark 1.
Let the solution set
S ( Z ) S ( Z ) ,     I 1 ( Z ) , ,   I 4 ( Z ) ,   Q 1 ( Z ) , ,   Q 4 ( Z ) ,   T ( Z ) ,   P 1 ( Z ) ,   P 2 ( Z )
Lemma 2.
Let the initial data set be S ( Z ) Z = 0 0 Ξ ; then, the solution set S ( Z ) of the model (1) is non-negative Z > 0 .
Remark 2.
Since S + k = 1 4 I k + k = 1 4 Q k + T + P 1 + P 2 = N , then all functions in model (1) are bounded,
0 S ( Z ) N ,   0 I 1 ( Z ) N , ,   0 I 4 ( Z ) N ,   0 Q 1 ( Z ) N , ,   0 Q 4 ( Z ) N 0 T ( Z ) N ,   0 P 1 ( Z ) N ,   0 P 2 ( Z ) N .

2.1. Existence and Uniqueness

The existence and uniqueness of the deterministic MMCE model solutions ((1) and (2)) are examined in this section. We apply the well-known Banach fixed-point theorem to demonstrate the existence of the solution to model one described in (3). To prove the existence and uniqueness of the solution, we execute the following: employing the integral operator 0 Z ( · ) d Z on the equations (Eqns.) in model (1) yields
S ( Z ) = S ˘ + 0 Z ( η 1 ξ 1 I 1 ( G ) S ( G ) ξ 2 I 2 ( Z ) S ( G ) ξ 3 I 3 ( G ) S ( G ) ξ 4 I 4 ( G ) S ( G ) + δ 1 I 1 ( G ) + δ 2 I 2 ( G ) + δ 3 I 3 ( G ) + δ 4 I 4 ( G ) + μ P 2 ( G ) ( α + d ) S ( G ) ) d G I 1 ( Z ) = I 1 ˘ + 0 Z η 2 + ξ 1 S ( G ) I 1 ( G ) ( δ 1 + g 1 + d ) I 1 ( G ) d G I 2 ( Z ) = I 2 ˘ + 0 Z η 3 + ξ 2 S ( G ) I 2 ( G ) ( δ 2 + g 2 + d ) I 2 ( G ) d G I 3 ( Z ) = I 3 ˘ + 0 Z η 4 + ξ 3 S ( G ) I 3 ( G ) ( δ 3 + g 3 + d ) I 3 ( G ) d G I 4 ( Z ) = I 4 ˘ + 0 Z η 5 + ξ 4 S ( G ) I 4 ( G ) ( δ 4 + g 4 + d ) I 4 ( G ) d G Q 1 ( Z ) = Q 1 ˘ + 0 Z η 6 + g 1 I 1 ( G ) ( Θ 1 + d ) Q 1 ( G ) d G Q 2 ( Z ) = Q 2 ˘ + 0 Z η 7 + g 2 I 2 ( G ) ( Θ 2 + d ) Q 2 ( G ) d G Q 3 ( Z ) = Q 3 ˘ + 0 Z η 8 + g 3 I 3 ( G ) ( Θ 3 + d ) Q 3 ( G ) d G Q 4 ( Z ) = I 2 ˘ + 0 Z η 9 + g 4 I 4 ( G ) ( Θ 4 + d ) Q 4 ( G ) d G T ( Z ) = I 2 ˘ + 0 Z ( η 10 + Θ 1 Q 1 ( G ) + Θ 2 Q 2 ( G ) + Θ 3 Q 3 ( G ) + Θ 4 Q 4 ( G ) ( a 1 + a 2 + d ) T ( G ) ) d G P 1 ( Z ) = I 2 ˘ + 0 Z η 11 + a 1 T ( G ) ( Δ + d ) P 1 ( G ) d G P 2 ( Z ) = I 2 ˘ + 0 Z η 12 + a 2 T ( G ) + Δ P 1 ( G ) + α S ( G ) ( μ + d ) P 2 ( G ) d G
For convenience, the kernels listed below are defined:
1 ( Z ,   S ( Z ) ) = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) 2 ( Z ,   I 1 ( Z ) ) = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) 3 ( Z ,   I 2 ( Z ) ) = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) 4 ( Z ,   I 3 ( Z ) ) = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) 5 ( Z ,   I 4 ( Z ) ) = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) 6 ( Z ,   Q 1 ( Z ) ) = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) 7 ( Z ,   Q 2 ( Z ) ) = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) 8 ( Z ,   Q 3 ( Z ) ) = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) 9 ( Z ,   Q 4 ( Z ) ) = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) 10 ( Z ,   T ( Z ) ) = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) 11 ( Z ,   P 1 ( Z ) ) = η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) 12 ( Z ,   P 2 ( Z ) ) = η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z )
Since S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 are non-negative bounded functions, ∃ positive values k ,   k = N 1 12 such that (s.t.)
S 1 ,   I 1 2 ,   I 2 3 ,   I 3 4 ,   I 4 5 Q 1 6 ,   Q 2 7 Q 3 8 ,   Q 4 9 ,   T 10 ,   P 1 11 ,   P 2 12 .
In light of this, Equation (3) can be expressed as
S ( Z ) = S ˘ + 0 Z 1 ( G ,   S ( G ) ) d G ,   I 1 ( Z ) = I 1 ˘ + 0 Z 2 ( G ,   I 1 ( G ) ) d G I 2 ( Z ) = I 2 ˘ + 0 Z 3 ( G ,   I 2 ( G ) ) d G ,   I 3 ( Z ) = I 3 ˘ + 0 Z 4 ( G ,   I 3 ( G ) ) d G I 4 ( Z ) = I 4 ˘ + 0 Z 5 ( G ,   I 4 ( G ) ) d G ,   Q 1 ( Z ) = Q 1 ˘ + 0 Z 6 ( G ,   Q 1 ( G ) ) d G Q 2 ( Z ) = Q 2 ˘ + 0 Z 7 ( G ,   Q 2 ( G ) ) d G ,   Q 3 ( Z ) = Q 3 ˘ + 0 Z 8 ( G ,   Q 3 ( G ) ) d G Q 4 ( Z ) = Q 4 ˘ + 0 Z 9 ( G ,   Q 4 ( G ) ) d G ,   T ( Z ) = T ˘ + 0 Z 10 ( G ,   T ( G ) ) d G P 1 ( Z ) = P 1 ˘ + 0 Z 11 ( G ,   P 1 ( G ) ) d G ,   P 2 ( Z ) = P 2 ˘ + 0 Z 12 ( G ,   P 2 ( G ) ) d G
Theorem 1.
If 0 Υ < 1 , then the kernels k ,   k = N 1 12 are contraction mappings since they fulfill the Lipschitz condition, where Υ = max 1 k 12 k .
Proof. 
Take the kernel 1 into account. If S ( Z ) and S ( Z ) ¯ are two arbitrary functions, then we obtain
1 ( Z ,   S ( Z ) ) 1 ( Z ,   S ( Z ) ¯ ) ξ 1 2 + ξ 2 3 + ξ 3 4 + ξ 4 5 + ( α + d ) S ( Z ) S ( Z ) ¯ = 1 S ( Z ) S ( Z ) ¯
For kernels k ,   k = N 2 12 , comparable outcomes are achievable:
2 ( Z ,   I 1 ( Z ) ) 2 ( Z ,   I 1 ( Z ) ¯ ) ξ 1 1 + δ 1 + g 1 + d I 1 ( Z ) I 1 ( Z ) ¯ = 2 I 1 ( Z ) I 1 ( Z ) ¯ 12 ( Z ,   P 2 ( Z ) ) 12 ( Z ,   P 2 ( Z ) ¯ ) μ + d P 2 ( Z ) P 2 ( Z ) ¯ = 12 P 2 ( Z ) P 2 ( Z ) ¯
Consequently, k ,   k = N 1 12 , satisfying the Lipschitz condition. Since 0 Υ < 1 , the kernels are contraction mappings. □
The subsequent recursive formulae are now presented using Equation (4):
S n ( Z ) = 0 Z 1 ( G ,   S n 1 ( G ) ) d G ,   Q 1 n ( Z ) = 0 Z 6 ( G ,   Q 1 n 1 ( G ) ) d G I 1 n ( Z ) = 0 Z 2 ( G ,   I 1 n 1 ( G ) ) d G ,   Q 2 n ( Z ) = 0 Z 7 ( G ,   Q 2 n 1 ( G ) ) d G I 4 n ( Z ) = 0 Z 5 ( G ,   I 4 n 1 ( G ) ) d G ,   Q 4 n ( Z ) = 0 Z 9 ( G ,   Q 4 n 1 ( G ) ) d G T n ( Z ) = 0 Z 10 ( G ,   T n 1 ( G ) ) d G ,   P 1 n ( Z ) = 0 Z 11 ( G ,   P 1 n 1 ( G ) ) d G ,   P 2 n ( Z ) = 0 Z 12 ( G ,   P 2 n 1 ( G ) ) d G
Among the recursive formulae, the following are the subtraction of two successive forms:
1 n ( Z ) = S n ( Z ) S n 1 ( Z ) = 0 Z 1 ( G ,   S n 1 ( G ) ) 1 ( G ,   S n 2 ( G ) ) d G 2 n ( Z ) = I 1 n ( Z ) I 1 n 1 ( Z ) = 0 Z 2 ( G ,   I 1 n 1 ( G ) ) 2 ( G ,   I 1 n 2 ( G ) ) d G 12 n ( Z ) = P 2 n ( Z ) P 2 n 1 ( Z ) = 0 Z 12 ( G ,   P 2 n 1 ( G ) ) 12 ( G ,   P 2 n 2 ( G ) ) d G
Consequently, it may be claimed that
S n ( Z ) = k = 1 n 1 k ( Z ) ,   I 1 n ( Z ) = k = 1 n 2 k ( Z ) , ,   P 2 n ( Z ) = k = 1 n 12 k ( Z )
Now,
1 n ( Z ) = S n ( Z ) S n 1 ( Z ) = 0 Z 1 ( G ,   S n 1 ( G ) ) 1 ( G ,   S n 2 ( G ) ) d G 0 Z 1 ( G ,   S n 1 ( G ) ) 1 ( G ,   S n 2 ( G ) ) d G 1 z S n 1 ( Z ) S n 2 ( Z ) = 1 Z 1 n 1 ( Z )
Similarly,
2 n ( Z ) 2 Z 2 n 1 ( Z ) ,   3 n ( Z ) 3 Z 3 n 1 ( Z ) ,   4 n ( Z ) 4 Z 4 n 1 ( Z ) 5 n ( Z ) 5 Z 5 n 1 ( Z ) ,   6 n ( Z ) 6 Z 6 n 1 ( Z ) ,   7 n ( Z ) 7 Z 7 n 1 ( Z ) 8 n ( Z ) 8 Z 8 n 1 ( Z ) ,   9 n ( Z ) 9 Z 9 n 1 ( Z ) ,   10 n ( Z ) 10 Z 10 n 1 ( Z ) 11 n ( Z ) 11 Z 11 n 1 ( Z ) ,   12 n ( Z ) 12 Z 12 n 1 ( Z )
Theorem 2.
A unique solution for model (1) occurs if, for a period T 0 > 0 , the following condition holds:
0 < k T 0 < 1 ,   k = N 1 12 .
Proof. 
Two items comprise the proof:
  • Existence. Model (1)’s functions are bounded, and the supplied kernels meet the Lipschitz requirements. Consequently, using (6), the subsequent inequalities may be obtained:
    1 n ( Z ) 1 Z 1 n 1 ( Z ) ( 1 Z ) 2 1 n 2 ( Z ) ( 1 Z ) n S ˘ 2 n ( Z ) 2 Z 2 n 1 ( Z ) ( 2 Z ) 2 2 n 2 ( Z ) ( 2 Z ) n I 1 ˘ 12 n ( Z ) 12 Z 12 n 1 ( Z ) ( 12 Z ) 2 12 n 2 ( Z ) ( 12 Z ) n P 2 ˘
  • The smoothness and existence of the functions specified in (6) are confirmed by the inequalities (9). Define Ψ k n ,   k = N 1 12 as the remaining terms after n iterations, that is,
    S ( Z ) S ˘ = S n ( Z ) + Ψ 1 n ,   I 1 ( Z ) I 1 ˘ = I 1 n ( Z ) + Ψ 2 n ,   I 2 ( Z ) I 2 ˘ = I 2 n ( Z ) + Ψ 3 n I 3 ( Z ) I 3 ˘ = I 3 n ( Z ) + Ψ 4 n ,   I 4 ( Z ) I 4 ˘ = I 4 n ( Z ) + Ψ 5 n ,   Q 1 ( Z ) Q 1 ˘ = Q 1 n ( Z ) + Ψ 6 n Q 2 ( Z ) Q 2 ˘ = Q 2 n ( Z ) + Ψ 7 n ,   Q 3 ( Z ) Q 3 ˘ = Q 3 n ( Z ) + Ψ 8 n ,   Q 4 ( Z ) Q 4 ˘ = Q 4 n ( Z ) + Ψ 9 n T ( Z ) T ˘ = T n ( Z ) + Ψ 10 n ,   P 1 ( Z ) P 1 ˘ = P 1 n ( Z ) + Ψ 11 n ,   P 2 ( Z ) P 2 ˘ = P 2 n ( Z ) + Ψ 12 n
  • Using the Lipschitz condition for 1 , we obtain
Ψ 1 n ( Z ) = 0 Z 1 ( G ,   S ( G ) ) 1 ( G ,   S n 1 ( G ) ) d G 1 Z S ( Z ) S n 1 ( Z ) ( 1 Z ) n 1
  • Setting Z = T 0 , we obtain
Ψ 1 n ( Z ) ( 1 T 0 ) n 1
  • Ψ 1 n ( Z ) 0 is obtained by taking the limit of inequality (10) as n and applying the constraint 0 < 1 T 0 < 1 . This means that lim n S n ( Z ) = S ( Z ) S ˘ . In a similar manner, the following inequalities are obtained:
Ψ 2 n ( Z ) ( 2 T 0 ) n 2 ,   Ψ 3 n ( Z ) ( 3 T 0 ) n 3 ,   Ψ 4 n ( Z ) ( 4 T 0 ) n 4 ,   Ψ 5 n ( Z ) ( 5 T 0 ) n 5 Ψ 6 n ( Z ) ( 6 T 0 ) n 6 ,   Ψ 7 n ( Z ) ( 7 T 0 ) n 7 ,   Ψ 8 n ( Z ) ( 8 T 0 ) n 8 ,   Ψ 9 n ( Z ) ( 9 T 0 ) n 9 Ψ 10 n ( Z ) ( 10 T 0 ) n 10 ,   Ψ 11 n ( Z ) ( 11 T 0 ) n 11 ,   Ψ 12 n ( Z ) ( 12 T 0 ) n 12
  • Hence, Ψ k n ( Z ) 0 ,   k = N 1 12 , as n . System (1)’s existence is thus established.
  • Uniqueness. Let X and Y be the solution sets to the model (1) s.t.
X = S ( Z ) ,   I 1 ( Z ) , ,   I 4 ( Z ) ,   Q 1 ( Z ) , ,   Q 4 ( Z ) ,   T ( Z ) ,   P 1 ( Z ) ,   P 2 ( Z ) Y = S ˜ ( Z ) ,   I 1 ˜ ( Z ) , ,   I 4 ˜ ( Z ) ,   Q 1 ˜ ( Z ) , ,   Q 4 ˜ ( Z ) ,   T ˜ ( Z ) ,   P 1 ˜ ( Z ) ,   P 2 ˜ ( Z )
  • Then, using 0 < 1 T 0 < 1 , we obtain
S ( Z ) S ˜ ( Z ) 1 Z S ( Z ) S ˜ ( Z )
  • So, ( 1 1 Z ) S ( Z ) S ˜ ( Z ) 0 . At last, one obtains S ( Z ) S ˜ ( Z ) = 0 , that is, S ( Z ) S ˜ ( Z ) . In the same way, we can obtain
I 1 ( Z ) I 1 ˜ ( Z ) ,   ,   P 2 ( Z ) P 2 ˜ ( Z )
It is demonstrated that model (1)’s solutions are unique.

2.2. Equilibrium Points and Stability Analysis

To calculate the equilibrium points of the proposed deterministic model (1), set the right side of the modeling equations to zero.
d S ( Z ) d Z = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) = 0 d I 1 ( Z ) d Z = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) = 0 d P 2 ( Z ) d Z = η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z ) = 0
The malware-free equilibrium point is provided by
M F 0 η 1 ( μ + d ) + η 12 μ d 2 + α d + μ d ,   0 ,   0 ,   0 ,   0 ,   0 ,   0 ,   0 ,   0 ,   0 ,   0 ,   η 1 α + η 12 ( α + d ) d 2 + α d + μ d .
The endemic equilibrium points are represented by
M E * S * ,   I 1 * , ,   I 4 * ,   Q 1 * , ,   Q 4 * ,   T * ,   P 1 * ,   P 2 * ,  
which may be found by concurrently solving the set of Equation (11). Discussions on the stability of the proposed model with regard to equilibrium points are particularly problematic because of its significantly higher dimension. As a result, we shall examine the stability analysis using R 0 as the basic reproduction number of model given by (1), approached through the next-generation matrix technique [21].
R 0 = k = 1 4 g k ξ k ( η 1 ( μ + d ) + η 12 μ ) ( Θ k + d ) ( δ k + g k + d ) ( d 2 + α d + μ d )
Theorem 3.
The malware-free equilibrium ( M F 0 ) of the deterministic model (1) is locally asymptotically stable if R 0 < 1 and unstable if R 0 > 1 .

2.3. Analyzing Optimal Control

Malware attacks are starting to have an increasing impact on global economies, resulting in significant direct losses such as labor charges, expenses for removing and fixing malware from systems, lost user productivity, income from malfunctioning or decaying systems, and other costs directly associated with a malware attack. To effectively prevent malware attacks and safeguard against malware threats, both individuals and corporations use protective barriers and regularly update anti-malware software. Nevertheless, these precautionary measures come at a substantial security cost. Our objective is to reduce total investment costs as well as direct losses from security investments, which makes it plausible to claim that the quantity of infected devices correlates with the amount of money lost due to malware. Additionally, we assume that user security awareness can result in maintaining a certain control on the isolated, traced, and semi-protected servers. So, let us define the next optimum control (O.C.) problem to maximize the ensuing objective functional (O.F.):
J ( Δ ( Z ) ) = 0 T C 1 T ( Z ) + C 2 k = 1 4 Q k ( Z ) + C 3 P 1 ( Z ) + C 4 2 Δ 2 ( Z ) d Z
subject to
d S ( Z ) d Z = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) d I 1 ( Z ) d Z = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) d I 2 ( Z ) d Z = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) d I 3 ( Z ) d Z = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) d I 4 ( Z ) d Z = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) d Q 1 ( Z ) d Z = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) d Q 2 ( Z ) d Z = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) d Q 3 ( Z ) d Z = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) d Q 4 ( Z ) d Z = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) d T ( Z ) d Z = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) d P 1 ( Z ) d Z = η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) d P 2 ( Z ) d Z = η 12 + a 2 T ( Z ) + α S ( Z ) + Δ P 1 ( Z ) ( μ + d ) P 2 ( Z )
where C 1 is the public awareness coefficient of tracing servers per unit time, C 2 is the public awareness coefficient of isolated servers per unit time, C 3 is the public awareness coefficient of semi-protected servers per unit time, and C 4 is the awareness coefficient of semi-protected servers due to heavy infections, and the total maintained security level is symbolized by J ( Δ ) . The controller objective framework is as indicated in Figure 2.
To obtain an optimum solution for the O.C. problems ((12) and (13)), we need to provide the Lagrangian and Hamiltonian. In actuality, the Lagrangian of the optimal problem is supplied by
L ( T ,   Q 1 , ,   Q 4 ,   P 1 ,   Δ ) = C 1 T ( Z ) + C 2 k = 1 4 Q k ( Z ) + C 3 P 1 ( Z ) + C 4 2 Δ 2 ( Z )
Next, we need to choose a suitable Δ ( Z ) s.t. the Lagrangian integral discussed before achieves its minimum. This may be accomplished by defining the Hamiltonian H of the control problem as follows:
H ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ,   Δ ,   ζ 1 , ,   ζ 12 ,   Z ) = L ( T ,   Q 1 , ,   Q 4 ,   P 1 ,   Δ ) + [ ζ 1 d S ( Z ) d Z + ζ 2 d I 1 ( Z ) d z + ζ 3 d I 2 ( Z ) d z + ζ 4 d I 3 ( Z ) d z + ζ 5 d I 4 ( Z ) d z + ζ 6 d Q 1 ( Z ) d Z + ζ 7 d Q 2 ( Z ) d Z + ζ 8 d Q 3 ( Z ) d Z + ζ 9 d Q 4 ( Z ) d Z + ζ 10 d T ( Z ) d Z + ζ 11 d P 1 ( Z ) d Z + ζ 12 d P 2 ( Z ) d Z ]
with ζ k ,   k = N 1 12 representing the adjoint variables that need to be appropriately estimated.
Theorem 4.
For the O.C. problem ((12) and (13)), let S ^ ,   I 1 ^ , ,   P 1 ^ and P 2 ^ be the optimal state solutions linked to the O.C. variable Δ ^ . Following that, adjoint variables ζ k ,   k = N 1 12 exist and they all fulfill
d ζ 1 ( Z ) d Z = ζ 1 k = 1 4 ξ k I k ^ + α + d ζ 2 ξ 1 I 1 ^ ζ 3 ξ 2 I 2 ^ ζ 4 ξ 3 I 3 ^ ζ 5 ξ 4 I 4 ^ ζ 12 α d ζ 2 ( Z ) d Z = ζ 1 ( ξ 1 S ^ δ 1 ) ζ 2 ( ξ 1 S ^ δ 1 g 1 d ) ζ 6 g 1 d ζ 3 ( Z ) d Z = ζ 1 ( ξ 2 S ^ δ 2 ) ζ 3 ( ξ 2 S ^ δ 2 g 2 d ) ζ 7 g 2 d ζ 4 ( Z ) d Z = ζ 1 ( ξ 3 S ^ δ 3 ) ζ 4 ( ξ 3 S ^ δ 3 g 3 d ) ζ 8 g 3 d ζ 5 ( Z ) d Z = ζ 1 ( ξ 4 S ^ δ 4 ) ζ 5 ( ξ 4 S ^ δ 4 g 4 d ) ζ 9 g 4 d ζ 6 ( Z ) d Z = ζ 6 ( Θ 1 + d ) ζ 10 Θ 1 C 2 d ζ 7 ( Z ) d Z = ζ 7 ( Θ 2 + d ) ζ 10 Θ 2 C 2 d ζ 8 ( Z ) d Z = ζ 8 ( Θ 3 + d ) ζ 10 Θ 3 C 2 d ζ 9 ( Z ) d Z = ζ 9 ( Θ 3 + d ) ζ 10 Θ 3 C 2 d ζ 10 ( Z ) d Z = ζ 10 ( a 1 + a 2 + d ) ζ 11 a 1 ζ 12 a 2 C 1 d ζ 11 ( Z ) d Z = ζ 11 ( Δ + d ) ζ 12 Δ C 3 d ζ 12 ( Z ) d Z = ζ 12 ( μ + d ) ζ 1 μ
with
ζ k ( T ) = 0 ,   k = N 1 12
Additionally, the optimal control Δ ^ ( Z ) is provided by
Δ ^ ( Z ) = max min 0 ,   ζ 11 ζ 12 C 4 P 1 ^ ,   1
Proof. 
First, the Hamiltonian (14) is utilized to create the adjoint equations. Let S ( Z ) = S ^ ( Z ) , I 1 ( Z ) = I 1 ^ ( Z ) , ⋯, P 2 ( Z ) = P 2 ^ ( Z ) , and we obtain
d ζ 1 ( Z ) d Z = H S = ζ 1 k = 1 4 ξ k I k ^ + α + d ζ 2 ξ 1 I 1 ^ ζ 3 ξ 2 I 2 ^ ζ 4 ξ 3 I 3 ^ ζ 5 ξ 4 I 4 ^ ζ 12 α d ζ 2 ( Z ) d Z = H I 1 = ζ 1 ( ξ 1 S ^ δ 1 ) ζ 2 ( ξ 1 S ^ δ 1 g 1 d ) ζ 6 g 1 d ζ 3 ( Z ) d Z = H I 2 = ζ 1 ( ξ 2 S ^ δ 2 ) ζ 3 ( ξ 2 S ^ δ 2 g 2 d ) ζ 7 g 2 d ζ 4 ( Z ) d Z = H I 3 = ζ 1 ( ξ 3 S ^ δ 3 ) ζ 4 ( ξ 3 S ^ δ 3 g 3 d ) ζ 8 g 3 d ζ 5 ( Z ) d Z = H I 4 = ζ 1 ( ξ 4 S ^ δ 4 ) ζ 5 ( ξ 4 S ^ δ 4 g 4 d ) ζ 9 g 4 d ζ 6 ( Z ) d Z = H Q 1 = ζ 6 ( Θ 1 + d ) ζ 10 Θ 1 C 2 d ζ 7 ( Z ) d Z = H Q 2 = ζ 7 ( Θ 2 + d ) ζ 10 Θ 2 C 2 d ζ 8 ( Z ) d Z = H Q 3 = ζ 8 ( Θ 3 + d ) ζ 10 Θ 3 C 2 d ζ 9 ( Z ) d Z = H Q 4 = ζ 9 ( Θ 4 + d ) ζ 10 Θ 4 C 2 d ζ 10 ( Z ) d Z = H T = ζ 10 ( a 1 + a 2 + d ) ζ 11 a 1 ζ 12 a 2 C 1 d ζ 11 ( Z ) d Z = H P 1 = ζ 11 ( Δ + d ) ζ 12 Δ C 3 d ζ 12 ( Z ) d Z = H P 2 = ζ 12 ( μ + d ) ζ 1 μ
By virtue of the optimality criteria, we have
H Δ Δ = Δ ^ = C 4 Δ ^ ( Z ) ζ 11 P 1 ^ ( Z ) + ζ 12 P 1 ^ ( Z ) = 0
The identification indicated above suggests that
Δ ^ ( Z ) = ζ 11 ζ 12 C 4 P 1 ^
Hence,
Δ ^ ( Z ) = 0 ,   H Δ > 0 ζ 11 ζ 12 C 4 P 1 ^ ,   H Δ = 0 1 ,   H Δ < 0
Consequently, Δ ^ ( Z ) is the optimal control, and it may be represented in the concise notation that follows:
Δ ^ ( Z ) = max min 0 ,   ζ 11 ζ 12 C 4 P 1 ^ ,   1
Here, the optimum control is characterized by Formula (17) for Δ ^ . The characterization of the optimal control (17), the adjoint system (15) and (16), the state system (13) with boundary conditions, and the optimality system can be solved to yield the optimum control and states. To solve the optimality system, we incorporate the characterization of the optimum control Δ ^ given by (17) along with the transversality and initial conditions. By changing the Δ ^ values in the control system, the following system is produced for the state system (13).
d S ( Z ) d Z = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) d I 1 ( Z ) d Z = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) d I 2 ( Z ) d Z = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) d I 3 ( Z ) d Z = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) d I 4 ( Z ) d Z = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) d Q 1 ( Z ) d Z = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) d Q 2 ( Z ) d Z = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) d Q 3 ( Z ) d Z = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) d Q 4 ( Z ) d Z = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) d T ( Z ) d Z = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) d P 1 ( Z ) d Z = η 11 + a 1 T ( Z ) max min 0 ,   ζ 11 ζ 12 C 4 P 1 ^ ,   1 + d P 1 ( Z ) d P 2 ( Z ) d Z = η 12 + a 2 T ( Z ) + max min 0 ,   ζ 11 ζ 12 C 4 P 1 ^ ,   1 P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z )
The goal is to determine the optimal control and state system by numerically solving the aforementioned system (18). □

3. Stochastic MMCE Model

Ecologists and biologists argue that a variety of environmental disturbances, including temperature, water availability, and climate change, inevitably impact the spread of infectious diseases, human contact, human movement, and other processes [22,23,24]. In contrast, the deterministic model mentioned above does not account for the contributions of random variables. Furthermore, as far as continuous-time system modeling is concerned, Brownian motion, or B.M., is the preferred method for modeling random motion and noise. Based on B.M.’s strong statistical features, this decision is well founded. One may solve the B.M. issue with the aid of strong analytical methods, as well as finite moments of all orders and continuous sample-path trajectories. Even complicated systems with a high degree of unpredictability as a result of applied external noise are discussed using stochastic models. We designed the stochastic model to generate realistic curves characterizing malware in multi-cloud configurations. Further originality is brought to our article by this modeling method. One generates the stochastic model by first adding white noise aspects to each of the deterministic model equations. The terminologies that have been defined now encompass a wider spectrum of potential viral dynamics and more probable situations. Following the addition of the additional stochastic components, the resulting model equations are as described in the model ((19) and (20)).
d S ( Z ) d Z = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) I 2 ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) + κ S ( Z ) d W d Z d I 1 ( Z ) d Z = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) + κ I 1 ( Z ) d W d Z d I 2 ( Z ) d Z = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) + κ I 2 ( Z ) d W d Z d I 3 ( Z ) d Z = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) + κ I 3 ( Z ) d W d Z d I 4 ( Z ) d Z = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) + κ I 4 ( Z ) d W d Z d Q 1 ( Z ) d Z = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) + κ Q 1 ( Z ) d W d Z d Q 2 ( Z ) d Z = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) + κ Q 2 ( Z ) d W d Z d Q 3 ( Z ) d Z = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) + κ Q 3 ( Z ) d W d Z d Q 4 ( Z ) d Z = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) + κ Q 4 ( Z ) d W d Z d T ( Z ) d Z = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) + κ T ( Z ) d W d Z d P 1 ( Z ) d Z = η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) + κ P 1 ( Z ) d W d Z d P 2 ( Z ) d Z = η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z ) + κ P 2 ( Z ) d W d Z
with initial conditions
S ( 0 ) = S 0 ,   I 1 ( 0 ) = I 1 0 , ,   P 2 ( 0 ) = P 2 0
where W ( Z ) is a standard Brownian motion process and κ > 0 .

3.1. Existence and Uniqueness of Positive Solution

Theorem 5.
For any initial condition ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( 0 ) R 12 + , there is a unique global positive solution ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( Z ) for stochastic model (19), which will be maintained in R 12 + with probability one.
Proof. 
Since the state variables’ initial conditions are known to satisfy
  • ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( 0 ) R 12 + , the coefficients given in Equation (19) are defined and locally Lipschitzian. So, there lies a local unique solution
  • ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( Z ) of the problem over Z [ 0 ,   ϑ e ) . In order to determine the solution’s global nature, we must demonstrate that ϑ e = almost surely (a.s.). Assume that we have a sufficiently large, non-negative number ϱ 0 , and that all initial approximations of the state variables are given within [ 1 ϱ 0 ,   ϱ 0 ] . For every non-negative integer ϱ ϱ 0 , let the time required to reach completion be given as
ϑ ϱ = { Z [ 0 ,   ϑ e ) : min ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( Z ) 1 ϱ o r max ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( Z ) }
the choice of inf χ = is considered, where χ is for an empty set. From the result of ϑ ϱ , we know that this grows as ϱ . Set ϑ = lim ϱ ϑ ϱ and ϑ e ϑ a.s., showing ϑ = a.s. Consider the subsequent non-negative C 2 -function Ψ :
Ψ ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) = S 1 ln S + I 1 1 ln I 1 + I 2 1 ln I 2 + I 3 1 ln I 3 + I 4 1 ln I 4 + Q 1 1 ln Q 1 + Q 2 1 ln Q 2 + Q 3 1 ln Q 3 + Q 4 1 ln Q 4 + T 1 ln T + P 1 1 ln P 1 + P 2 1 ln P 2
Utilizing It o ^ ’s formula yields
d Ψ = L Ψ d Z + κ ( S 1 ) d W + κ ( I 1 1 ) d W + κ ( I 2 1 ) d W + κ ( I 3 1 ) d W + κ ( I 4 1 ) d W + κ ( Q 1 1 ) d W + κ ( Q 2 1 ) d W + κ ( Q 3 1 ) d W + κ ( Q 4 1 ) d W + κ ( T 1 ) d W + κ ( P 1 1 ) d W + κ ( P 2 1 ) d W
where
L Ψ = 1 1 S ( η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) ) + κ 2 2 + 1 1 I 1 η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) + κ 2 2 + 1 1 I 2 η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) + κ 2 2 + 1 1 I 3 η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) + κ 2 2 + 1 1 I 4 η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) + κ 2 2 + 1 1 Q 1 η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) + κ 2 2 + 1 1 Q 2 η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) + κ 2 2 + 1 1 Q 3 η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) + κ 2 2 + 1 1 Q 4 ( η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) ) + κ 2 2 + 1 1 T η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) + κ 2 2 + 1 1 P 1 η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) + κ 2 2 + 1 1 P 2 η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z ) + κ 2 2 K ,  
and
K : = k = 1 12 η k + k = 1 4 δ k + g k + Θ k + ξ k + α + μ + Δ + a 1 + a 2 + 12 d + 6 κ 2
where the constant K > 0 . The approach of proof is the same as in [24], and the remaining proof is omitted. □

3.2. Extinction

Theorem 6.
The solution of model (19) with initial condition ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( 0 ) can be represented as ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ) ( Z ) ; then
lim sup Z S ( Z ) + k = 1 4 I k ( Z ) + k = 1 4 Q k ( Z ) + T ( Z ) + P 1 ( Z ) + P 2 ( Z ) < ,   a . s . lim Z S ( Z ) Z = 0 ,   lim Z I 1 ( Z ) Z = 0 , ,   lim Z I 4 ( Z ) Z = 0 ,   lim Z Q 1 ( Z ) Z = 0 , ,   lim Z Q 4 ( Z ) Z = 0 ,   lim Z T ( Z ) Z = 0 ,   lim Z P 1 ( Z ) Z = 0 ,   lim Z P 2 ( Z ) Z = 0 ,  
Furthermore, when d > κ 2 / 2 holds, then
lim Z 1 Z 0 Z S ( G ) d W ( Z ) = 0 ,   lim Z 1 Z 0 Z I 1 ( G ) d W ( Z ) = 0 , ,   lim Z 1 Z 0 Z I 4 ( G ) d W ( Z ) = 0 ,   lim Z 1 Z 0 Z Q 1 ( G ) d W ( Z ) = 0 , ,   lim Z 1 Z 0 Z Q 4 ( G ) d W ( Z ) = 0 ,   lim Z 1 Z 0 Z T ( G ) d W ( Z ) = 0 ,   lim Z 1 Z 0 Z P 1 ( G ) d W ( Z ) = 0 ,   lim Z 1 Z 0 Z P 2 ( G ) d W ( Z ) = 0 ,   a . s .
Proof. 
The derivation of Theorem 6 is similar to [23]; thus, we skip it. □

3.3. Optimal Control Analysis

In order to avoid complexity, we take a vector of the type
X : = [ S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ] T r
where T r is the transpose, and
d X ( Z ) = ( X ,   Δ ) d Z + M ( X ) d W ( Z )
where
1 ( X ,   Δ ) = η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) 2 ( X ,   Δ ) = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) 3 ( X ,   Δ ) = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) 4 ( X ,   Δ ) = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) 5 ( X ,   Δ ) = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) 6 ( X ,   Δ ) = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) 7 ( X ,   Δ ) = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) 8 ( X ,   Δ ) = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) 9 ( X ,   Δ ) = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) 10 ( X ,   Δ ) = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) 11 ( X ,   Δ ) = η 11 + a 1 T ( Z ) ( Δ + d ) P 1 ( Z ) 12 ( X ,   Δ ) = η 12 + a 2 T ( Z ) + Δ P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z ) ,  
M 1 = κ S ,   M 2 = κ I 1 ,   M 3 = κ I 2 ,   M 4 = κ I 3 ,   M 5 = κ I 4 ,   M 6 = κ Q 1 ,   M 7 = κ Q 2 ,   M 8 = κ Q 3 ,   M 9 = κ Q 4 ,   M 10 = κ T ,   M 11 = κ P 1 ,   M 12 = κ P 2
We provide an optimum control (O.C.) problem to maximize the ensuing objective functional (O.F.)
J ( Δ ( Z ) ) = E 0 T C 1 T ( Z ) + C 2 k = 1 4 Q k ( Z ) + C 3 P 1 ( Z ) + C 4 2 Δ 2 ( Z ) d Z
subject to
d X ( Z ) = ( X ,   Δ ) d Z + M ( X ) d W ( Z )
where C 1 is the public awareness coefficient of tracing servers per unit time, C 2 is the public awareness coefficient of isolated servers per unit time, C 3 is the public awareness coefficient of semi-protected servers per unit time, and C 4 is the awareness coefficient of semi-protected servers due to heavy infections, and the total maintained security level is symbolized by J ( Δ ) . To obtain an optimum solution for the O.C. problems ((21)–(22)), we need to provide the Lagrangian and Hamiltonian. In actuality, the Lagrangian of the optimal problem is supplied by
L ( T ,   Q 1 , ,   Q 4 ,   P 1 ,   Δ ) = C 1 T ( Z ) + C 2 k = 1 4 Q k ( Z ) + C 3 P 1 ( Z ) + C 4 2 Δ 2 ( Z )
Next, we need to choose a suitable Δ ( Z ) s.t. the Lagrangian integral discussed before achieves its maximum. This may be accomplished by defining the Hamiltonian H of the control problem as follows:
H ( S ,   I 1 , ,   I 4 ,   Q 1 , ,   Q 4 ,   T ,   P 1 ,   P 2 ,   Δ ,   β 1 , ,   β 12 ,   γ 1 , ,   γ 12 ,   Z ) = L ( T ,   Q 1 , ,   Q 4 ,   P 1 ,   Δ ) + [ β 1 d S ( Z ) d Z + β 2 d I 1 ( Z ) d z + β 3 d I 2 ( Z ) d z + β 4 d I 3 ( Z ) d z + β 5 d I 4 ( Z ) d z + β 6 d Q 1 ( Z ) d Z + β 7 d Q 2 ( Z ) d Z + β 8 d Q 3 ( Z ) d Z + β 9 d Q 4 ( Z ) d Z + β 10 d T ( Z ) d Z + β 11 d P 1 ( Z ) d Z + β 12 d P 2 ( Z ) d Z ] + [ κ S γ 1 + κ I 1 γ 2 + κ I 2 γ 3 + κ I 3 γ 4 + κ I 4 γ 5 + κ Q 1 γ 6 + κ Q 2 γ 7 + κ Q 3 γ 8 + κ Q 4 γ 9 + κ T γ 10 + κ P 1 γ 11 + κ P 2 γ 12 ]
The adjoint variables are represented by β k ,   k = N 1 12 and γ k ,   k = N 1 12 .
Theorem 7.
For the O.C. problem ((21)–(22)), let S ^ ,   I 1 ^ , ,   I 4 ^ ,   Q 1 ^ , ,   Q 4 ^ ,   T ^ ,   P 1 ^ , and P 2 ^ be the optimal state solutions linked to the O.C. variable Δ ^ . Following that, adjoint variables β k ,   k = N 1 12 exist and they all fulfill
d β 1 ( Z ) = β 1 k = 1 4 ξ k I k ^ + α + d β 2 ξ 1 I 1 ^ β 3 ξ 2 I 2 ^ β 4 ξ 3 I 3 ^ β 5 ξ 4 I 4 ^ β 12 α + κ γ 1 d Z + γ 1 d W d β 2 ( Z ) = β 1 ( ξ 1 S ^ δ 1 ) β 2 ( ξ 1 S ^ δ 1 g 1 d ) β 6 g 1 + κ γ 2 d Z + γ 2 d W d β 3 ( Z ) = β 1 ( ξ 2 S ^ δ 2 ) β 3 ( ξ 2 S ^ δ 2 g 2 d ) β 7 g 2 + κ γ 3 d Z + γ 3 d W d β 4 ( Z ) = β 1 ( ξ 3 S ^ δ 3 ) β 4 ( ξ 3 S ^ δ 3 g 3 d ) β 8 g 3 + κ γ 4 d Z + γ 4 d W d β 5 ( Z ) = β 1 ( ξ 4 S ^ δ 4 ) β 5 ( ξ 4 S ^ δ 4 g 4 d ) β 9 g 4 + κ γ 5 d Z + γ 5 d W d β 6 ( Z ) = β 6 ( Θ 1 + d ) β 10 Θ 1 C 2 + κ γ 6 d Z + γ 6 d W d β 7 ( Z ) = β 7 ( Θ 2 + d ) β 10 Θ 2 C 2 + κ γ 7 d Z + γ 7 d W d β 8 ( Z ) = β 8 ( Θ 3 + d ) β 10 Θ 3 C 2 + κ γ 8 d Z + γ 8 d W d β 9 ( Z ) = β 9 ( Θ 4 + d ) β 10 Θ 4 C 2 + κ γ 9 d Z + γ 9 d W d β 10 ( Z ) = β 10 ( a 1 + a 2 + d ) β 11 a 1 β 12 a 2 C 1 + κ γ 10 d Z + γ 10 d W d β 11 ( Z ) = β 11 ( Δ + d ) β 12 Δ C 3 + κ γ 11 d Z + γ 11 d W d β 12 ( Z ) = β 12 ( μ + d ) β 1 μ + κ γ 12 d Z + γ 12 d W
with
β k ( T ) = 0 ,   k = N 1 12
Additionally, the optimal control Δ ^ ( Z ) is provided by
Δ ^ ( Z ) = max min 0 ,   β 11 β 12 C 4 P 1 ^ ,   1
Proof. 
First, the Hamiltonian (23) is utilized to create the adjoint equations. Let S ( Z ) = S ^ ( Z ) , I 1 ( Z ) = I 1 ^ ( Z ) , ⋯, P 2 ( Z ) = P 2 ^ ( Z ) , and we obtain
d β 1 ( Z ) = H S d Z + γ 1 d W = [ β 1 k = 1 4 ξ k I k ^ + α + d β 2 ξ 1 I 1 ^ β 3 ξ 2 I 2 ^ β 4 ξ 3 I 3 ^ β 5 ξ 4 I 4 ^ β 12 α + κ γ 1 ] d Z + γ 1 d W d β 2 ( Z ) = H I 1 d Z + γ 2 d W = β 1 ( ξ 1 S ^ δ 1 ) β 2 ( ξ 1 S ^ δ 1 g 1 d ) β 6 g 1 + κ γ 2 d Z + γ 2 d W d β 3 ( Z ) = H I 2 d Z + γ 3 d W = β 1 ( ξ 2 S ^ δ 2 ) β 3 ( ξ 2 S ^ δ 2 g 2 d ) β 7 g 2 + κ γ 3 d Z + γ 3 d W d β 4 ( Z ) = H I 3 d Z + γ 4 d W = β 1 ( ξ 3 S ^ δ 3 ) β 4 ( ξ 3 S ^ δ 3 g 3 d ) β 8 g 3 + κ γ 4 d Z + γ 4 d W d β 5 ( Z ) = H I 4 d Z + γ 5 d W = β 1 ( ξ 4 S ^ δ 4 ) β 5 ( ξ 4 S ^ δ 4 g 4 d ) β 9 g 4 + κ γ 5 d Z + γ 5 d W d β 6 ( Z ) = H Q 1 d Z + γ 6 d W = β 6 ( Θ 1 + d ) β 10 Θ 1 C 2 + κ γ 6 d Z + γ 6 d W d β 7 ( Z ) = H Q 2 d Z + γ 7 d W = β 7 ( Θ 2 + d ) β 10 Θ 2 C 2 + κ γ 7 d Z + γ 7 d W d β 8 ( Z ) = H Q 3 d Z + γ 8 d W = β 8 ( Θ 3 + d ) β 10 Θ 3 C 2 + κ γ 8 d Z + γ 8 d W d β 9 ( Z ) = H Q 4 d Z + γ 9 d W = β 9 ( Θ 3 + d ) β 10 Θ 3 C 2 + κ γ 9 d Z + γ 9 d W d β 10 ( Z ) = H T d Z + γ 10 d W = β 10 ( a 1 + a 2 + d ) β 11 a 1 β 12 a 2 C 1 + κ γ 10 d Z + γ 10 d W d β 11 ( Z ) = H P 1 d Z + γ 11 d W = β 11 ( Δ + d ) β 12 Δ C 3 + κ γ 11 d Z + γ 11 d W d β 12 ( Z ) = H P 2 d Z + γ 12 d W = β 12 ( μ + d ) β 1 μ + κ γ 12 d Z + γ 12 d W
As a consequence of the optimality criteria, we have
H Δ Δ = Δ ^ = C 4 Δ ^ ( Z ) β 11 P 1 ^ ( Z ) + β 12 P 1 ^ ( Z ) = 0
The identification indicated above suggests that
Δ ^ ( Z ) = β 11 β 12 C 4 P 1 ^
Hence,
Δ ^ ( Z ) = 0 ,   H Δ > 0 β 11 β 12 C 4 P 1 ^ ,   H Δ = 0 1 ,   H Δ < 0
Consequently, Δ ^ ( Z ) is the optimal control, and it may be represented in the concise notation that follows:
Δ ^ ( Z ) = max min 0 ,   β 11 β 12 C 4 P 1 ^ ,   1
Here, the optimum control is characterized by Formula (26) for Δ ^ . The characterization of the optimal control (26), the adjoint system (24) and (25), the state system (22) with boundary conditions, and the optimality system can be solved to yield the optimum control and states. To solve the optimality system, we incorporate the characterization of the optimum control Δ ^ given by (26) along with the transversality and initial conditions. By changing the Δ ^ values in the control system, the following system is produced for the state system (22).
d S ( Z ) = [ η 1 ξ 1 I 1 ( Z ) S ( Z ) ξ 2 I 2 ( Z ) S ( Z ) ξ 3 I 3 ( Z ) S ( Z ) ξ 4 I 4 ( Z ) S ( Z ) + δ 1 I 1 ( Z ) + δ 2 I 2 ( Z ) + δ 3 I 3 ( Z ) + δ 4 I 4 ( Z ) + μ P 2 ( Z ) ( α + d ) S ( Z ) ] d Z + κ S ( Z ) d W d I 1 ( Z ) = η 2 + ξ 1 S ( Z ) I 1 ( Z ) ( δ 1 + g 1 + d ) I 1 ( Z ) d Z + κ I 1 ( Z ) d W d I 2 ( Z ) = η 3 + ξ 2 S ( Z ) I 2 ( Z ) ( δ 2 + g 2 + d ) I 2 ( Z ) d Z + κ I 2 ( Z ) d W d I 3 ( Z ) = η 4 + ξ 3 S ( Z ) I 3 ( Z ) ( δ 3 + g 3 + d ) I 3 ( Z ) d Z + κ I 3 ( Z ) d W d I 4 ( Z ) = η 5 + ξ 4 S ( Z ) I 4 ( Z ) ( δ 4 + g 4 + d ) I 4 ( Z ) d Z + κ I 4 ( Z ) d W d Q 1 ( Z ) = η 6 + g 1 I 1 ( Z ) ( Θ 1 + d ) Q 1 ( Z ) d Z + κ Q 1 ( Z ) d W d Q 2 ( Z ) = η 7 + g 2 I 2 ( Z ) ( Θ 2 + d ) Q 2 ( Z ) d Z + κ Q 2 ( Z ) d W d Q 3 ( Z ) = η 8 + g 3 I 3 ( Z ) ( Θ 3 + d ) Q 3 ( Z ) d Z + κ Q 3 ( Z ) d W d Q 4 ( Z ) = η 9 + g 4 I 4 ( Z ) ( Θ 4 + d ) Q 4 ( Z ) d Z + κ Q 4 ( Z ) d W d T ( Z ) = η 10 + Θ 1 Q 1 ( Z ) + Θ 2 Q 2 ( Z ) + Θ 3 Q 3 ( Z ) + Θ 4 Q 4 ( Z ) ( a 1 + a 2 + d ) T ( Z ) d Z + κ T ( Z ) d W d P 1 ( Z ) = η 11 + a 1 T ( Z ) max min 0 ,   β 11 β 12 C 4 P 1 ^ ,   1 + d P 1 ( Z ) d Z + κ P 1 ( Z ) d W d P 2 ( Z ) = η 12 + a 2 T ( Z ) + max min 0 ,   β 11 β 12 C 4 P 1 ^ ,   1 P 1 ( Z ) + α S ( Z ) ( μ + d ) P 2 ( Z ) d Z + κ P 2 ( Z ) d W
The goal is to determine the optimal control and state system by numerically solving the aforementioned system (27). □

4. Results and Conclusions

4.1. Results Analysis

The deterministic MMCE model and Stochastic MMCE are numerically simulated using Euler and Euler–Maruyama schemes, respectively. The used time step takes the value 0.02, and the initial assumed values of the twelve dynamic servers states take the values 1000, 20, 25, 27, 35, 30, 18, 15, 23, 60, 40, and 80 for both suggested models, while the transmission rates η 1 , η 2 , η 3 , η 4 , η 5 , η 6 , η 7 , η 8 , η 9 , η 10 , η 11 , η 12 , ξ 1 , ξ 2 , ξ 3 , ξ 4 , δ 1 , δ 2 , δ 3 , δ 4 , g 1 , g 2 , g 3 , g 4 , Θ 1 , Θ 2 , Θ 3 , Θ 4 , a 1 , a 2 , Δ , μ , α , d, and κ take the values 15, 5, 4, 3, 6, 7, 8, 10, 9, 3, 5, 8, 0.00013, 0.00012, 0.0001, 0.0001, 0.05, 0.05, 0.05, 0.05, 0.1, 0.15, 0.08, 0.06, 0.0244, 0.03, 0.02, 0.02, 0.1, 0.05, 0.07, 0.0365, 0.015, 0.025, and 0.035. These parameters values are obtained through trial-and-error techniques to visualize the models’ behaviors. MATLAB software version 2021a is used to run all simulations.
The twelve dynamic states of the network that were produced by first simulating the deterministic MMCE model without taking any control into account are shown in Figure 3. It is clear that susceptible servers are presenting the higher core of total servers with a settling value 789, which means that a lot of servers will be at risk of exposure to infection. Following that, the protected servers have a settling value of about 700 servers. The four infected servers’ categories—healthcare, educational, financial, and media servers—had settling values of 69, 30, 40, and 107, respectively, while the isolated servers of the same four categories had settling values of 240, 229, 292, and 341, respectively. The traced, semi-protected, and protected servers of all categories settled at 162, 222, and 706, respectively. The deterministic controlled MMCE model results are as shown in Figure 4. The susceptible server numbers decreased to a settling value 648 with a reduction of 18%. The four infected servers’ categories settling values reduced to 55, 27, 33, and 85, with a total reduction of 20%, while the isolated servers of the same four categories had reduced settling values of 254, 220, 281, 315, with a total reduction of 3%. The traced servers had a value of 159, with a reduction of 2%. The semi-protected servers of the four categories increased significantly, by 263%, reaching a settling value of 807 servers. So, the controller action succeeded in increasing the total number of servers in the traced, isolated, and semi-protected states and decreased the total number of servers in the susceptible and infected states.
The stochastic and stochastic controlled MMCE models results are as shown in Figure 5 and Figure 6, respectively. The stochastic modeling process provides a more realistic representation of the servers’ state dynamics. Starting by analyzing Figure 5, the susceptible and protected servers settled at a value of 978, while the four infected servers’ categories settled at 101, 41, 54, and 153. And after control, as shown in Figure 6, the susceptible reduced to 717 servers with a reduction of 27%. In addition, the infected servers reduced to the settle values of 62, 35, 37, and 97. The semi-protected servers of the four categories increased significantly, by 166%, from a settle value of 325, as shown in Figure 5, to a controlled value of 863, as shown in Figure 6. So, the controller action also succeeded in maintaining a higher level of security in the stochastic MMCE by increasing the total number of servers on the traced, isolated, and semi-protected states and decreasing the total number of servers in the susceptible and infected states. Figure 7, Figure 8, Figure 9, Figure 10, Figure 11, Figure 12 and Figure 13 show a visualization comparison of the susceptible, isolated, traced, and semi-protected server dynamics of all supposed models under study with and without control.
Both of the controlled dynamic models in this study have the limitation that all transmission rates between the six different types of virtual machines (VMs) and their variety among media, financial, health, and educational servers have fixed values. The four public awareness coefficients were also taken into consideration as constants inside the maximizing objective functional under investigation when the control framework was imposed. Therefore, when applying these models over longer time periods, both transmission rates and awareness coefficients should be time-dependent to make the description more realistic. And for more generalization, if the controller has a multi-objective framework, modern numerical optimization algorithms can be applied.

4.2. Conclusions

To fully describe multi-cloud environments under malware propagation, this work obtained two state-of-the-art dynamical models: the deterministic MMCE model and the stochastic MMCE model. The dynamical network of system servers’ states is categorized into six different states. Two of these states, isolated and infected, are scattered into four types of servers according to their terms of use: healthcare servers, academic and educational servers, financial services servers, and media servers. Then, a control function is recommended for application in both models to maintain a higher level of security in isolated, traced, and semi-protected states. After running both models with initial state values and using the numerical simulations, the obtained results showed the effectiveness of the recommended control strategy in decreasing the level of susceptible and infected servers, as well as increasing the level of security of the three mentioned states to a significant degree. The semi-protected servers increased by 263% for the deterministic MMCE and 166% for the stochastic MMCE model in terms of their settling values. In our future studies, we will work on modifying the proposed models considering fractional-order stochastic frameworks and then applying them to actual mutli-cloud environments for modeling validations.

Author Contributions

Conceptualization, O.A.M.O.; methodology, O.A.M.O.; software, O.A.M.O.; validation, H.M.A. and A.D.; formal analysis, A.M.S.A. and H.M.A.; investigation, A.M.S.A.; resources, A.D.; writing—original draft preparation, A.M.S.A.; writing—review and editing, T.A.N.; supervision, T.A.N. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially funded by Taif University, Saudi Arabia, Project No. (TU-DSPP-2024-46).

Data Availability Statement

Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zhu, X.; Wang, J.; Guo, H.; Zhu, D.; Yang, L.T.; Liu, L. Fault-Tolerant Scheduling for Real-Time Scientific Workflows with Elastic Resource Provisioning in Virtualized Clouds. IEEE Trans. Parallel Distrib. Syst. 2016, 27, 3501–3517. [Google Scholar] [CrossRef]
  2. Pluzhnik, E.; Nikulchev, E. Virtual laboratories in cloud infrastructure of educational institutions. In Proceedings of the 2nd International Conference on Emission Electronics (ICEE), Saint-Petersburg, Russia, 30 June–4 July 2014; pp. 1–3. [Google Scholar]
  3. Ali, M.; Khan, S.U.; Vasilakos, A.V. Security in cloud computing: Opportunities and challenges. Inform. Sci. 2015, 305, 357–383. [Google Scholar] [CrossRef]
  4. Ezhilchelvan, P.D.; Mitrani, I. Evaluating the probability of malicious coresidency in public clouds. IEEE Trans. Cloud Comput. 2015, 5, 420–427. [Google Scholar] [CrossRef]
  5. Jansen, P.W.A. Cloud hooks: Security and privacy issues in cloud computing. In Proceedings of the 44th Hawaii International Conference on System Sciences (HICSS), Kauai, HI, USA, 4–7 January 2011; pp. 1–10. [Google Scholar]
  6. Merabet, H.E.; Hajraoui, A. A survey of malware detection techniques based on machine learning. Int. J. Adv. Comput. Sci. Appl. 2019, 10. [Google Scholar] [CrossRef]
  7. Lu, K.; Cheng, J.; Yan, A. Malware detection based on the feature selection of a correlation information decision matrix. Mathematics 2023, 11, 961. [Google Scholar] [CrossRef]
  8. Zhu, Q.; Liu, Y.; Luo, X.; Cheng, K. A malware propagation model considering conformity psychology in social networks. Axioms 2022, 11, 632. [Google Scholar] [CrossRef]
  9. Ye, X.; Xie, S.; Shen, S. SIR1R2: Characterizing malware propagation in wsns with second immunization. IEEE Access 2021, 9, 82083–82093. [Google Scholar] [CrossRef]
  10. Dong, N.P.; Long, H.V.; Son, N.T.K. The dynamical behaviors of fractional-order SE1E2IQR epidemic model for malware propagation on wireless sensor network. Commun. Nonlinear Sci. Numer. Simul. 2022, 111, 106428. [Google Scholar] [CrossRef]
  11. Al-Tuwairqi, S.M.; Bahashwan, W.S. The impact of quarantine strategies on malware dynamics in a network with heterogeneous immunity. Math. Model. Anal. 2022, 27, 282–302. [Google Scholar] [CrossRef]
  12. Martin del Rey, A.; Hernandez, G.; Bustos Tabernero, A.; Queiruga Dios, A. Advanced malware propagation on random complex networks. Neurocomputing 2021, 423, 689–696. [Google Scholar] [CrossRef]
  13. Piqueira, J.R.C.; Cabrera, M.A.; Batistela, C.M. Malware propagation in clustered computer networks. Phys. A Stat. Mech. Appl. 2021, 573, 125958. [Google Scholar] [CrossRef]
  14. Omar, O.A.; Elbarkouky, R.A.; Ahmed, H.M. Fractional stochastic models for COVID-19: Case study of Egypt. Results Phys. 2021, 23, 104018. [Google Scholar] [CrossRef] [PubMed]
  15. Ahmed, A.M.S.; Ahmed, H.M.; Nofal, T.A.; Darwish, A.; Omar, O.A.M. Hilfer-Katugampola fractional epidemic model for malware propagation with optimal control. Ain Shams Eng. J. 2024, 15, 102945. [Google Scholar] [CrossRef]
  16. Omar, O.A.M.; Alnafisah, Y.; Elbarkouky, R.A.; Ahmed, H.M. COVID-19 deterministic and stochastic modelling with optimized daily vaccinations in Saudi Arabia. Results Phys. 2021, 28, 104629. [Google Scholar] [CrossRef] [PubMed]
  17. Jafar, M.T.; Yang, L.-X.; Li, G.; Zhu, Q.; Gan, C. Minimizing Malware Propagation in Internet of Things Networks: An Optimal Control Using Feedback Loop Approach. IEEE Trans. Inf. Forensics Secur. 2024, 19, 9682–9697. [Google Scholar] [CrossRef]
  18. Jafar, M.T.; Yang, L.X.; Li, G.; Zhu, Q.; Gan, C.; Yang, X. Malware containment with immediate response in IoT networks: An optimal control approach. Comput. Commun. 2024, 228, 107951. [Google Scholar] [CrossRef]
  19. Abazari, F.; Analoui, M.; Takabi, H. Dynamical propagation model of malware for cloud computing security. Comput. Secur. 2016, 58, 139–148. [Google Scholar] [CrossRef]
  20. Gan, C.; Feng, Q.; Zhang, X.; Zhang, Z.; Zhu, Q. Effect of anti-malware software on infectious nodes in cloud environment. IEEE Access 2020, 8, 20325–20333. [Google Scholar] [CrossRef]
  21. Ndaïrou, F.; Area, I.; Nieto, J.J.; Torres, D.F.M. Mathematical modeling of COVID-19 transmission dynamics with a case study of Wuhan. Chaos Solit. Fract. 2020, 135, 10846. [Google Scholar] [CrossRef]
  22. Mao, X.; Marion, G.; Renshaw, E. Environmental Brownian noise suppresses explosions in population dynamics. Stoch. Process. Appl. 2002, 97, 95–110. [Google Scholar] [CrossRef]
  23. May, R. Stability and Complexity in Model Ecosystems; Princeton University: Princeton, NJ, USA, 1973. [Google Scholar]
  24. Li, R.; Guo, X. Dynamics of a stochastic SEIR epidemic model with vertical transmission and standard incidence. Mathematics 2024, 12, 359. [Google Scholar] [CrossRef]
Figure 1. Proposed models’ dynamic network.
Figure 1. Proposed models’ dynamic network.
Mca 30 00008 g001
Figure 2. Proposed controller framework.
Figure 2. Proposed controller framework.
Mca 30 00008 g002
Figure 3. Deterministic MMCE model dynamics.
Figure 3. Deterministic MMCE model dynamics.
Mca 30 00008 g003
Figure 4. Controlled deterministic MMCE model dynamics.
Figure 4. Controlled deterministic MMCE model dynamics.
Mca 30 00008 g004
Figure 5. Stochastic MMCE model dynamics.
Figure 5. Stochastic MMCE model dynamics.
Mca 30 00008 g005
Figure 6. Controlled stochastic MMCE model dynamics.
Figure 6. Controlled stochastic MMCE model dynamics.
Mca 30 00008 g006
Figure 7. Susceptible server dynamics.
Figure 7. Susceptible server dynamics.
Mca 30 00008 g007
Figure 8. Isolated academic and educational server dynamics.
Figure 8. Isolated academic and educational server dynamics.
Mca 30 00008 g008
Figure 9. Isolated healthcare server dynamics.
Figure 9. Isolated healthcare server dynamics.
Mca 30 00008 g009
Figure 10. Isolated financial service server dynamics.
Figure 10. Isolated financial service server dynamics.
Mca 30 00008 g010
Figure 11. Isolated media server dynamics.
Figure 11. Isolated media server dynamics.
Mca 30 00008 g011
Figure 12. Traced server dynamics.
Figure 12. Traced server dynamics.
Mca 30 00008 g012
Figure 13. Semi-protected server dynamics.
Figure 13. Semi-protected server dynamics.
Mca 30 00008 g013
Table 1. Dynamic network transmission rates.
Table 1. Dynamic network transmission rates.
RatesDescription
η 1 Entering Rate of Susceptible Servers
η 2 Entering Rate of Infected Academic and Educational Servers
η 3 Entering Rate of Infected Healthcare Servers
η 4 Entering Rate of Infected Financial Services Servers
η 5 Entering Rate of Infected Media Servers
η 6 Entering Rate of Isolated Academic and Educational Servers
η 7 Entering Rate of Isolated Healthcare Servers
η 8 Entering Rate of Isolated Financial Services Servers
η 9 Entering Rate of Isolated Media Servers
η 10 Entering Rate of Traced Servers
η 11 Entering Rate of Semi-protected Servers
η 12 Entering Rate of Protected Servers
ξ 1 Infection Rate of Academic and Educational Servers
ξ 2 Infection Rate of Healthcare Servers
ξ 3 Infection Rate of Financial Services Servers
ξ 4 Infection Rate of Media Servers
δ 1 Reinstalling System Rate of Infected Academic and Educational Servers
δ 2 Reinstalling Rate of Healthcare Servers
δ 3 Reinstalling Rate of Financial Services Servers
δ 4 Reinstalling Rate of Media Servers
g 1 Isolation Rate of Infected Academic and Educational Servers
g 2 Isolation Rate of Infected Healthcare Servers
g 3 Isolation Rate of Infected Financial Services Servers
g 4 Isolation Rate of Infected Media Servers
Θ 1 Tracing Rate of Isolated Academic and Educational Servers
Θ 2 Tracing Rate of Isolated Healthcare Servers
Θ 3 Tracing Rate of Isolated Financial Services Servers
Θ 4 Tracing Rate of Isolated Media Servers
a 1 Transmission Rate from Traced into Semi-protected Servers
a 2 Transmission Rate from Traced into Protected Servers
Δ Transmission Rate from Semi-protected into Protected Servers
μ Antivirus Expiry Rate
α Antivirus Installing Rate
dRemoval Rate of the Cloud Environment
κ Stochastic Diffusion Coefficient
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Omar, O.A.M.; Ahmed, H.M.; Nofal, T.A.; Darwish, A.; Ahmed, A.M.S. Analysis and Optimal Control of Propagation Model for Malware in Multi-Cloud Environments with Impact of Brownian Motion Process. Math. Comput. Appl. 2025, 30, 8. https://doi.org/10.3390/mca30010008

AMA Style

Omar OAM, Ahmed HM, Nofal TA, Darwish A, Ahmed AMS. Analysis and Optimal Control of Propagation Model for Malware in Multi-Cloud Environments with Impact of Brownian Motion Process. Mathematical and Computational Applications. 2025; 30(1):8. https://doi.org/10.3390/mca30010008

Chicago/Turabian Style

Omar, Othman A. M., Hamdy M. Ahmed, Taher A. Nofal, Adel Darwish, and A. M. Sayed Ahmed. 2025. "Analysis and Optimal Control of Propagation Model for Malware in Multi-Cloud Environments with Impact of Brownian Motion Process" Mathematical and Computational Applications 30, no. 1: 8. https://doi.org/10.3390/mca30010008

APA Style

Omar, O. A. M., Ahmed, H. M., Nofal, T. A., Darwish, A., & Ahmed, A. M. S. (2025). Analysis and Optimal Control of Propagation Model for Malware in Multi-Cloud Environments with Impact of Brownian Motion Process. Mathematical and Computational Applications, 30(1), 8. https://doi.org/10.3390/mca30010008

Article Metrics

Back to TopTop