Open AccessAn Efficient Routing Algorithm for Software Defined Networking using Bellman Ford Algorithm
Author(s) -
Kavikondala Praveen Kumar Rao,
T. Senthil Murugan
Publication year - 2019
Publication title -
international journal of online and biomedical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 8
ISSN - 2626-8493
DOI - 10.3991/ijoe.v15i14.11546
Subject(s) - dijkstra's algorithm , computer science , latency (audio) , shortest path problem , algorithm , computation , suurballe's algorithm , software defined networking , k shortest path routing , graph , a* search algorithm , software , distributed computing , theoretical computer science , telecommunications , programming language
Software-Defined Networking (SDN) is the developing technology and has the advantages of handling dynamic nodes in the network with improved performance. SDN has the problem of allocating the resources to the user with high latency and this affects the overall system performance. To solve this problem, the routing method based on Bellman Ford Algorithm (BFA) is proposed in the SDN. The Bellman-Ford has less computation time in identifying the shortest path in the nodes of SDN graph. The BFA is applied to identify the optimal path for the nodes to the user with low latency. The BFA is compared with Dijikstra’s algorithm to analyze its performance. The experimental outcome shows that the BFA has lower latency compared to the Dijkstra's algorithm. The lower computation time is achieved due to BFA has a lower magnitude time in vertices and edges compared Dijkstra's algorithm. The Dijkstra’s algorithm has the latency of 10.8 ms, while proposed BFA has the latency of 2.97ms.