Dynamic Load Balancing In Software Defined Networking
Gaurav Tiwari1, V Deeban Chakaravarthy2, Aditi Rai3

1Gaurav Tiwari, Btech Department of Computer Science and Engineering, SRM University
2V Deeban Chakaravarthy, Assistant Professor (Sr.G) , Department of Computer Science and Engineering, SRM University, Chennai (Tamil Nadu), India.
3Aditi Rai, B. Tech Department of Computer Science And Engineering, SRM University, Chennai (Tamil Nadu), India.

Manuscript received on 18 June 2019 | Revised Manuscript received on 25 June 2019 | Manuscript published on 30 June 2019 | PP: 2706-2712 | Volume-8 Issue-5, June 2019 | Retrieval Number: E6911068519/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

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.
Keywords: Dynamic Load, Networking, Dijkstra’s Algorithm

Scope of the Article: Foundations Dynamics