MAIN PAGE
> Back to contents
Publications of Korolev Evgenii Mikhailovich
Cybernetics and programming, 2018-3
|
Demichev M.S., Gaipov K.E., Korolev E.M., Demicheva A.A., Narozhnyi A.I. - Formation of the required number of spanning trees
|
|
pp. 10-24
|
DOI: 10.25136/2644-5522.2018.3.26308
Abstract: The subject of the study is to obtain spanning trees for propagating traffic over broadcast channels using the known network topology and known routes. To solve this problem, a mathematical model is constructed in which the network topology is regarded as an undirected graph, but the described solution is also suitable for an oriented graph, where a separate direction is represented by a separate edge. The proposed solution does not require flexible scalability of the network, therefore, when changing the initial input parameters, it is necessary to repeatedly execute the sequence of algorithms described in the article. The development of the algorithm was carried out by an experimental-theoretical method using the mathematical model of a graph constructed from the known topology of the network and the compilation of spanning trees on its basis. The result of the presented work is in determining the necessary number of spanning trees for the optimal solution of the network routing problem. The novelty of this research is the possibility of applying the developed solution in the link-layer networks according to the OSI reference model, exclusively for broadcasting traffic of a given network topology.
|