Shortest Path Routing Performance Evaluation over SDN Environment

Abstract

Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology defined as software-defined networking (SDN) based on shortest path first dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path first protocol are simulated on Mininet. The POX controller with Mininet programming feature for creating smart topologies was chosen. In this research, the SDN network using Dijkstra’s algorithm, Bellman-Ford algorithm, extended Dijkstra’s algorithm and Floyd Warshall Algorithm were implemented. The quality factors of SDN created by using four algorithms are measured in terms of delay, jitter, latency, packet loss, transmit, received, throughput, and bandwidth based on experimental results and European Telecommunications Standards Institute (ETSI) data. The performance parameters of SDN network topology created using Dijkstra’s, bellman ford, extended Dijkstra’s, and Floyd Warshall algorithms were compared and the experimental results showed that Bellman-Ford algorithm is better in terms of performance parameters than the other three algorithms.