| Summary: | Background. When designing/modernizing and operating communication networks,
one of the most important tasks is to ensure its stability. Real communication networks,
as a rule, are large-scale, and, accordingly, it is important to obtain solutions as
close to optimal as possible as a necessary factor in saving resources. The stability of the
communication network in terms of survivability is directly related to the number of independent
routes between the vertices of the modeling graph that form the information communication
directions. The authors will consider the issue of developing algorithms for
constructing independent paths and show the effectiveness of using the procedures for
forming an optimal spanning tree to solve the problem of ensuring the stability of the communication
network. Purpose of the study. Development of algorithms for constructing
optimal independent paths between given vertices of the graph in order to ensure the required
livability of the communication network while minimizing the cost of upgrading the
communication network topology. Materials and methods. Algorithms of graph theory,
both well-known and newly developed, are used. In particular, greedy algorithms are considered,
as well as other heuristic algorithms. Results. Heuristic algorithms for constructing
optimal independent paths between the given vertices of the communication network graph
are developed, the effectiveness of using the approach of forming an optimal spanning tree
for solving the problem of ensuring the stability of the communication network is shown.
Conclusions. Improvement of algorithms for constructing an optimal spanning tree was
proposed, which was used to construct independent paths between the vertices of a graph,
and the efficiency of using procedures for forming a spanning tree to solve the problem of
ensuring the stability of a communication network was shown.
|
|---|
