ISSN 0005-1179, Automation and Remote Control, 2018, Vol. 79, No. 3, pp. 535–544.
Pleiades Publishing, Ltd., 2018.
Original Russian Text
G.G. Grebenyuk, S.M. Nikishov, 2016, published in Problemy Upravleniya, 2016, No. 4, pp. 52–57.
Blocking of Energy and Resource Supply
of Target Objects in Network Infrastructures
G. G. Grebenyuk
and S. M. Nikishov
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Received March 14, 2016
Abstract—This paper considers the safety problem for a group of target objects receiving en-
ergy or resources from a network infrastructure under a negative inﬂuence on its components
that violates the links between the objects and the sources of energy or resources. We describe
the well-known solution approaches for the network stability problems. In addition, we analyze
the speciﬁcs of the search problem for the failed network components that violate the function-
ality of the target objects, also suggesting some solution methods and approaches to optimize
calculations. Finally, we give an example to illustrate the failure search algorithm.
Keywords: vulnerability, network infrastructure, reliability, energy supply
A common approach to the topological analysis of network stability against a destructive inﬂu-
ence on its nodes is to deﬁne the connectivity violation degree of the network after elimination of
the failed nodes.
Among the widespread destructive inﬂuences, we mention diﬀerent natural phenomena (thun-
derstorms, hurricanes and others) and intentional attacks. Such attacks are thoroughly planned
and carried out by professionals, therefore being most dangerous.
These problems are vital for the design of engineering infrastructure and the elaboration of
countermeasures against a negative inﬂuence on the network components. Numerous research
works are dedicated to this subject, e.g., see [1–5].
The basic strategies to choose failed network nodes are based on the analysis of accessibility of
the remaining (operable) nodes from the energy sources. In addition, the idea is to choose such
a strategy that a minimal set of the failed nodes isolates the network from a maximal set of the
remaining nodes. The failed components are selected by the enumeration method or using the
assumptions on the signiﬁcance of components and their inﬂuence on the network structure.
This problem is solved using topological analysis methods for the systems represented in form
of graphs. As a rule, such methods are relatively simple for understanding yet computationally
intensive due to a high dimensionality of the systems.
There exist the following main strategies of attacks on system nodes:
—by a direct enumeration of all possible failure options;
—by the degree of node (i.e., the number of neighbor nodes connected to a given node);
—by maximal traﬃc;
—by minimal traﬃc;
—by betweenness centrality (i.e., the number of paths that connect the consumers and generators
and also pass through a given node).