Dynamic load balancing in software defined networking

Abstract

In this research paper we propose an algorithm of Dijkstra’s algorithm of finding the shortest path from one point to other. It generates a SPT (shortest path tree) with given source as root. Two sets are maintained, shortest path tree included vertices is contained in set one, other set includes vertices which are not included in shortest path tree. At all steps of the algorithm, a vertex can be found which is in the other set and has minimum distance from the source. Computer networking has scaled great heights in past few years. And traditional networks had failed the s of many of the people. People want quality of service and hence various network applications provide quality of service to customers. In this paper we try to balance load using software defined networking with the use of RYU controller using mininet tool. Nowadays a lot of data is sent by various people using various networks. There should be no data loss and nd there should be no delay in time taken for data transmission. We develop new mechanism for guaranteed latency requirements of those applications who give guaranteed delivery of data.