The increase of new computing technologies, including big data, Internet of Things and cloud computing, has caused significant changes in the method of storing, collecting and transferring information and data. Along with these computing trends, new challenges such as network management and improvement, optimal use of resources and fast data transfer have also emerged. In order to overcome these challenges, software-based networks (SDN) are used as a desirable model for next-generation networks. One of the big challenges facing this type of network is choosing a safe path for data transmission on the network path; In such a way that it can improve the reliability of the path by choosing a suitable path between controllers and network switches with the lowest cost and delay. The purpose of this research is to choose the best and safest path for data transfer in software-based networks. For this purpose, using ant colony genetic algorithms and running them on a network graph with 20 nodes in MATLAB software, the cost, delay, and reliability components of each node in the network path were evaluated and compared. The results showed that by running these algorithms several times and considering the type of classification of transmitted packets in the network, the safest, least expensive, and shortest path was calculated and compared accurately, taking into account the delay, cost, and reliability constraints, and the optimal path between the origin and destination to the associated switches and controllers with the highest level of reliability was announced by the genetic algorithm.
Copyrights © 2026