Route Discovery to Avoid Congestion in Software Defined Networks

Abstract

In computer networks, a centralized control plane model of Software Defined Network (SDN) often suffers from congestion because of this centralized characteristic. Fortunately, some congestion avoidance mechanisms have been introduced, one of which reduces the size of packets to send. However, this is considered less useful because it is longer due to the relatively small number of packets. This paper proposes a route discovery mechanism to find the best routes for packet forwarding to avoid congestion. The method explores Johnson’s algorithm because it is able to take advantage of the previous Dijkstra and Bellman-Ford algorithms. The performance of the networks measured by latency, throughput, and response time shows an improvement.