Open AccessSearch algorithm for loopless routes
Author(s) -
Maksim Sergeevich Demichev,
К. Э. Гаипов
Publication year - 2020
Publication title -
programmnye sistemy i vyčislitelʹnye metody
Language(s) - English
Resource type - Journals
ISSN - 2454-0714
DOI - 10.7256/2454-0714.2020.4.33605
Subject(s) - algorithm , computer science , network topology , dijkstra's algorithm , node (physics) , open shortest path first , reduction (mathematics) , search algorithm , routing (electronic design automation) , topology (electrical circuits) , routing protocol , computer network , shortest path problem , theoretical computer science , mathematics , link state routing protocol , engineering , graph , geometry , structural engineering , combinatorics
The subject of this research is the search algorithm for loopless routes from transmitter to the recipient of network traffic in the conditions of a known network topology. In designing data transmission network, one of the primary problems is the formation of network traffic routing, due to the fact that heavy traffic often cause the occurrence of bottlenecks in form of the overloaded communication node, which results in speed reduction of data transmission. This article provides the search algorithm for loopless routes from transmitter to the recipient of network traffic; the result is presented as a set of loopless routes in accordance with the specified network topology. The article also provides the software code of the algorithm written in the C# language, as well as the results of test solutions of the specified topologies. The algorithm was developed via experimental and theoretical methods, on the bases of the available route search algorithms, such as Floyd's algorithm and Dijkstra's algorithm, as well as mechanisms of static and dynamic routing, such as RIP, OSPF, and EIGRP. The novelty of this work consists in elaboration of search algorithm for loopless routes from transmitter to the recipient in the conditions of the available network topology; and in comparison of the acquired results with other methods of formation phase variables. This algorithm allows generating a list of all loopless routes within the indicated network topology between the pair of interacting nodes.