N.V. Kolesov , А. М. Gruzlikov , Y.М. Skorodumov , V.S. Tiulnikov
2026-04-29
Abstract ▼
This paper examines a class of telecommunication networks with mobile nodes, an important subclass within which is the so-called geography-aware networks. Their distinguishing feature is the availability of information about the geographic coordinates of all nodes in the network to each individual node, whereby each node is aware of the complete topology of the network graph, which enables rapid identification of the required number of information transmission routes between any two nodes. The purpose of this article is to investigate multipath routing algorithms. To this end, we propose a method for the automatic synthesis of adequate test models capable of representing networks of virtually unlimited complexity. The proposed solution is based on a compositional approach, in which a relatively simple network fragment that satisfies given constraints is first formed, and then the resulting model is constructed as a composition of copies of this fragment. To investigate the efficiency of multipath routing algorithms, we propose a compositional method for the random synthesis of test models of complex networks that satisfy constraints on distances between the vertices. This method was applied to the investigation of two routing algorithms, resulting in a large body of illustrative model data. The obtained results, presented in the form of graphs, demonstrate an increase in the gain in message transmission time as the queue length in the target flow grows. While the efficiency of multipath routing is insignificant under low network load conditions, its usefulness increases with growing network load. A similar increase in efficiency is demonstrated when transitioning from an algorithm that does not allow intersecting paths to an algorithm that allows such intersections.
