Algorithm for constructing routing to ensure fault tolerance of the communication network
https://doi.org/10.31432/1994-2443-2024-19-2-84-95
Abstract
Introduction. The efficiency, reliability and scalability of a communication network largely depend on the choices made by the routing algorithm. This is especially true now, due to frequent escalations of military conflicts, the consequences of which can affect the stability and reliability of network communications.
Purpose. Formalization of an algorithm that ensures fault tolerance of a communication network by constructing optimal routing.
Methods. Mathematical modeling, as well as experimental testing of the presented model based on various geodata through the practical implementation of a formalized algorithm.
Results. A mathematical model of the algorithm is proposed, which is based on algorithms for constructing a minimum spanning tree, as well as an example of its implementation.
Conclusions. The presented algorithm allows you to build routing that ensures fault tolerance of the communication network, in conditions of theoretical destruction of nodes in communication networks by determining the probability of the existence of adjacent nodes.
About the Authors
G. O. Sorokin
MIREA - Russian Technological University
Russian Federation
Russian Federation
Gleb Olegovich Sorokin
119454, Moscow, Vernadskogo Avenue, 78
A. V. Sinitsyn
MIREA - Russian Technological University
Russian Federation
Russian Federation
Alexander Vladimirovich Sinitsyn, Ph.D., Head of Department, Associate Professor of the Department of Information Processes and Systems
119454, Moscow, Vernadsky Avenue, 78
References
1. Ma J., Ma J., WeiJ. Robustness of probability routing strategy in interconnection networks. Engineering Research Express. 2024;6(2):025414. https://doi.org/10.1088/2631-8695/ad4849
2. Barabási A.-L. Network Science. Cambridge University Press, 2016. 475 p. ISBN10:1107076269
3. Albert R., Barabasi A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics. 2002;74(1):47. https://doi.org/10.1103/RevModPhys.74.47
4. Smelyanskiy R., Shalimov A. (2018). Big Data and Software Defined Networks. Institution of Engineering and Technology (United Kingdom). 2018. https://doi.org/10.1049/PBPC015E
5. Sinitsyn A.V., Sinitsyn A. A., ZhavoronkovaO. G. Algorithm for building optimal routingfor a reliable communication network. Informatization and Communication. 2023;(5):49-56. (In Russ.). https://doi.org/10.34219/2078-8320-2023-14-5-49-56
6. Belkacem, Salima Nait and Abbas, Moncef (2022). New Algorithm Permitting the Construction of an Effective Spanning Tree. Foundations of Computing and Decision Sciences, vol.48, no.3, 2023, pp. 313-329. https://doi.org/10.2478/fcds-2023-0012
7. Sotirov R., Verchére Z. The quadratic minimum spanning tree problem: lower bounds via extended formulations. Vietnam Journal of Mathematics. 2024. https://doi.org/10.1007/s10013-024-00694-y
Review
For citations:
Sorokin G.O., Sinitsyn A.V. Algorithm for constructing routing to ensure fault tolerance of the communication network. Information and Innovations. 2024;19(2):84-95. (In Russ.) https://doi.org/10.31432/1994-2443-2024-19-2-84-95
Views:
216
Email this article 