Simulation of Minimum Path Estimation in Software Defined Networking Using Mininet Emulator

Abstract

Software-Defined Networking (SDN) has become a significant topic of discussion among the network service providers, operators, and equipment vendors where control planes are separated from the data plane in networking devices. This paper implements Bellman-Ford algorithm for computing the shortest path in Software-Defined Networking using Mininet emulator. Bellman–Ford algorithm computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. This algorithm is versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. All the simulation has been done using POX as an OpenFlow controller, OpenvSwitch (OVS) as a forwarding function and Mininet which installed on Ubuntu Virtual Machine (VM). The result of this paper shows that the simulation of SDN with OpenvSwitch (OVS) and POX controller runs Bellman-Ford algorithm for finding the minimum path among the designed network topology.