<!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>
      <journal-title-group>
        <journal-title>Liaquat Hossain.
Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes
during Percolation in Networks. Article in PLoS ONE January 2013.
DOI: 10.1371/journal.pone.0053095.</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1371/journal.pone.0053095</article-id>
      <title-group>
        <article-title>Survivability Assessment of Distributed Information and Telecommunication Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Boris B. Iskolnyy</string-name>
          <email>isk-boris@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roman V. Maximov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergey R. Sharifullin</string-name>
          <email>sharifullinsr@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Shtemenko Krasnodar Higher Military School Krasnodar</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>59</fpage>
      <lpage>65</lpage>
      <abstract>
        <p>-The methods are applicable upon comparative assessment of distributed information-telecommunication networks as to their ability to provide information exchange between correspondents in conditions of occasional and intentional (computer attacks, using of the software's undeclared capabilities) software interferences (destructive software impacts). Impact of occasional and intentional interferences causing occurrence of failure chains on the network has been described in the network degradation model based on the percolation theory. The result of using of the methods is increase of reliability of assessment of structures of distributed integrated information-telecommunication networks upon variation of the quantity of communication nodes and lines of the network. Provision of adaptation capabilities of networks in conditions of impact of destabilizing environmental factors is achieved by selection of the best (from the number of admissible alternatives) network structure, as well as by selection of the best solutions for restoration of the communication between the transit nodes. The methods account security of communication lines, which, unlike the communication nodes, cannot be isolated from impacts of the environment.</p>
      </abstract>
      <kwd-group>
        <kwd>information security</kwd>
        <kwd>networks</kwd>
        <kwd>adaptation</kwd>
        <kwd>network security tools</kwd>
        <kwd>network gathering</kwd>
        <kwd>intentional interferences</kwd>
        <kwd>percolation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>routing;
intelligence
I.</p>
      <p>INTRODUCTION</p>
      <p>
        Occasional and intentional software interferences are
disturbances reducing the quality of distributed integrated
information and telecommunication networks (ITNs): real
data transfer rate (availability of redundancy of the service
information contained in each of fragments of message
batches reduces the real data transfer rate) and availability
of communication means (failure in maintenance of
information systems) by creation of an abnormal additional
load on processes and devices realizing them [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Survivability of the system is its ability to perform main
functions despite action of disturbances [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Correspondents exercise information exchange between
the protected ITN segments via a sequence of transit
communication nodes and lines of the public-use
communication networks (PUCN). At that the ITN
structure, including all alternatives of routes of message
batches between the corresponding users, is formed
dynamically [3].</p>
      <p>
        A task of the integrated assessment of the quality of
subsystems fully or partially not belonging to the assessor
arise. The given task is stipulated by using for information
exchange of large and dynamic integrated ITNs, virtually
unpredictably including one highly-reliable elements (nodes
and connections between them functioning in the normal
mode) and excluding the other ones. I.e. the task of
assessment shall be resolved in the process of ITN
structuring – constant alternation of its topology and
typology of its elements [
        <xref ref-type="bibr" rid="ref3 ref4">4, 5, 6</xref>
        ].
      </p>
      <p>
        Real ITN structures are rather large, therefore the task of
assessment of survivability of ITNs cannot be resolved by
analytical methods. In this connection it is customary [
        <xref ref-type="bibr" rid="ref10 ref11 ref6 ref7 ref8 ref9">7, 8,
9, 10, 11, 12</xref>
        ] to settle such tasks with the help of the
imitation modeling.
      </p>
      <p>Shortages of well-known methods of PUCN assessment
put into practice are as follows:</p>
      <p>narrowness of the area of application expressed in using
of the local adaptation (coverage of specific fragments by
adjustment) to variations of the structure and the quality of
network resources upon selection of the route of passing of
information messages;</p>
      <p>insufficiently high reliability of results of assessment of
ITN structures upon increase of the number of
communication nodes and lines (at the same time the
methods free from the given shortage are applicable only for
communication nodes and lines (structures) taken as the
endless ones as to the number of elements).</p>
      <p>Low accuracy of the methods is stipulated by the
following:
decentralized adjustment of routes;
unacceptable time and resource expenditures for receipt
of the initial data on the large number of ITN elements;
combinatorial complexity of the task of search of safe
routes on the large number of ITN elements;</p>
      <p>unacceptably low sensitivity of route safety indexes
connected with the fact that increase of the number of ITN
elements will inevitably result in increase of the number of
routes with the close value of the safety index;</p>
      <p>absence of accounting of safety of communication lines,
which, unlike the communication nodes, cannot be isolated
from impacts of the environment, as they are not localized
within the limits of the controlled zones. Compromise of the
communication line is possible by placement of passive
means of the malefactor on communication lines or by
radio-electronic suppression of long-length communication
lines, which will require significant means for search and
elimination of reasons of reduction of values of complex
safety indexes of communication lines.</p>
      <p>The goal of the methods is resolution of the task of
comparative assessment of ITN survivability providing
increase of reliability of results of assessment upon variation
of the number of communication nodes and lines of ITNs
from the structures, the size of which can be taken as the
final one as to the number of elements, to the larger
structures, the size of which can be taken as relatively
endless, in conditions of impact of intentional and
occasional software interferences on the assessed ITNs, as
well as provision of adaptation capabilities of ITNs in
conditions of impact of the destabilizing environmental
factors.</p>
      <p>It is possible to increase reliability of the result of
comparative assessment of ITN structures by accounting of
the prospective reduction of values of safety (protection)
indexes of communication nodes and lines, as well as at the
expense of the critical area occupied by the interval of
values of the critical ratio of «dangerous» and «safe»
communication nodes and lines obtained in experiments
with various random sequences.</p>
      <p>Provision of adaptation capabilities of ITNs in conditions
of impact of destabilizing environmental factors is achieved
by selection of the best (from the number of admissible
alternatives) ITN structure, as well as by selection of the
best solutions for restoration of the communication between
the transit nodes. The assortment of alternative structures for
the given purpose shall be preliminary found by monitoring
of PUCN with the help of the specialized software like
Visual Route or tracert (traceroute in Unix), ping and
pathping tools built in Windows operating systems.</p>
      <p>II.</p>
    </sec>
    <sec id="sec-2">
      <title>MEANINGFUL (PHYSICAL) PROBLEM DEFINITION</title>
      <p>Routing of message batches in ITNs and transfer thereof
via communication lines for provision of information
exchange between correspondents is made in PUCN transit
nodes.</p>
      <p>Determination of the route of movement of message
batches in PUCN is a complex task as between each pair of
correspondents there is a large assortment of alternative
routes. Selection of the route is made in PUCN nodes
(routers of communication operators). Criteria of selection
of the route from the number of admissible alternatives are
prospective throughput capacity and workload of
communication lines (channels); delays made by channels
and their reliability; number of transit PUCN nodes and
their reliability.</p>
      <p>For provision of safety of information interaction of
correspondents it is necessary to make comparative
assessment of alternative ITN structures with due account of
the capability to provide information interaction of
correspondents in conditions of intentional and occasional
software interferences resulting in reduction of the quality
of ITNs and creating an abnormal load on the device's
processes realizing the information interaction.</p>
      <p>Such a task-setting enables to formulate the following
contradictions.</p>
      <p>Contradiction between the necessity to provide a high
reliability of results of assessment and increase of the
resource required for the resolution thereof caused by
variation of the number of communication lines and nodes
of ITNs exposed to the impact of interferences.</p>
      <p>Contradiction between the need to give assessment to
adaptation capabilities of ITNs and the necessity to obtain
the given assessment of prospective values of safety indexes
of communication nodes and lines accounting the
destructive environmental impact.</p>
      <p>The methods are aimed to elimination of the given
contradictions.</p>
      <p>Probability Pvc of violation of communication between
correspondents (users) is taken as the integral index of ITN
survivability, and the availability factor FAi, where i = 1, 2,
3, …, n, characterizing the node's capabilities to provide
users with communication services with the required quality
- as the survivability index of the ITN node. The order of
receipt of index values, particular criteria and their
contribution to the final assessment are forth below in the
text below.</p>
      <p>
        The theoretical basis of the methods are the percolation
theory, mathematical statistics theory and probability
theory. Impact of intentional and occasional software
interferences on ITNs causing sequences of failures is
similar to the process of percolation specified in works [
        <xref ref-type="bibr" rid="ref12 ref13">13,
14</xref>
        ] and gives an opportunity to describe processes of the
epidemic on the degrading ITN structure globally, but in a
simple form. Within the framework of the percolation
theory the given task is resolved on nodes and on
connections [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>III. ITN DEGRADATION MODEL, RESOLUTION OF THE</p>
      <p>PERCOLATION TASK ON NODES</p>
      <p>In order to achieve the goal of the methods upon
resolution of the percolation task on nodes the following
sequence of actions shall be performed. It is necessary to set
initial data: communication scheme of management bodies;
requirements to the ITN quality indexes and the minimally
admissible value of the complex safety index ICmin;
identifiers of nodes and availability of communication lines
between them. The structure and parameters of the
distributed ITN (typology of its elements) are determined by
the above-listed initial data. At that the communication
scheme and requirements to the ITN quality indexes are set
by the system of the higher level of the hierarchy – by the
management system of the office, in which interests the
communication is arranged. If it is impossible to receive the
information on the PUCNs structure as the initial data from
the communication operator, then it shall be preliminary
found by monitoring of the PUCN with the help of the
specialized software. Fullness and reliability of results of
monitoring is determined by the quantity and mutual
location (spatial span) of monitoring means. In the given
case reliability is determined by the isomorphism of results
of monitoring and of the structure of the real PUCN. It is
expedient to have monitoring points in each
PUCNconnected protected ITN segment. As a result such a
multiagent software will enable to settle tasks of the subsystem of
monitoring of the topology and typology of ITNs for
determination of the whole assortment of alternative ITN
structures for information exchange between management
bodies.</p>
      <p>Availability (good action) factor of i-sequence ITN node
is the availability factor calculated by the following
formula: FAi = ((Тi – ТDi) / Тi) ∙ 100%, where ТDi – duration
of the time interval, within which services from the
communication node with the required quality are
unavailable to users («downtime»); Тi – aggregate time of
work of the ITN node. Impact of occasional and intentional
interferences on the ITN node creates an abnormal
(additional) load on the communication and devices
realizing it. As a consequence, ТDi – duration of the time
interval, within which services from the communication
node with the required quality are unavailable to users
(«downtime») – increases, and the availability factor of the
ITN note – decreases. Experience of ITN exploitation and
experiments on its fragments show that the value of the
minimally admissible value of the availability factor shall be
set within the following interval: 0.6 &lt; FAmin &lt; 1.</p>
      <p>Further it is necessary to calculate values of the
complex safety index for each ITN node. The ICi, complex
index of the i-sequence ITN node shall be understood as
makeup (its rationed numeric value) of safety parameters
characterizing the ITN node's capability to withstand
realization of security threats. Calculation of ICi can be
made by different methods: summation, multiplication or
as the arithmetic mean of safety parameters of the unit.
Besides, preliminary set initial data as ITN parameters shall
include additionally set the minimally admissible value of
the complex safety index ICmin for ITN nodes and alternative
variants of connection of users to ITNs. The value of ICmin
shall be set as a requirement (directive) with due account of
realization of safety functions providing the level of the
minimal confidence to the manufacturer and the operator of
the equipment (regulated normatively).</p>
      <p>Experience of exploitation of ITNs and experiments on
its fragments show that the value ICmin shall be set within the
following interval: 0.5 &lt; ICmin &lt; 1.</p>
      <p>Then it is necessary to compare the value of the
calculated complex safety index ICi of the i-sequence ITN
node with the preliminary set minimally admissible value
ICmin.</p>
      <p>When ICi &lt; ICmin the i-sequence node shall be memorized
as the «dangerous» one, and when ICi ≥ ICmin the node shall
be memorized as the «safe» one. Upon increase of
communication nodes (till the relatively large quantity) in
the ITN's structure there are, as a rule, alternatives of
variants of routing of message batches. The required
survivability and reliability of communication systems is
achieved by backup of communication channels and by the
known adaptive routing methods (realized locally by the
equipment of communication operators).</p>
      <p>Let's, for example, the j-sequence variant of the
idealized regular ITN structure be a structure, in nodes of
which there are communication nodes (Figures 1-2), the
pjsequence share of which (black-color nodes) is the
«dangerous» one, and the possibility of passage of message
batches between users 1 and 2 is excluded. Chains
(blackcolor nodes and connections between them) are formed
from such adjacent nodes and are memorized. In the given
example it is obvious that with the pj-sequence part shown
on (Figure 1, a) and (Figure 1, b) of «dangerous» nodes
from their total number (pj = 0.3) there is a large number of
alternatives of routing of messages between ITN users
(white-color nodes and connections between them on
(Figure 1, b), some of them are shown on the figure by
arrows).</p>
      <p>For prospective reduction of ICi values caused by impact
of occasional and intentional interferences on
communication channels and ITN nodes it is necessary to
increase the share of «dangerous» nodes by the value of Δp.
The given value (Δp) shall be set within the interval
of Δp = 0.01..0.2 of the required accuracy of calculation
results. It follows from the figure (Figure 2, a) that with the
pj-sequence part of «dangerous» nodes shown on (Figure 2),
where pj = 0.5, there are only 4 alterative variants of routes
of message batches between the users shown on the figure
by arrows. In order to calculate pkj, the critical ratio of
«safe» and «dangerous» nodes, for each j-sequence variant
of connection of users it is necessary to increase the share of
«dangerous» nodes consistently by the value of Δp
(where, for example, Δp = 0.01) up to fulfillment of the
condition pj = pkj, at which the adjacent «dangerous» nodes
create chains excluding an opportunity of information
exchange for users.</p>
      <p>After calculation of pkj, the critical ratio of «dangerous»
and «safe» nodes, for each alternative ITN structure and
ranking of alternative variants of connection of users to ITNs
in accordance with pkj values it is necessary to select
additional variants among them with the admissible pkj value
(admissible variants) (pkj ≥ pADD) and memorize them.</p>
      <p>Then it is necessary to calculate the availability factor of
each «dangerous» FAi of the i-sequence ITN node and to
compare its value with the preliminary set minimally
admissible FAmin. Where FAi ≥ FAmin it is necessary to
memorize the i-sequence node as the «available» one,
otherwise, i.e. where FAi &lt; FAmin it is necessary to memorize
the node as the «unavailable» one.</p>
      <p>Then it is necessary to reduce the value of the
availability factor of the ITN node FAi consistently by the
value of Δd until fulfillment of the condition FAi &lt; FAmin.
The value of Δd shall be set within the interval Δd = 0,01 ÷
0,1 of the required accuracy of calculation results.</p>
      <p>Further it is necessary to calculate duration of the time
interval TAi, within which the condition FAi ≥ FAmin has been
fulfilled.</p>
      <p>Interferences injected to one or more ITN points reduce
availability of ITN nodes. Graphs on (Figure 3, b) and
(Figure 3, c) illustrate the dynamics of alteration of the
number of ITN nodes in the action front of the interference.
For example, (see graph on Figure 3, b), in the «D» point the
number of ITN nodes in the action front of the interference is
equal to 35 nodes as of the moment of time t1 ≈ 90 sec: i.e. on
the 90th second (from commencement of observation)
interferences reducing the value of FAi by the value of Δd
concurrently exist concurrently on 35 ITN nodes.</p>
      <p>And for the time tkj the number of pj «unavailable» ITN
nodes will achieve the value of pkj (point «Е1» on (Figure 3, a)
and point «Е2» on (Figure 3, c).</p>
      <p>Further, it is necessary to rank alternative variants of
connection of users by the meaning of the pkj (critical ratio of
«dangerous» and «safe» nodes) value. For the given purpose
it is necessary to measure out tkj values of the alternative
(competing) ITN structures on the time scale. Thus, for
example, from graphs on (Figure 3, b) and (Figure 3, d):
tk1 ≈ 260 sec, tk2 = 225 sec.</p>
      <p>From two competing (alternative) structures it is
necessary to select the variants with the value tkj ≥ tk minj and to
memorize them. Let's tk minj = 250 sec.</p>
      <p>Then it is necessary to select from graphs on (Figure 3, b)
and (Figure 3, d) the structure no.1 as tk1 ≈ 260 sec that
corresponds to the condition tkj ≥ tk minj (260 sec &gt; 250 sec). If
tk minj &lt; 225 sec, then the reasons for selection are insufficient
and an additional criterion is required.</p>
      <p>A set of «unavailable» nodes connected with each other
creates a cluster inside the ITN. For example, the task of
search of the cluster's structurally separated branches
connected with its frame via the sole node is formed.</p>
      <p>It is expedient to construe the given task in the subject
area of networks and communication systems as follows: it is
necessary to find all «unavailable» ITN nodes, «replacement»
of any of which by the «available» nodes will result in
destruction of the cluster of «unavailable» nodes and
restoration of the communication between users. Such nodes
are called as the «dissecting» ones. The more «dissecting»
nodes – the more prospective opportunities for restoration of
communication between the ITN users.</p>
      <p>On (Figure 4) in the ITNs general structure one of the
«dissecting» nodes is highlighted.</p>
      <p>
        For search of the «dissecting» nodes it is necessary [
        <xref ref-type="bibr" rid="ref13">14</xref>
        ] to
calculate the connectivity index N of each i-sequence
«unavailable» ITN node for each j-sequence connection of
users, to set the minimal value of connectivity Nmin of the
«unavailable» transit ITN nodes, to select those
«unavailable» ITN nodes, the connectivity index of which is
N = Nmin, and to memorize them. After that it is necessary to
increase the FAi value of each i-sequence «unavailable»
transit ITN node until fulfillment of the condition
FAi ≥ FAmin and to check availability of communication
between users.
      </p>
      <p>If communication between users is not restored, then it
is necessary to increase the value of the minimal
connectivity index Nmin of «unavailable» transit ITN nodes
by one. If communication between users is restored, then it
is necessary to memorize the i-sequence «unavailable»
transit ITN node as the «dissecting» one.</p>
      <p>Further, for substantiation of selection of a structure
from the number of alternatives it is necessary to rank
alternative variants of ITN by the quantity of «dissecting»
nodes and to select the variant with the maximum quantity
of «dissecting» ITN nodes providing the largest prospective
opportunities for restoration of the communication between
users. Probability PVC j of violation of communication
between correspondents for the j-sequence structure is
formalized as a functional dependence on the ratio pj of
«dangerous» and «safe» nodes. The share of «dangerous»
where pj &lt; pjk, i.e. is relatively small one, provides
admissibly small (and even negligibly small) probability of
violation of communication between users.</p>
      <p>
        Probability of violation of communication sharply
increases upon increase of pj up to the area of the critical
values about pjk ≈ 0.6, and when pj → 1 (pj &gt; pjk) increases
up to the one [
        <xref ref-type="bibr" rid="ref14">15</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>IV. COMPARATIVE ASSESSMENT OF THE FINAL</title>
      <p>STRUCTURES OF INTEGRATED ITNS, RESOLUTION OF THE</p>
      <p>PERCOLATION TASK ON CONNECTIONS</p>
      <p>For the final structures the value of pkj – is a random
value, the RMS deviation of values of which increases
under the power-law with reduction of the number of
communication nodes and/or lines. For the final structures
there is no clearly defined threshold of pkj, but there is a
critical area occupied by the interval of values pkj D ,
obtained in D-number experiments with various random
sequences. Besides, the critical value pkj for communication
nodes in all practical ITN topologies is always less than the
one for the communication lines as in case of failure of any
one communication node not the one communication line,
but all communication lines of the given node are disrupted.
It means that assessment obtained without account of
communication lines will be unreliable.</p>
      <p>The percolation task on connections is resolved in the
way similar to the task on nodes. It is necessary to set
preliminary ITN parameters and alternative variants of
connection of users. As parameters it is necessary to set
identifiers of the network's nodes, communication lines
between them; minimally admissible value of the complex
safety index ILmin for communication lines; total number
Dmax of random tests providing reliability of results of
experiments, the test's number shall be designated as
D = 1, 2, … Dmax.</p>
      <p>Imitation modeling of the ITN's degradation upon
resolution of the percolation task on connections is
performed in the way similar to the one specified in the
above-mentioned task on nodes.</p>
      <p>It is necessary to allocate memory arrays for storage of
identifiers of users and alternative routes of message
batches, two-dimensional memory array (Table I) for
storage of values of the critical ratio of «dangerous» and
«safe» communication lines p kj D of each of D-number
random tests by each j-sequence variant of connection of
users, where j = 1, 2, … . It is necessary to form the
topologic ITN scheme, from which it is necessary to
allocate alternative routes of message batches for each pair
of alternative variants of connection of users to the ITN. It is
necessary to memorize alternative routes of message batches
for each j-sequence variant of connection of users. The
value of the current number of random tests Dcurr shall be
set as equal to zero.</p>
      <p>In order to account prospective reduction of values of
complex safety indexes of communication lines caused by
impact of occasional and intentional interferences on the
ITN's communication lines it is necessary to increase the
share of «dangerous» lines by the value of Δp and to find
p kj D – the critical ratio of «dangerous» and «safe»
communication lines for each j-sequence variant of
connection of users, at which the information exchange
between users is excluded.</p>
      <p>For the given purpose it is necessary to select at random
the p Dj -sequence part of communication lines from the
total number thereof from each previously memorized
variant of connection of users and to memorize them as the
«dangerous» ones, to form connected chains from the
adjacent «dangerous» communication lines and to memorize
them, then it is necessary to increase gradually the share of
«dangerous» communication lines by the value of Δp and to
repeat formation of the connected chain until fulfillment of
the condition p Dj = p kj D and to memorize the critical ratio
of «dangerous» and «safe» communication lines p kj D in the
two-dimensional memory array (Table I). The value of Δp
shall be set on the basis of the required accuracy of
calculation of results within the interval of Δd = 0.01 ÷ 0.1.
The calculation result p kj D shall be registered in the table of
the two-dimensional memory array for storage of values of
the critical ratio of «dangerous» and «safe» communication
lines (Table I).</p>
      <p>TWO-DIMENSIONAL MEMORY ARRAY OF VALUES OF THE</p>
      <p>CRITICAL RATIO
2
3</p>
      <p>4
0,548 0,262 0,738
0,318 0,271 0,129</p>
      <p>5
0,250
0,341</p>
      <p>Dmax =6
0,417
0,071
p kjDmax
0,490
0,282</p>
      <p>After that it is necessary to increase the value of the
counter of the number of random tests Dcurr by one and then
to fix the number of the random test.</p>
      <p>Each random test Dcurr performed in the process of
experiments with the help of the numeric modeling by the
Monte-Carlo statistic test method results in formation of
various structures from «dangerous» communication lines
connected with each other and in receipt of random values
p kj D , which shall be memorized in (Table I), while the
condition Dcurr &lt; Dmax limiting the total number of random
tests is fulfilled. The small share of «dangerous»
communication lines p Dj = p kj D provides negligibly small
probability of violation of communication between ITN
users.</p>
      <p>Dmax total quantity of random tests providing reliability
of results of experiments shall be calculated by the
following formula: Dmax  Z2 / 2 / 4d 2 , where Z / 2 is
standard normal statistics for the sought probability, d –
acceptable error.</p>
      <p>Alternative order of calculation of the quantity Dmax of
random tests upon practical realization of the imitation
model Dmax is as follows. For each variant of connection of
users to the ITN j first it is necessary to calculate the regular
value of the sequence p kj D , where D = Dcurr, and then to
calculate the arithmetic mean pkj D under the whole set of
calculated values</p>
      <p>p kj D , i.e. iteratively. The obtained
sequence pkj D tends to the exact resolution upon increase of
the number of tests Dcurr. Then the criterion of stoppage of
the iteration process will be pkj DТЕК  pkj DТЕК 1   , where
ε is acceptable error. The value of the acceptable error shall
be set declaratively, basing on the required accuracy of
calculations. The range of values ε depends on the level of
difference of the compared ITN structures and basing on the
experience of calculations lies within the interval of
0,01    0,1. After completion of the iteration process</p>
    </sec>
    <sec id="sec-4">
      <title>Dmax will be equal to Dcurr.</title>
      <p>Upon fulfillment of the condition Dcurr ≥ Dmax the value
of the index of the center of the sampling distribution pkj D
under the whole set Dmax of random tests for each
jsequence variant of connection of users shall be calculated
as the mathematical expectation or the arithmetical mean or
the geometrical mean or the harmonic mean or the average
power value or the weighted average or the median or the
mode values p kj D under the whole set of D random tests
under each j-sequence variant of connection of users.
Results of calculation of indexes of the center of the
sampling distribution pkj D under the whole set Dmax of
random tests for two alternative ITN structures and Dmax = 6
are set forth in (Table I). At that in line 1 (Table I) there are
results of calculations for the ITN regular structure with the
connectivity of each communication node equal to four. In
line 2 (Table I) there are memorized results of calculations
for the ITN regular structure with the connectivity of each
communication node equal to three.</p>
      <p>The arithmetic mean value shall be calculated by the
following formula:</p>
      <p>D1
For example, for line 1 (Table I):
pkDmax 
j</p>
      <p>1
Dmax</p>
      <p>Dmax
 pkj D .</p>
      <p>(1)

 0,490</p>
      <p>The notions «alternative variants of connection of ITN
users» and «alternative ITN structures» are synonyms
equivalent from the point of view of application of the
specified order of comparing of alternatives. If the ITN
structure in the non-regular one, then upon different variants
of connection of users thereto different structures will be
created between such users as alternative ways of transfer of
message batches.</p>
      <p>After that it is necessary to rank alternative variants of
connection of users to the INT by the meaning of the value
of the index of the center of the sampling distribution and to
select the variant with the maximum value of the center of
the sampling distribution</p>
      <p>pkj D  max among them. For
examples of calculations specified in the table (see Table I)
the variant specified in line 1 has the maximum value of the
center of the sampling distribution.</p>
      <p>
        After performance of comparative assessment under all
above-mentioned indexes users shall be connected to the
communication network and the information exchange
between them shall be exercised [
        <xref ref-type="bibr" rid="ref15">16</xref>
        ].
      </p>
      <p>V.</p>
      <p>CONCLUSION</p>
      <p>Upon the ITNs work occasional and intentional
interferences are inevitable and may result in failures in work
of the ITN and, as a consequence, of the management system
of the office.</p>
      <p>Application of the methods enables to resolve the task of
comparative assessment of survivability of ITNs providing
increase of reliability of results of assessment upon variation
of the number of communication nodes and lines in
conditions of influence of intentional and occasional software
interferences, to provide capabilities of the ITN structure to
adapt to destabilizing environmental factors, as well to
increase reliability of results of assessment of structures, the
size of which may be taken and the final one as to the number
of elements – communication nodes and lines, at the expense
of accounting of the critical area occupied by the interval of
values p kj D of communication lines obtained in experiments
with different random sequences.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Shuai</given-names>
            <surname>Shao</surname>
          </string-name>
          , Xuqing Huang,
          <string-name>
            <given-names>H Eugene</given-names>
            <surname>Stanley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Shlomo</given-names>
            <surname>Havlin</surname>
          </string-name>
          .
          <article-title>Percolation of localized attack on complex networks</article-title>
          .
          <source>New Journal of Physics</source>
          .
          <volume>17</volume>
          (
          <year>2015</year>
          )
          <article-title>023049</article-title>
          . DOI:
          <volume>10</volume>
          .1088/
          <fpage>1367</fpage>
          -2630/17/2/023049.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Grimmett</surname>
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Percolation</surname>
          </string-name>
          . Cambridge: Springer,
          <year>1999</year>
          . 444 p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Stephenson</surname>
            <given-names>C.</given-names>
          </string-name>
          ; et., al. (
          <year>2017</year>
          ).
          <article-title>Topological properties of a selfassembled electrical network via ab initio calculation</article-title>
          .
          <source>Scientific Reports</source>
          <volume>7</volume>
          ,
          <string-name>
            <surname>Article</surname>
            <given-names>number</given-names>
          </string-name>
          :
          <volume>41621</volume>
          (
          <year>2017</year>
          ). DOI:
          <volume>10</volume>
          .1038/srep41621.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Lu</surname>
            <given-names>J.</given-names>
          </string-name>
          ; et., al. (
          <year>2013</year>
          ).
          <article-title>Theory and applications of complex networks: Advances and challenges</article-title>
          .
          <source>IEEE. DOI: 10.1109/ISCAS</source>
          .
          <year>2013</year>
          .
          <volume>6572335</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Motter A.</given-names>
            ,
            <surname>Albert</surname>
          </string-name>
          <string-name>
            <surname>R.</surname>
          </string-name>
          (
          <year>2012</year>
          ).
          <source>Networks in Motion. Physics Today</source>
          .
          <volume>65</volume>
          (
          <issue>4</issue>
          ):
          <fpage>43</fpage>
          -
          <lpage>48</lpage>
          . DOI:
          <volume>10</volume>
          .1063/pt.3.1518.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Daqing</given-names>
            <surname>Li</surname>
          </string-name>
          , Qiong Zhang, Enrico Zio, Shlomo Havlin,
          <string-name>
            <given-names>Rui</given-names>
            <surname>Kang</surname>
          </string-name>
          .
          <article-title>Network reliability analysis based on percolation theory</article-title>
          .
          <source>Reliability Engineering and System Safety</source>
          <volume>142</volume>
          (
          <year>2015</year>
          ). P.
          <volume>556</volume>
          -
          <fpage>562</fpage>
          . DOI:
          <volume>10</volume>
          .1016/j.ress.
          <year>2015</year>
          .
          <volume>05</volume>
          .021.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Daqing</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Bowen</given-names>
            <surname>Fu</surname>
          </string-name>
          , Yunpeng Wang, Guangquan Lu, Yehiel Berezin,
          <string-name>
            <given-names>H. Eugene</given-names>
            <surname>Stanley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Shlomo</given-names>
            <surname>Havlin</surname>
          </string-name>
          .
          <article-title>Percolation transition in dynamical traffic network with evolving critical bottlenecks</article-title>
          .
          <source>Proc Natl Acad Sci USA</source>
          .
          <source>2015 Jan</source>
          <volume>20</volume>
          ;
          <issue>112</issue>
          (
          <issue>3</issue>
          ). P.
          <volume>669</volume>
          -
          <fpage>672</fpage>
          . DOI:
          <volume>10</volume>
          .1073/pnas.1419185112.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Hyunseok</given-names>
            <surname>Oh</surname>
          </string-name>
          , Seunghyuk Choi, Keunsu Kim,
          <string-name>
            <given-names>Byeng D.</given-names>
            <surname>Youn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Pecht</surname>
          </string-name>
          .
          <article-title>An empirical model to describe performance degradation for warranty abuse detection in portable electronics</article-title>
          .
          <source>Reliability Engineering and System Safety</source>
          <volume>142</volume>
          (
          <year>2015</year>
          ). P.
          <volume>92</volume>
          -
          <fpage>99</fpage>
          . DOI:
          <volume>10</volume>
          .1016/j.ress.
          <year>2015</year>
          .
          <volume>04</volume>
          .019.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Chongpu</surname>
            <given-names>Zhai</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dorian A H Hanaor</surname>
          </string-name>
          ,
          <article-title>Yixiang Gan</article-title>
          .
          <article-title>Universality of the emergent scaling in finite random binary percolation networks</article-title>
          .
          <source>Article in PLoS ONE February</source>
          <year>2017</year>
          . DOI:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0172298</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Filippo</given-names>
            <surname>Radicchi</surname>
          </string-name>
          .
          <article-title>Percolation in real interdependent networks</article-title>
          .
          <source>Nature Physics</source>
          , vol.
          <volume>11</volume>
          ,
          <year>July 2015</year>
          . DOI:
          <volume>10</volume>
          .1038/NPHYS3374.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Niu</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanley</surname>
            <given-names>HE.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            <given-names>Y.</given-names>
          </string-name>
          <article-title>Percolation of networks with directed dependency links</article-title>
          .
          <source>Phys. Rev. E</source>
          <volume>93</volume>
          ,
          <fpage>042312</fpage>
          - Published 20 April
          <year>2016</year>
          . DOI:
          <volume>10</volume>
          .1103/PhysRevE.93.042312.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Ery</given-names>
            <surname>Arias-Castrol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Geoffrey R.</given-names>
            <surname>Grimmett</surname>
          </string-name>
          .
          <article-title>Cluster detection in networks using percolation</article-title>
          .
          <source>Bernoulli</source>
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <year>2013</year>
          ,
          <fpage>676</fpage>
          -
          <lpage>719</lpage>
          . DOI:
          <volume>10</volume>
          .3150/11-
          <fpage>BEJ412</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Geoffrey</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Grimmett</surname>
            , Alexander E. Holroyd,
            <given-names>Gady</given-names>
          </string-name>
          <string-name>
            <surname>Kozma</surname>
          </string-name>
          .
          <article-title>Percolation of finite clusters and infinite surfaces</article-title>
          .
          <source>Mathematical Proceedings of the Cambridge Philosophical Society, Jan</source>
          <volume>15</volume>
          ,
          <year>2014</year>
          . DOI:
          <volume>10</volume>
          .1017/S030500411300073X.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Majdandzic</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Podobnik</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buldyrev</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kenett</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Havlin</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eugene</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2013</year>
          ).
          <article-title>Spontaneous recovery in dynamical networks</article-title>
          .
          <source>Nature Physics</source>
          .
          <volume>10</volume>
          (
          <issue>1</issue>
          ):
          <fpage>34</fpage>
          -
          <lpage>38</lpage>
          . DOI:
          <volume>10</volume>
          .1038/nphys2819. ISSN 1745- 2473.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Iskolnyy</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maximov</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharifullin</surname>
            <given-names>S</given-names>
          </string-name>
          .
          <article-title>Evaluation of the Survivability of Integrated Information-Telecommunication Networks</article-title>
          .
          <source>Voprosy kiberbezopasnosti [Cybersecurity issues]</source>
          .
          <source>2017. No</source>
          <volume>5</volume>
          (
          <issue>24</issue>
          ). P.
          <volume>72</volume>
          -
          <fpage>82</fpage>
          . DOI:
          <volume>10</volume>
          .21681/
          <fpage>2311</fpage>
          -3456-2017-5-
          <fpage>72</fpage>
          -82.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>