Traffic Load Balancing in SDN Using Round-Robin and Dijkstra Based Methodology

In this paper, the authors presented the different algorithm characteristics in Software-Defined Networking (SDN). Nowadays, managing a massive volume of traffic on networks and thousands of clients on the server is a challenging problem. Also, it is not easy to handle such a massive load on a single server. Therefore, the authors implemented round-robin methodology and simple random methodology on client-server-based architecture and implemented the Dijkstra load balancing algorithm and round-robin methodology on fat-tree topology. The analysis and implementation have been done using a Mininet tool and Iperf tool with an RYU controller. As a result, the Dijkstra load balancing methodology goes well for fat-tree topology.