Dynamic Routing in Software-Defined Networks

The Internet is definitely the greatest contributor to globalization which has brought together the whole world and has made every nook and corner attainable. The conventional IP networks have not been able to serve the purpose of a simplified infrastructure even after their extensive acquisition. Service provider networks are not fully fledged in providing (1) fast switching in the core network without any routing lookup, load balancing and retort to faults, (2) reorganize the network according to prevailing network policies and terms simultaneously. Software-defined network (SDN) which operates on OpenFlow protocol is a revolution in networking which aims to remodel the traditional network by disintegrating the data and control planes. It bifurcates the control logic from the various network devices like routers and switches, by providing a core supervisory control logic for the entire network and delivering aptness to code the network. In traditional routing, the information is flooded to the entire network which causes overutilization of resources, high bandwidth requirements, and many other drawbacks. Compared to the legacy routing, SDN is more effective in route computations and provides complete control for packet transmission. The paper proposes a method to find the shortest path routing between the source and destination using the Bellman–Ford routing algorithm. Secondly, the routing emulations for various network topologies are presented and compared using Mininet which implements routing for SDN. The comparative analysis of both the scenarios shows that the routing algorithm proposed in this paper contributes utmost QoS.