Performance analysis of various shortest-path routing algorithms using RYU controller in SDN

In this paper, our objective is to establish efficient routing in SDN with low latency and high throughput. To implement this research work, we have used the mininet emulator, Abilene topology, RYU controller and various shortest path algorithms such as Dijkstra (Dij), Extended Dijkstra (EDij), and Modified Extended Dijkstra (MEDij) and Round Robin (RR). Each algorithm runs separately, one by one, for 120 seconds. These algorithms are analysed in terms of throughput and latency as performance parameters by evaluating their average mean, geometric mean, and harmonic mean value to find which algorithm is the optimal choice among the above-discussed algorithms. The research work is novel because previous studies have implemented the shortest path algorithms using Floodlight or POX controller, but this study uses a Python supported RYU controller and performs better compared to previous studies. The research work done in this article can be extended to improve load balancing and security across nodes, and routing links using meta-heuristic algorithms like Particle Swarm Optimisation (PSO). There is also scope for exploring and implementing deep learning-supported QoS-based approaches for effective routing optimisation. © 2023 Inderscience Enterprises Ltd.