BBR - A Novel Bandwidth Based Routing Algorithm in Software Defined Networking

Networking refers to the practice of sharing, transporting, and exchanging data between nodes within a shared medium. Data traffic refers to the mass volume of data moving across the computer network at a given time. Due to the advancement of technologies, everyday usage of data is tremendously increased. Nowadays networks are in a need of efficient algorithms to route data. For this, several classical algorithms like Dijkstra, bellman ford, etc were proposed. In Dijkstra, to route data from sending point to the ending point, the shortest path will be considered and that will be utilized for routing the packets. The major disadvantage of using this algorithm is that only the shortest path will be utilized, while the remaining paths will be left unused, and also if all the data transfers are using the same shortest path, then obviously that particular path will be congested. This causes a greater potential for network traffic to cause data loss. In order to bridge this gap, we proposed a BBR(Bandwidth based Routing) algorithm that selects a data path which has the maximum bandwidth for packet transmission in Software Defined Network (SDN). This reduces network traffic data loss and achieved better QoS (Quality of Service). For experimentation with BBR, multipath topology was considered and implemented in the simulation tool Mininet. The experimentation analysis revealed that the BBR has outperformed the state of art algorithms.