Generate QR code
Open Access
Subscription Access
Routing in Geographical Networks with Message Ordering
https://doi.org/10.17586/0021-3454-2026-69-3-225-232
Abstract
A routing algorithm designed for use in geographic networks is presented. The basis of the proposed procedure is Dijkstra's algorithm, used to find the shortest path in directed graphs. To increase the efficiency of message delivery in the network, an additional stage is proposed — the preliminary ordering of the router's output queue, which is based on optimal rules that affect the data transfer rate. The criterion of optimality in the proposed approach is the minimum message delivery time, which is a key factor in modern network technologies. The rules of message ordering are formulated for different scenarios when there are both partially ordered and unordered groups of messages in the queue, which makes it possible to adapt the algorithm to different network conditions and improve overall system performance. The modeling results are presented, demonstrating that the implementation of the proposed algorithm leads to a significant reduction in message delivery time compared with traditional routing methods. This opens up new opportunities for the development of high-performance network solutions that can effectively cope with the growing demands for speed and reliability of data transmission in modern information technology.
About the Author
V. S. Tyulnikov
Concern CSRI Elektropribor
Russian Federation
Russian Federation
Viktor S. Tyulnikov — Post-Graduate Student; Concern CSRI Elektropribor; Department of Mathematical and Functional Software
St. Petersburg
References
1. Bekmezci I., Sahingoz O.K., Temel S. Ad-Hoc Netw., 2013, no. 3(11), pp. 1254–1270.
2. Hentati A.I., Fourati L.C. Comput. Stand. Interfaces, 2020, vol. 72, art. 103451.
3. Inzartsev A.V., Kiselev L.V., Kostenko V.V., Matvienko Y.V., Pavin A.M., Shcherbatyuk A.F. Podvodnyye robototekhnicheskiye kompleksy: sistemy, tekhnologii, primeneniye (Underwater Robotic Complexes: Systems, Technologies, Applications), Vladivostok, 2018, 368 р. (in Russ.)
4. Yukhinin E. Marine Collection, 1999, no. 4. (in Russ.)
5. Frank M.O., Ovchinnikov K.D. Proceedings of the Krylov State Research Center, 2020, Special Issue 2, pp. 160–164. (in Russ.)
6. Slim M., Saied M., Mazeh H., Shraim H., Francis C. Gyroscopy and Navigation, 2021, no. 2(12), pp. 166–177.
7. Poselentseva D.Yu., Zamyatina E.B. Bulletin of Perm University, 2019, no. 4.
8. Kulagin G.I. Bulletin of Bauman Moscow State Technical University. Series: Instrument Engineering, 2023, no. 1. (in Russ.)
9. Cormen Th.H., Leiserson Ch.E., Rivest R.L., Stein C. Introduction to Algorithms, The MIT Press, 2009, 1292 р.
10. Koryachko V.P., Perepelkin D.A. Electrosvyaz, 2014, no. 12. (in Russ.)
11. Rajasekaran K., Balasubramanian K. Intern. J. of Computer Network and Information Security (IJCNIS), 2016, no. 1(8), pp. 27–34.
12. Shuvakov V.P., Varaksina I.Yu. T-Comm: Telecommunications and Transport, 2014, no. 1(8), pp. 29–32. (in Russ.)
13. Novikov S.N. Bulletin of SibGUITI, 2013, no. 1(21), pp. 57–67. (in Russ.)
14. Bogatyrev V.A., Parshutina S.A. Bulletin of Computer and Information Technologies, 2015, no. 12(138), pp. 23–28. (in Russ.)
15. Gruzlikov A.M., Kolesov N.V., Litunenko E.G., Skorodumov Yu.M. TISU, 2022, no. 6. (in Russ.)
16. Kuznetsov K.A., Paramonov A.I., Muthanna A.S.A., Kucheryavy A.E. Proceedings of Educational Institutions of Communications, 2024, no. 4(10), pp. 62–72. (in Russ.)
Review
For citations:
Tyulnikov V.S. Routing in Geographical Networks with Message Ordering. Journal of Instrument Engineering. 2026;69(3):225-232. (In Russ.) https://doi.org/10.17586/0021-3454-2026-69-3-225-232
Views:
86
JATS XML
Email this article 