Comparative analysis between SPF and BAR algorithm in SDN unicast network

Abstract

Software Defined Networking (SDN) is a new idea of networking where Central Server takes all the decisions and finds a path for a packet to move from source to destination whereas in traditional networking a router takes decisions and finds path for the packet. The main advantage of SDN is that it reduces the time complexity of packet transfer as routers do not have to look up routing table for a path and it can reduce the packet loss to a minimum level. In traditional network, the routers make decisions according to their routing table which most of the time cannot grasp the full network topology. However, in SDN, central server possesses the entire routing table to control the data flow of network. As a result, the percentage of packet loss becomes at a minimal level. Though making packet loss zero percent cannot be achievable due to insufficient data flow path or any other physical factors, it is still less than the traditional network. In this paper, we have implemented two algorithms, Shortest Path First (SPF) and Bandwidth Aware Routing (BAR). We have simulated the algorithms in different topology using JAVA. We have noted down the packet loss, latency, path cost and bandwidth. We have developed our thesis between the comparison of Shortest Path First (SPF) and Bandwidth Aware Routing (BAR). We have simulated network graph on the both algorithms to get results of latency, bandwidth, packet loss, path cost. We hope that this comparison will help to get a clear picture about the advantages and disadvantages of these algorithms