Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks
Open Access
- 23 December 2023
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 17 (1) , 7
Abstract
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.Keywords
Funding Information
- Ministry of Science and Higher Education of the Russian Federation (FEFE-2023–0004)
This publication has 29 references indexed in Scilit:
- Black SDN for the Internet of Things2015
- A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem2015
- A hybrid metaheuristic approach for the capacitated p-median problemApplied Soft Computing, 2013
- Genetic Algorithm for Optimizing Network Load Balance in MPLS Network2012
- CRT: an Adaptive Routing Protocol for LEO Satellite Networks2006
- Quality-of-service routing using maximally disjoint paths2003
- A parallel textured algorithm for optimal routing in data network2002
- An overview of constraint-based path selection algorithms for QoS routingIEEE Communications Magazine, 2002
- A fast distributed optimal routing algorithm for multicommodity large data networks2002
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971