–ус Eng During last 365 days Approved articles: 2002,   Articles in work: 345 Declined articles: 795 
Library
Articles and journals | Tariffs | Payments | Your profile

Back to contents

Formation of the required number of spanning trees
Demichev Maksim Sergeevich

Student, Department of Information Technology Security, Reshetnev Siberian State University of Science and Technology

660000, Russia, Krasnoyarskii krai, g. Krasnoyarsk, ul. Krasnoyarskii Rabochii, 31

mdemichev@yandex.ru
ƒругие публикации этого автора
 

 
Gaipov Konstantin Eduardovich

PhD in Technical Science

Associate Professor, Department of Electronic Technology and Telecommunications, Reshetnev Siberian State University of Science and Technology

660000, Russia, Krasnoyarskii krai, g. Krasnoyarsk, ul. Krasnoyarskii Rabochii, 31

cyberjam@yandex.ru
ƒругие публикации этого автора
 

 
Korolev Evgenii Mikhailovich

Senior Lecturer, Department of Military Training Center, Reshetnev Siberian State University of Science and Technology

660037, Russia, Krasnoyarskii krai, g. Krasnoyarsk, ul. Pr. Krasnoyarskii Rabochii, 31

boxkem@mail.ru
ƒругие публикации этого автора
 

 
Demicheva Alena Alekseevna

Student, Department of Information Technology Security, Reshetnev Siberian State University of Science and Technology

660031, Russia, Krasnoyarskii krai, g. Krasnoyarsk, ul. Krasnoyarskii Rabochii, 31

DemichevaAlena@yandex.ru
ƒругие публикации этого автора
 

 
Narozhnyi Artem Igorevich

Student, Department of Information Technology Security, Reshetnev Siberian State University of Science and Technology

660000, Russia, Krasnoyarskii krai, g. Krasnoyarsk, ul. Krasnoyarskii Rabochii, 31

artem_narozhnyi@mail.ru
ƒругие публикации этого автора
 

 

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.

Keywords: network topology, switching, routing, cycle, algorithm, matrix, route, spanning tree, protocol, traffic

DOI:

10.25136/2306-4196.2018.3.26308

Article was received:

18-05-2018


Review date:

22-05-2018


Publish date:

22-05-2018


This article written in Russian. You can find full text of article in Russian here .

References
1.
Asanov M.O., Baranskii V.A., Rasin V.V. Diskretnaya matematika. Grafy, matroidy, algoritmy (2001) s 288
2.
Bertsekas, Dimitri. Seti peredachi dannykh / D. Bertsekas, R. Gallager; Perevod s angl. N. B. Likhanova i dr.; Pod red. B. S. Tsybakova.-M. : Mir, 1989.-544 s. : il.
3.
Gol'dshtein A.B., Gol'dshtein B.S.Tekhnologiya i protokoly MPLS,. SPb.: BKhV Ч Sankt-Peterburg, 2005. Ч 304 s.: il. ISBN 5-8206-0126-2
4.
Klark K., Gamil'ton K. Printsipy kommutatsii v lokal'nykh setyakh Cisco.-M.: Izdatel'skii dom "Vil'yams", 2003.-976 s. Ч ISBN 5-8459-0464-1.
5.
Kormen, T., Leizerson, Ch., Rivest, R., Shtain, K. Algoritmy: postroenie i analiz = Introduction to Algorithms / Pod red. I. V. Krasikova. Ч 2-e izd. Ч M.: Vil'yams, 2005. Ч 1296 s. Ч ISBN 5-8459-0857-4.
6.
Olvein V. Struktura i realizatsiya sovremennoi tekhnologii MPLS.-M.: Izdatel'skii dom "Vil'yams", 2004.-480 s. Ч ISBN 5-8459-0633-4
7.
Olifer V.G., Olifer N.A. Komp'yuternye seti. Printsipy, tekhnologii, protokoly. Ц SPb.: Piter, 2000.
8.
Smirnova E.V., Proletarskii A.V., Baskakov I.V., Fedotov R.A. Upravlenie kommutiruemoi sredoi. Ц M.: RUSAKI, 2011. Ц 335 s.
9.
Smirnova E. V., Proletarskii A. V.. Tekhnologii kommutatsii i marshrutizatsii v lokal'nykh komp'yuternykh setyakh : ucheb. posobie Ц M.: Izd-vo MGTU im. N.E. Baumana, 2013. Ц 389, s. : il. Ц (Komp'yuternye sistemy i seti).
10.
Uilson R. Ч Vvedenie v teoriyu grafov, 1977 god, 208 s. Izdatel': Mir, Gorod pechati: Moskva