Overcoming the Limitation of Dijkstra's Routing Algorithm to Select Optimal Controller in Software defined Network

  1. Haeeder Munther Noman
  2. Mahmood Jalal Ahmad Al Sammarraie
  3. Ali Abdulwahhab Abdulrazzaq
Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

Software-Defined Networks employ software-based controllers and application programming interfaces to communicate with underlying hardware infrastructure in order to control network traffic. This study addressed two challenges. Firstly, it suggested the Bellman-Ford algorithm to overcome the drawbacks of Dijkstra's algorithm for packet routing between nodes in dynamic and large-scale networks. Second, the Bellman-Ford algorithm was used to determine the best among two software-defined network controllers: Floodlight and POX. Our results have showed that Floodlight is better than POX in terms of minimum, maximum, and average_RTT which may improve the experience of application usage and allow the applications to be more responsive.

Article activity feed

  1. Version published to 10.21203/rs.3.rs-7291089/v1 on Research Square