<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Method for Calculating the Residual Resource of Fog Node Elements of Distributed Information Systems of Critical Infrastructure Facilities</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anton Zahynei</string-name>
          <email>Antonio.com237@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yurii Shcheblanin</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleg Kurchenko</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrii Anosov</string-name>
          <email>a.anosov@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vladyslav Kruglyk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bogdan Khmelnitsky Melitopol state pedagogical university</institution>
          ,
          <addr-line>59 Naukovogo mistechka, Zaporizhzhya, 69000</addr-line>
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Borys Grinchenko Kyiv Metropolitan University</institution>
          ,
          <addr-line>18/2 Bulvarno-Kudriavska str., Kyiv, 04053</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>State University of Information and Communication Technologies</institution>
          ,
          <addr-line>7 Solomyanska str., Kyiv, 03110</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>60 Volodymyrska str., Kyiv, 01033</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>432</fpage>
      <lpage>439</lpage>
      <abstract>
        <p>The paper considers the process of predicting the residual technical resource of elements (devices) of information and communication systems, which are components of fog computing. The analysis of the influence of the technical state of the elements of fog nodes on the functioning of distributed information systems is carried out. A method for calculating the residual resource of fog nodes has been developed, which is advisable to use for planning the modernization of fog nodes and in the process of calculating the fault tolerance of the entire distributed infrastructure.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Fog computing</kwd>
        <kwd>information systems</kwd>
        <kwd>model</kwd>
        <kwd>residual resource</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Modern technology development and
implementation of distributed information
systems in critical areas of human activity
necessitate the improvement of methods for
forecasting and optimizing the use of technical
resources. One of the key innovative
technologies that has become an important
component in modern information and
communication systems is fog computing
technology [1].</p>
      <p>The fog node is the core component of the
fog computing architecture. Fog nodes are
either physical components (e.g. gateways,
switches, routers, servers, etc.) or virtual
components (e.g. virtualized switches, virtual
machines, cloudlets, etc.) that are tightly
coupled with the smart end-devices or access
networks, and provide computing resources to
these devices [2].</p>
      <p>In distributed information systems of
critical infrastructure, such as energy,
transportation, electronic communications,
and others, where security and uninterrupted
operation are a priority, the use of fog nodes
becomes an important strategic solution [3].
Node elements allow the distributed system to
be more flexible and adaptable to the
challenges it faces.</p>
      <p>Fog nodes consist of devices that cannot
process data on their own. Examples of such
devices include temperature sensors, humidity
sensors, motion sensors, smoke detectors, and
video cameras without image processing
capabilities.</p>
      <p>Given the importance and unique
capabilities of fog nodes in the context of
critical infrastructure, there is a need to
develop a method for calculating the remaining
life of node elements [4–6]. This method will
allow us to effectively determine and predict
the resources remaining after devices have
performed computing and networking tasks
over a long period.</p>
      <p>The research aims to develop and optimize
fog computing technology for critical
infrastructure objects. It will consider the
residual resources of node elements to create
more sustainable and efficient distributed
information systems. The research will also
consider failure rate criteria [7].</p>
    </sec>
    <sec id="sec-2">
      <title>2. Review of Existing Methods</title>
      <p>Most of the research related to the resource of
fog node elements is to calculate their required
amount to perform the tasks. Therefore, in [8]
the authors present a review of resource
reservation methods in a fog environment, i.e.
the calculation of the amount of resources that
will be sufficient for the stable functioning of
the information system is investigated. In
addition, the paper describes the methods that
should be used to calculate the time to failure
of fog node elements, such methods include a
task execution model, statistical method, etc.
[8]. The task execution model is used to
calculate the execution time of a specific task
by a system element. The model takes into
account such factors as the type of task, the size
of the input data, and the available resources of
the tool [8]. In turn, the statistical method uses
statistical data to calculate the execution time
of the task. The method takes into account such
criteria as the type of task, the size of the task,
and the past load on the fog node.</p>
      <p>The authors of the study show that the task
execution model can be more accurate than the
statistical method. This is because the task
execution model considers the specific
features of the task that can affect its execution
time. These features may include the
complexity of the task, the skill level of the
person performing the task, and the
availability of resources.</p>
      <p>At the same time, the task execution model
can be more difficult to implement than the
statistical method. This is due to the fact that the
development of a task execution model requires
information about the purpose of the distributed
system node and its components [9].</p>
      <p>A method for calculating the residual
resource of fog nodes that takes into account
Quality of Service (QoS) requirements is
proposed in [10]. The method uses a task
execution model to calculate the task execution
time, and then uses this execution time to
calculate the residual resource.</p>
      <p>Implementation of the method consists of
the following steps [10]:</p>
      <p>QoS Requirements Assessment:</p>
      <p>The QoS requirements for the task must
first be assessed. QoS requirements may
include the following metrics:
• Maximum delay time.
• Maximum error rate.</p>
      <p>After calculating the specified metrics, the
task execution time is calculated using the task
execution model. The task execution model takes
into account such criteria as the task type, the
task size, and the available resources [11].</p>
      <p>Once the task execution time has been
calculated, the remaining node element
resource can be calculated. The residual
resource of a fog node can be calculated by
subtracting the resource consumed by the
node to perform a task from the total resource
of the fog node.</p>
      <p>The total node resource requirement for a
task is calculated as the product of the node’s
task execution time and the average resource
consumption for one task</p>
      <p>The average resource utilization for task
execution can be calculated using a statistical
method [12].</p>
      <p>However, this method does not account for
unforeseen events, such as sudden spikes in
load or equipment failures. This can lead to fog
node elements being unable to provide the
necessary technical specifications for task
execution. Additionally, the method does not
consider the dynamics of node load, which can
change over time. This can lead to the fog node
being unable to provide the required quality of
task execution if the load and number of tasks
change [13].</p>
    </sec>
    <sec id="sec-3">
      <title>3. Method Development</title>
      <p>To solve the problem of forecasting and
calculating the remaining life of elements of fog
nodes in distributed information systems of
critical infrastructure facilities, it is proposed
to use probabilistic forecasting under
conditions of resource constraints for regular
testing of node elements to assess their
technical condition. To do this, we introduce
the following restrictions:
−
−</p>
      <p>We consider a distributed information
system with well-defined fuzzy nodes. Each
node has its parameters   ,  = 1,  , and  is
the total number of nodes. Each parameter has
a nominal value   0. By observing the dynamics
of these parameters, we can evaluate the
changes in the processes within the system.</p>
      <p>During the operation of a distributed
information system</p>
      <p>with fuzzy nodes, the
technical parameters of its elements degrade.
This can lead to a
deterioration
of the
parameters of the elements compared to their
initial values. This means that at certain points
in time   ,  = 1,  the values of the determining
parameters do</p>
      <p>not increase, i.e.   ( 1) &gt;
  ( 2) &gt; ⋯ &gt;   (  ), if  1 &lt;  1 &lt; ⋯ &lt;   .</p>
      <p>If the values of the parameters   are
within the specified range of allowable values
  = (  (
 (

) &lt;   0 &lt;  (

)), where  ( ),

) are the minimum and maximum
allowable</p>
      <p>values
respectively, then</p>
      <p>of
the
the</p>
      <p>parameter,
elements function
normally [14]. Deviation of the parameter
value   from its allowable range leads to a
parametric failure, which usually does not
disable the system, but only degrades its
performance. There is also a probability of
sudden failures of vague nodes, but in this case
there is a parametric failure, which can be
recovered from
within the framework
of
recovery work. This means that the distributed
information system</p>
      <p>belongs to the class of
highly reliable recoverable systems with a finite
number of possible states [15].</p>
      <p>We will denote the state that the system can
go to at time  as   ( ),  = 0,  . The state of
the system, when none of the 
defining
parameters have failed, will be denoted as
 0( ). The failure</p>
      <p>of one of the system
parameters will be denoted by the symbol
 1( ). The symbol   ( ) describes the failure of
 system parameters, and   ( ) corresponds
to the failure of all m-defining parameters. The
transition of the system from one state to the
nearest neighboring state occurs without a
sharp transition of its intermediate state. In
other words, the system cannot go from state
 0( ) to state  2( ) without passing through
the state  1( ).</p>
      <p>We will assume that by time  , the total cost
of maintaining the system in state   ( ) is
  ( ),  = 0,  .</p>
      <p>Operating costs ∆Се per unit time are the same
for each state of the system, and the average
restoration costs ∆Св are the same for each
failed parameter. A critical parameter that fails
at time  is restored immediately. During the
restoration
of the</p>
      <p>critical parameter, the
system costs do not increase. Resources for
restoration are allocated at the time of failure
of the critical parameters.</p>
      <p>−</p>
      <p>The transition of each fuzzy node of the
system from one state to another is considered
a random event [16].
 
parameters.</p>
      <p>We will assume that the intensity   , with
which the failure of parameter  of the element
occurs, is the same for all defining
Similar assumptions apply to the parameter
  , which characterizes the recovery intensity
of the parameter  . This approach will allow us
to calculate the total failure intensity of the
system nodes, which is equal to  =

and  = ∑ =1   , respectively [17].</p>
      <p>The
introduction
of these
restrictions
requires determining the remaining system
resources
under
conditions
of
limited
resources for the maintenance and repair of

∑ =1  
fog nodes and their elements.
3.1. Solution
To solve the main problem, it is first necessary
to calculate the resource costs for maintaining
a separate information system [18] in the state
  ( ),  = 0,  .</p>
      <p>In  0( ), the system will be in a failure-free
state until time  + ∆ . This means that all
nodes and their elements will be operational
and functioning normally. The state of the
system can be considered as the sum of two
 1.</p>
      <p>These
events
are
events:  0
incompatible  0.</p>
      <p>and</p>
      <p>Event  0 characterizes the state of the
system  0( ) at time  . It occurs when there are
no failures during ∆ . The probability of this
event occurring is described by the equation:
 ( 0) =  − ∆ ≈ 1 −  ∆ .
the following formula:</p>
      <p>
        The resources used to support the event  0
with probability  ( 0) can be calculated using
 ( 0) = ( 0( ) + ∆  ∆ )(1 −  ∆ ).
(1)
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
the
      </p>
      <p>If the system is in a state  1( ) and one of
parameters recovers during the time
interval ∆ , the event  1 has occurred [19].
The chance of state  1 occurring is given by the
formula:</p>
      <p>
        ( 1) = 1 −  − ∆ ≈  ∆ . (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
The resource costs for maintaining the
system in the state  1 with probability  ( 1)
can be determined as follows:
      </p>
      <p>
        (В1) =  1( ) ∆ . (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>
        As a result, the system in the state  0( ) can
be considered as a sum of two incompatible
events  0 and В1. The equation for the random
function of material resource costs  0( ) on the
interval ( + ∆ ) to support this can be
expressed as:
 0( + ∆ ) =  ( 0) +  ( 1) =
= ( 0( ) + ∆  ∆ )(1 (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
−  ∆ ) +  1( ) ∆ ,
or like:
 0( + ∆ ) −  0( ) =
= − ∆  0( ) (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
+  ∆  1( ) + ∆  ∆
−  ∆ ∆  ∆.
      </p>
      <p>
        Divide both sides of equation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) by ∆ and
take the limit as ∆ → 0 to obtain the
differential equation:
  0( )
      </p>
      <p>= −  0( ) +   1( ) + ∆  .</p>
      <p>
        For system states   ( ),  = 0,  − 1, we
write a similar equation in which the state
  ( ) is characterized by the fact that at time
 + ∆ the number of failures of determining
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
parameters is equal to  .
      </p>
      <p>Such a state can be considered as a sum of
three incompatible events:   ,   +1, and С −1.</p>
      <p>If at the time t the system was in state   ( )
and during the time ∆ there were no failures
or restorations of any of the parameters, event
  occurs [20]. The probability of its
occurrence is determined by the expression:
 (  ) =  − ∆  − ∆ ≈</p>
      <p>≈ 1 − ( +  )∆ .</p>
      <p>
        The resource costs for maintaining the
system state, which is characterized by event
  with a probability of occurrence  (  ) can
be determined as follows:
 (  ) == (  ( ) + ∆  ∆ )(1 − (  (
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
+  )∆ ).
      </p>
      <p>
        The symbol В +1 describes the system at
time  and in state   +1( ) when one
parameter has recovered during time ∆ . The
probability of its occurrence is determined by
the expression:
 (  +1) = 1 −  − ∆ ≈  ∆ . (
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
      </p>
      <p>The resource costs for maintaining the
system state described by the event   +1 with
probability  (  +1) can be described by the
following expression:</p>
      <p>
        (  +1) =   +1( ) ∆ . (
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
The next event   −1 is that at time  the
system is in state   −1( ) and during the time
∆ there is a failure of another parameter. The
probability of this event occurring is given by
the expression:
      </p>
      <p>
        (С −1) = 1 −  − ∆ ≈  ∆ . (
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
The resource costs for supporting the event
С −1 with probability  (С −1) can be
expressed as:
С(С −1) = С −1( ) ∆ .
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
      </p>
      <p>
        Therefore, the state of the system   ( ) can
be considered as the sum of three incompatible
events   ,   +1 and С −1 and the function of
material resource consumption С ( ) on the
interval ( + ∆ ) to support this event can be
expressed through:
С ( + ∆ ) =  (  ) +  (  +1)
+  (  −1)
=   ( )
+ ∆  ∆ (1 (
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
− ( +  )∆ )
+   +1( ) ∆
+   −1( ) ∆ .
      </p>
      <p>
        Let’s perform a transformation of
expression (
        <xref ref-type="bibr" rid="ref14">14</xref>
        ) similar to the previous one
and we will obtain the differential equation:
   ( )
==    −1( )
− ( +  )  ( ) (
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
+    +1( ) + ∆ 
+  ∆  .
      </p>
      <p>Describing the system state   ( ), when at
time  + ∆ there will be a failure of all 
determining parameters. Such a state can be
considered as a sum of two incompatible
events:   and   −1 [21].</p>
      <p>
        Event   characterizes the system in the
state   ( ), at time  , when no parameter
failures are recorded for a time change of ∆ .
The probability of this event is determined by
the expression  (  ) =  − ∆ ≈ 1 −  ∆ , and
the resource consumption for maintaining the
event   with probability  (  ) can be
expressed by the equation:
С(  ) == (  ( ) + ∆  ∆ )(1 (
        <xref ref-type="bibr" rid="ref16">16</xref>
        )
−  ∆ ).
      </p>
      <p>Event   −1 characterizes the system in the
state   −1( ) at time  and when another
expressed as:</p>
      <p>
        with
parameter failure has occurred during the time
∆ . The probability of this event is determined
by the equation  (  −1) = 1 −  − ∆ =  ∆ .
The resource costs for supporting the event
probability  (  −1) can
be
 (  −1) =   −1( ) ∆ .
(
        <xref ref-type="bibr" rid="ref17">17</xref>
        )
      </p>
      <p>The system in the state   ( ) can be
represented as the sum of two incompatible
events,  
the function
and   −1 [22]. The expression for</p>
      <p>that estimates the costs of
material resources С ( ) on the interval ( +
∆ ) to support this event is given by the
following equation:
∆  ) ∆ .</p>
      <p>С</p>
      <p>( + ∆ ) =  (  ) +
+ (  −1) = (  ( ) +
∆  ∆ )(1 −  ∆ ) + (  −1( ) +</p>
      <p>
        By transforming equation (
        <xref ref-type="bibr" rid="ref18">18</xref>
        ), we obtain
the following differential equation:
   ( )
      </p>
      <p>The costs of material resources to support a
system in the state   ( ),  = 0, 
described by a system of equations involving
unknown random functions of costs   ( ),  =
0,  , which can be solved by transforming it
can be
into operator form [23]:</p>
      <p>( ) ( ) =  ( )( ),
where  ( ) is a three-diagonal matrix of
coefficients of a system
of equations of
dimension (
+ 1) × (</p>
      <p>+ 1).</p>
      <p>X(p)—vector in which the components x_k
(p) are the</p>
      <p>mapping of the corresponding
functions C_k (t), k = ¯(0,m) [24].</p>
      <p>
        ( )( )—vector of the right-hand sides of
the system of equations (
        <xref ref-type="bibr" rid="ref20">20</xref>
        ):
(
        <xref ref-type="bibr" rid="ref19">19</xref>
        )
(
        <xref ref-type="bibr" rid="ref20">20</xref>
        )
 ( ) =  3( ) ;
      </p>
      <p>|
 ( ) = −
|
 0( )
 1( )
 2( )</p>
      <p>|
…
|
  −1( )|
  ( )</p>
      <p>∆ 
−
∆  +  ∆ 



−</p>
      <p>…
| ∆  +  ∆  |
|
,</p>
      <p>is a complex variable in the existing
halfplane of the mapping functions   ( ),  = 0,  .</p>
      <p>
        According to [25–28], we will construct an
estimate of the vector  ( ) of unknowns of the
system of equations (
        <xref ref-type="bibr" rid="ref20">20</xref>
        ), using the following
procedure
for
estimating
the
matrix
coefficients of a multidimensional regression
analysis model with an arbitrary finite number
of regressions.
      </p>
      <p>
        Let us take the system (
        <xref ref-type="bibr" rid="ref20">20</xref>
        ), neglecting the
variable  for the sake of simplicity of the
notation and introducing it into the following
expression [29]:
 +1
 =1
∑     =  ( ),
(22)
 = ‖| 1| ∙ | 2| ∙ … ∙ |  | ∙ … ∙ |  +1‖.
      </p>
      <p>is the block components of the matrix
  is the block components of the vector
 = ‖| 1| ∙ | 2| ∙ … ∙ |  | ∙ … ∙ |  +1‖.</p>
      <p>T is the transposition sign.</p>
      <p>Using the previously introduced notation,
one can find the estimate of  ̇ ̇ of the vector 
of unknown systems (22) from the recursive
relationship:
  =   −1 =    
∏    ( ),</p>
      <p>(23)
̇  +1
 =1
 ≠1
where
   
the
  = (</p>
      <p>−1
∏ =1
    ) ,   =  −
−1
 
∏ −1
 =1</p>
      <p>.</p>
      <p>Applying the inverse Laplace transform to
estimates
(23),
we
can
obtain
the
expressions of the original random functions of
the material costs   ( ) for the support of the
operation of fog nodes in the distributed
information system of a critical infrastructure
object   ( ),, when at the time  from the total
number of</p>
      <p>determining parameters, some of
their number  = 0, 1, 2, … 
may fail [30].</p>
      <p>The average material resource expenditure
 ̅( ) is equal to the mathematical expectation
of all possible values of the random function

(21)</p>
      <p>( ):
states. If the average cost  ̅( =  ̇) at time  =
 ̇ is close to the additional resources allocated
for the operation С0, then we can take t’ as the
residual resource. To find  , we can solve the
equation:</p>
      <p>∈ 
where  ( 0 −  ̅( )) is the chosen measure of
approximation of the quantities  0 and  ̅( ):
 is the set of all possible positive values of
the variable  .</p>
      <p>As a result, we will obtain expressions for the
(25)
quantities   ( ),  = 0,  .</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>This paper examines the efficiency of a
distributed information system for a critical
infrastructure object.</p>
      <p>A distributed information system is a
collection of fog nodes and their elements, each
with its own functional purpose and physical
characteristics. Fog nodes can be physical
components such as gateways, switches,
routers, and servers, or virtual components
such as virtualized switches and virtual
machines.</p>
      <p>As fog nodes and their elements operate,
they consume their technical resources. This
can lead to a failure of the critical
infrastructure object or its segment.</p>
      <p>To reduce the risk of such a failure, this
paper proposes a method for calculating the
residual technical resource of a fog node and its
elements, taking into account their possible
failures.</p>
      <p>This method can be used to predict the
probability of failure of important elements of
critical infrastructure objects and to predict
the cost of restoring their functionality.</p>
      <p>Further research could focus on developing
a method for assessing the consequences of
malicious attacks on a fog node with low
technical resources.
[29] T. Bahreini, D. Grosu, Efficient Placement
of Multi-Component Applications in
Edge Computing Systems, 2nd ACM/IEEE
Symposium on Edge Computing 5
(2017) 1–11. doi: 10.1145/3132211.313
4454.
[30] Y. Shcheblanin, et al., Research of
Authentication Methods in Mobile
Applications, in: Cybersecurity
Providing in Information and
Telecommunication Systems Vol. 3421.
(2023) 266–271.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>A</given-names>
            <surname>Baker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rashid</surname>
          </string-name>
          , O. alsaif, Fog Computing:
          <article-title>A Comprehensive Review of Architectures, Applications, and Security Challenges, NTU J Eng</article-title>
          .
          <source>Technol</source>
          .
          <volume>2</volume>
          (
          <issue>2</issue>
          ) (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .56286/ntujet.v2i2.
          <fpage>614</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Iorda</surname>
          </string-name>
          , et al.,
          <source>Fog Computing Conceptual Model, Natl. Inst. Stand</source>
          . Technol.,
          <source>NIST Special Publication</source>
          <volume>500</volume>
          -
          <fpage>325</fpage>
          (
          <year>2018</year>
          ). doi:
          <volume>10</volume>
          .6028/NIST.SP.
          <volume>500</volume>
          -
          <fpage>325</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vladymyrenko</surname>
          </string-name>
          , et al.,
          <article-title>Analysis of Implementation Results of the Distributed Access Control System</article-title>
          . in: 2019 IEEE International ScientificPractical Conference Problems of Infocommunications, Science and Technology (
          <year>2019</year>
          ). doi:
          <volume>10</volume>
          .1109/ picst47496.
          <year>2019</year>
          .
          <volume>9061376</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P.</given-names>
            <surname>Anakhov</surname>
          </string-name>
          , et al.,
          <article-title>Protecting Objects of Critical Information Infrastructure from Wartime Cyber Attacks by Decentralizing the Telecommunications Network</article-title>
          ,
          <source>in: Workshop on Cybersecurity Providing in Information and Telecommunication Systems</source>
          , vol.
          <volume>3550</volume>
          (
          <year>2023</year>
          )
          <fpage>240</fpage>
          -
          <lpage>245</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hulak</surname>
          </string-name>
          , et al.,
          <article-title>Dynamic Model of Guarantee Capacity and Cyber Security Management in the Critical Automated System</article-title>
          ,
          <source>in: 2nd International Conference on Conflict Management in Global Information Networks</source>
          , vol.
          <volume>3530</volume>
          (
          <year>2023</year>
          )
          <fpage>102</fpage>
          -
          <lpage>111</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.</given-names>
            <surname>Grechaninov</surname>
          </string-name>
          , et al.,
          <article-title>Decentralized Access Demarcation System Construction in Situational Center Network</article-title>
          ,
          <source>in: Workshop on Cybersecurity Providing in Information and Telecommunication Systems II</source>
          , vol.
          <volume>3188</volume>
          , no.
          <issue>2</issue>
          (
          <year>2022</year>
          )
          <fpage>197</fpage>
          -
          <lpage>206</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <article-title>Security Rating Metrics for Distributed Wireless Systems</article-title>
          ,
          <source>in: Workshop of the 8th International Conference on “Mathematics. Information Technologies. Education:” Modern Machine Learning Technologies and Data Science</source>
          , vol.
          <volume>2386</volume>
          (
          <year>2019</year>
          )
          <fpage>222</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Vergara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Botero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fletscher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Comprehensive</given-names>
            <surname>Survey on Resource</surname>
          </string-name>
          Allocation Strategies in Fog/Cloud Environments,
          <source>Sensors</source>
          <volume>23</volume>
          (
          <issue>9</issue>
          ) (
          <year>2023</year>
          )
          <article-title>4413</article-title>
          . doi:
          <volume>10</volume>
          .3390/s23094413.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Buttar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abbas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Majid</surname>
          </string-name>
          ,
          <article-title>Optimized Storage and Resource Management in Fog Computing Paradigm</article-title>
          , IGI Global (
          <year>2023</year>
          ).
          <source>doi: 10.4018/978-1-6684-7348- 1</source>
          .
          <year>ch008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Li</surname>
          </string-name>
          , et al.,
          <source>Method of Resource Physical Education</source>
          ,
          <year>eLEOT 2023</year>
          :
          <article-title>eEstimation Based on QoS in Edge Learning, e-Education, and Online Computing, Wirel</article-title>
          . Commun. Mob. Training, LNICST
          <volume>543</volume>
          (
          <year>2024</year>
          )
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          . doi: Comput.
          <year>2018</year>
          doi: 10.1155/
          <year>2018</year>
          / 10.1007/978-3-
          <fpage>031</fpage>
          -51465-
          <issue>4</issue>
          _
          <fpage>1</fpage>
          .
          <fpage>7308913</fpage>
          . [21]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mahmud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kotagiri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Buyya</surname>
          </string-name>
          , Fog
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Varghese</surname>
          </string-name>
          , Resource Computing:
          <article-title>A Taxonomy, Survey and Management in Fog/Edge Computing: A Future Directions, Internet of Everything Survey, arXiv</article-title>
          .org (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          . (
          <year>2017</year>
          )
          <fpage>103</fpage>
          -
          <lpage>130</lpage>
          . doi:
          <volume>10</volume>
          .1007/
          <fpage>978</fpage>
          -981-
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kaur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , A
          <volume>10</volume>
          -5861-
          <issue>5</issue>
          _
          <fpage>5</fpage>
          . Systematic Review on Resource [22]
          <string-name>
            <given-names>A.</given-names>
            <surname>Brogi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Forti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ibrahim</surname>
          </string-name>
          , Optimising Provisioning in fog Computing,
          <string-name>
            <surname>Trans.</surname>
          </string-name>
          QoS-Assurance,
          <source>Resource Usage and Emerg. Telecommun. Technol</source>
          .
          <volume>34</volume>
          (
          <issue>4</issue>
          ) Cost of Fog Application Deployments, (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1002/ett.4731.
          <string-name>
            <given-names>Cloud</given-names>
            <surname>Comput</surname>
          </string-name>
          . Serv. Sci. (
          <year>2019</year>
          )
          <fpage>168</fpage>
          -
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Khan</surname>
          </string-name>
          , G. Nencioni, Resource 189. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -29193- Allocation
          <source>in Networking and Computing</source>
          <volume>8</volume>
          _
          <fpage>9</fpage>
          .
          <string-name>
            <surname>Systems</surname>
            : A Security and Dependability [23]
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Emu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Choudhury</surname>
          </string-name>
          , Latency Perspective, IEEE Access (
          <year>2023</year>
          ).
          <source>doi: Aware VNF Deployment at Edge Devices</source>
          <volume>10</volume>
          .1109/access.
          <year>2023</year>
          .
          <volume>3306534</volume>
          . for IoT
          <source>Services: An Artificial Neural</source>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gong</surname>
          </string-name>
          , et al.,
          <source>Dynamic Resource Network Based Approach, International Allocation Scheme for Mobile Edge Conference on Communications Computing, J Supercomput</source>
          <volume>79</volume>
          (
          <year>2023</year>
          )
          <article-title>Workshops (ICC Workshops) (</article-title>
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <fpage>17187</fpage>
          -
          <lpage>17207</lpage>
          . doi:
          <volume>10</volume>
          .1007/s11227-
          <fpage>6</fpage>
          . DOI:
          <volume>10</volume>
          .1109/ICCWorkshops49005.
          <fpage>023</fpage>
          -05323-y.
          <year>2020</year>
          .
          <volume>9145242</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Toma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Samara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Qamhieh</surname>
          </string-name>
          , Edge [24]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , et al.,
          <string-name>
            <given-names>A Hierarchical</given-names>
            <surname>Game</surname>
          </string-name>
          <article-title>Computing Systems: Modeling and Framework for Resource Management in Resource Optimization for Augmented Fog Computing</article-title>
          , IEEE Commun.
          <source>Mag. Reality and Soft Real-time Applications</source>
          ,
          <volume>55</volume>
          (
          <issue>8</issue>
          ) (
          <year>2017</year>
          )
          <fpage>52</fpage>
          -
          <lpage>57</lpage>
          . doi: J.
          <string-name>
            <surname>Netw</surname>
          </string-name>
          . Syst. Manag.
          <volume>79</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>mcom</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <volume>1600896</volume>
          . 10.1007/s10922-023-09770-z [25]
          <string-name>
            <given-names>R.</given-names>
            <surname>Aryal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Altmann</surname>
          </string-name>
          , Dynamic
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Computing Resource Application Deployment in Federations Allocation Scheme Based on Edge of Clouds and Edge Resources Using a Computing Under Augmented Reality Multiobjective Optimization AI Application</article-title>
          ,
          <source>J. High Speed Netw</source>
          .
          <volume>28</volume>
          (
          <issue>3</issue>
          )
          <string-name>
            <surname>Algorithm</surname>
          </string-name>
          , 3rd International Conference (
          <year>2022</year>
          )
          <fpage>143</fpage>
          -
          <lpage>156</lpage>
          . doi:
          <volume>10</volume>
          .3233/jhs- on
          <source>Fog and Mobile Edge Computing</source>
          <volume>220687</volume>
          .
          <string-name>
            <surname>(</surname>
            <given-names>FMEC</given-names>
          </string-name>
          ) (
          <year>2018</year>
          )
          <fpage>147</fpage>
          -
          <lpage>154</lpage>
          . doi:
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          , et al.,
          <source>A Game-Based Computing 10</source>
          .1109/fmec.
          <year>2018</year>
          .
          <volume>8364057</volume>
          . Resource Allocation Scheme of Edge [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          , et al.,
          <article-title>Computation Offloading Server in Vehicular Edge Computing and Resource Allocation for Cloud Networks Considering Diverse Task Assisted Mobile Edge Computing in Offloading Modes</article-title>
          ,
          <source>Sensors</source>
          <volume>24</volume>
          (
          <issue>1</issue>
          ) (
          <year>2023</year>
          )
          <article-title>Vehicular Networks</article-title>
          ,
          <source>IEEE Trans. Veh</source>
          .
          <volume>69</volume>
          . doi:
          <volume>10</volume>
          .3390/s24010069. Technol.
          <volume>68</volume>
          (
          <issue>8</issue>
          ) (
          <year>2019</year>
          )
          <fpage>7944</fpage>
          -
          <lpage>7956</lpage>
          . doi:
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>H.-Y. Wei</surname>
          </string-name>
          , et al.,
          <source>Future Trends in 10</source>
          .1109/tvt.
          <year>2019</year>
          .
          <volume>2917890</volume>
          . Fog/Edge Computing and Networking, [27]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <source>Computation Offloading IEEE Commun. Mag</source>
          .
          <volume>61</volume>
          (
          <issue>12</issue>
          ) (
          <year>2023</year>
          )
          <article-title>38-</article-title>
          and Resource Allocation in Wireless 39. doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>mcom</surname>
          </string-name>
          .
          <year>2023</year>
          .
          <volume>10375689</volume>
          . Cellular Networks with Mobile Edge
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>S.</given-names>
            <surname>Alizadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R</given-names>
            <surname>Ghaemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Monshizadeh</surname>
          </string-name>
          , Computing,
          <source>IEEE Trans. Wirel. Commun. An Autonomous Architecture Based on 16(8)</source>
          (
          <year>2017</year>
          )
          <fpage>4924</fpage>
          -
          <lpage>4938</lpage>
          . doi: Reinforcement Deep Neural Network for
          <volume>10</volume>
          .1109/twc.
          <year>2017</year>
          .
          <volume>2703901</volume>
          . Resource Allocation in Cloud Computing, [28]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kherraf</surname>
          </string-name>
          , et al.,
          <source>Optimized Provisioning Comput</source>
          .
          <volume>106</volume>
          (
          <year>2023</year>
          )
          <fpage>371</fpage>
          -
          <lpage>403</lpage>
          . doi: of Edge Computing Resources with
          <volume>10</volume>
          .1007/s00607-023-01220-7. Heterogeneous Workload in IoT
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cao</surname>
          </string-name>
          , Cloud
          <string-name>
            <surname>Computing-Based</surname>
            <given-names>Networks</given-names>
          </string-name>
          ,
          <source>IEEE Trans. Netw</source>
          . Serv.
          <article-title>Sharing Platform for High-quality Manag</article-title>
          .
          <volume>16</volume>
          (
          <issue>2</issue>
          ) (
          <year>2019</year>
          )
          <fpage>459</fpage>
          -
          <lpage>474</lpage>
          . doi: Teaching
          <source>Resources of Higher Vocational</source>
          <volume>10</volume>
          .1109/tnsm.
          <year>2019</year>
          .
          <volume>2894955</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>