{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:43:34Z","timestamp":1760150614769,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:00:00Z","timestamp":1703289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["FEFE-2023\u20130004"],"award-info":[{"award-number":["FEFE-2023\u20130004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities.<\/jats:p>","DOI":"10.3390\/a17010007","type":"journal-article","created":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T20:48:37Z","timestamp":1703450917000},"page":"7","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks"],"prefix":"10.3390","volume":"17","author":[{"given":"Konstantin","family":"Gaipov","sequence":"first","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"given":"Daniil","family":"Tausnev","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7568-6874","authenticated-orcid":false,"given":"Sergey","family":"Khodenkov","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"given":"Natalya","family":"Shepeta","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"given":"Dmitry","family":"Malyshev","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"given":"Aleksey","family":"Popov","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0667-4001","authenticated-orcid":false,"given":"Lev","family":"Kazakovtsev","sequence":"additional","affiliation":[{"name":"Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarsky Rabochy Ave, 660037 Krasnoyarsk, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, J., Wang, L., and Zhan, P. (2016, January 6\u201310). SADR: Network status adaptive QoS dynamic routing for satellite networks. Proceedings of the 2016 IEEE 13th International Conference on Signal Processing (ICSP), Chengdu, China.","DOI":"10.1109\/ICSP.2016.7878015"},{"key":"ref_2","unstructured":"Smirnov, D.V. (2020, January 14\u201315). Modified Gallagher model of infocommunication networks taking into account losses. Proceedings of the XXII All-Russian Scientific and Technical Conference (Modern Problems of Radioelectronics), Russia, Krasnoyarsk."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/LCA.2021.3061408","article-title":"The Case for Dynamic Bias in Global Adaptive Routing","volume":"20","author":"Kasan","year":"2021","journal-title":"IEEE Comput. Archit. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chakrabarty, S., Engels, A.W., and Thathapudi, S. (2015, January 19\u201322). Black SDN for the Internet of Things. Proceedings of the IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, Dallas, TX, USA.","DOI":"10.1109\/MASS.2015.100"},{"key":"ref_5","unstructured":"Bertsekas, D.P., and Gallager, R.G. (1992). Data Networks, Prentice Hall."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the K Shortest Loopless Paths in a Network","volume":"17","author":"Yen","year":"1971","journal-title":"Manag. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Michel, L. (2015). Integration of AI and OR Techniques in Constraint Programming, Springer. CPAIOR 2015. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-319-18008-3"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MCOM.2002.1106159","article-title":"An overview of constraint-based path selection algorithms for QoS routing","volume":"40","author":"Kuipers","year":"2002","journal-title":"IEEE Commun. Mag."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Shcherba, E.V., and Litvinov, G.A. (2018, January 14\u201316). On an optimal solution for multi-constrained routing problem in the over-constrained case. Proceedings of the 2018 Moscow Workshop on Electronic and Networking Technologies (MWENT), Moscow, Russia.","DOI":"10.1109\/MWENT.2018.8337249"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chen, X., Cai, H., and Wolf, T. (2015, January 10\u201313). Multi-criteria Routing in Networks with Path Choices. Proceedings of the 2015 IEEE 23rd International Conference on Network Protocols (ICNP), San Francisco, CA, USA.","DOI":"10.1109\/ICNP.2015.36"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Mezni, A., Dumitrescu, E., Niel, E., and Ahmed, S.B. (2018, January 25\u201329). Multi Criteria Automatic Generation of Optimal Routing for WSN. Proceedings of the 2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC), Limassol, Cyprus.","DOI":"10.1109\/IWCMC.2018.8450311"},{"key":"ref_12","unstructured":"Taft-Plotkin, N., Bellur, B., and Ogier, R. (1999, January 23\u201325). Quality-of-service routing using maximally disjoint paths. Proceedings of the 1999 Seventh International Workshop on Quality of Service IWQoS\u201999 (Cat. No.98EX354), Perth, Australia."},{"key":"ref_13","unstructured":"Huang, G.M., and Hsieh, W.-L. (1991, January 2\u20135). A parallel textured algorithm for optimal routing in data network. Proceedings of the IEEE Global Telecommunications Conference GLOBECOM \u201991: Countdown to the New Millennium. Conference Record, Phoenix, AZ, USA."},{"key":"ref_14","unstructured":"Huang, G.M., and Zhu, S. (1995, January 25\u201328). A fast distributed optimal routing algorithm for multicommodity large data networks. Proceedings of the 9th International Parallel Processing Symposium, Santa Barbara, CA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Toyoda, K., Okamoto, T., and Koakutsu, S. (2017, January 19\u201322). An optimal routing search method on the network routing problem using the sequential minimal optimization. Proceedings of the 2017 56th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE), Kanazawa, Japan.","DOI":"10.23919\/SICE.2017.8105653"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Jain, A., and Chaudhari, N.S. (2012, January 3\u20135). Genetic Algorithm for Optimizing Network Load Balance in MPLS Network. Proceedings of the 2012 Fourth International Conference on Computational Intelligence and Communication Networks, Mathura, India.","DOI":"10.1109\/CICN.2012.119"},{"key":"ref_17","unstructured":"Zhu, S., and Huang, G.M. (1996, January 13). A new packet-loss minimization routing algorithm for ATM high-speed data networks. Proceedings of the 35th IEEE Conference on Decision and Control, Kobe, Japan."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Wang, X., Li, T., Qiu, J., and Diao, W. (2023, January 12\u201314). High Performance Inter-satellite Routing Design of Terahertz Interface. Proceedings of the 2023 4th International Conference on Electronic Communication and Artificial Intelligence (ICECAI), Guangzhou, China.","DOI":"10.1109\/ICECAI58670.2023.10176766"},{"key":"ref_19","first-page":"1","article-title":"Adaptive Routing Design for Flying Ad Hoc Networks: A Joint Prediction Approach","volume":"26","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_20","unstructured":"Dong, D., and Li, C. (2023, January 21\u201325). LARE: A Linear Approximate Reinforcement Learning Based Adaptive Routing for Network-on-Chips. Proceedings of the 2023 IEEE International Symposium on Circuits and Systems (ISCAS), Monterey, CA, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"101799","DOI":"10.1109\/ACCESS.2023.3316211","article-title":"Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks","volume":"11","author":"Xu","year":"2023","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Shruthi, S. (2017, January 10\u201311). Proactive routing protocols for a MANET\u2014A review. Proceedings of the 2017 International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC), Palladam, India.","DOI":"10.1109\/I-SMAC.2017.8058294"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Perepelkin, D., and Ivanchikova, M. (2020, January 8\u201311). Research of Neural Network Architectures for Solving Adaptive Routing Problems in Multiprovider Networks of Distributed Data Centers. Proceedings of the 9th Mediterranean Conference on Embedded Computing (MECO), Budva, Montenegro.","DOI":"10.1109\/MECO49872.2020.9134253"},{"key":"ref_24","first-page":"89","article-title":"Modied Genetic Algorithm with Greedy Heuristic for Continuous and Discrete p-Median Problems. Facta Universitatis","volume":"30","author":"Kazakovtsev","year":"2015","journal-title":"Ser. Math. Inform."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"3922","DOI":"10.1016\/j.asoc.2013.04.009","article-title":"A hybrid metaheuristic approach for the capacitated p-median problem","volume":"13","author":"Yaghini","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.31449\/inf.v44i1.2737","article-title":"Application of Algorithms with Variable Greedy Heuristics for k-Medoids Problems","volume":"44","author":"Kazakovtsev","year":"2020","journal-title":"Informatica"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/TNET.2022.3208201","article-title":"Asymmetry-Aware Load Balancing With Adaptive Switching Granularity in Data Center","volume":"31","author":"Liu","year":"2023","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.23919\/JCC.2019.07.015","article-title":"An adaptive routing algorithm for integrated information networks","volume":"16","author":"Wang","year":"2019","journal-title":"China Commun."},{"key":"ref_29","unstructured":"He, Y., and Pelagatti, S. (2006, January 24\u201328). CRT: An Adaptive Routing Protocol for LEO Satellite Networks. Proceedings of the 2006 2nd International Conference on Information & Communication Technologies, Damascus, Syria."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Huang, Y., Cao, W., Liu, X., Jiang, X., Yang, J., and Yang, F. (2021, January 18\u201320). An Adaptive Multipath Routing for LEO Satellite Network. Proceedings of the 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), Chongqing, China.","DOI":"10.1109\/IMCEC51613.2021.9482379"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Xu, X., Tang, H., Wu, J., Zeng, H., Qian, L., and Liu, X. (2022, January 28\u201330). Hybrid Path Selection and Overall Optimization for Traffic Engineering. Proceedings of the 2022 International Communication Engineering and Cloud Computing Conference (CECCC), Nanjing, China.","DOI":"10.1109\/CECCC56460.2022.10069947"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"55916","DOI":"10.1109\/ACCESS.2019.2913776","article-title":"Reinforcement Learning Based Routing in Networks: Review and Classification of Approaches","volume":"7","author":"Mammeri","year":"2019","journal-title":"IEEE Access"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:41:11Z","timestamp":1760132471000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,23]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["a17010007"],"URL":"https:\/\/doi.org\/10.3390\/a17010007","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,12,23]]}}}