Efficient unicast routing algorithms in Software-Defined Networking

The recently developed Software-Defined Networking (SDN) provides flexibility, scalability and reduce the cost of hardware for operators and vendors. In this paper, we propose four routing algorithms in SDN to minimize network latency and balance the traffic load of each switch link in a network. The first routing algorithm is the shortest path first (SPF) algorithm. The SPF algorithm can find the shortest path with maximum bottleneck bandwidth (MBB) among all shortest paths. The second algorithm is the bandwidth aware routing (BAR) algorithm. The BAR algorithm can find a path with MBB on a network. The third algorithm is the k-SPF, which can find a path with MBB among the first k shortest paths. Finally, our fourth algorithm k-BAR can find the shortest path among the first k MBB paths on a network. Simulation results show that the performance of our algorithms is better than previous works.