Performance analysis of flow-based routing in software-defined networking
Sofia Naning Hertiana, Hendrawan Hendrawan, Adit Kurniawan · 2016
In this paper, we analyze flow-based routing schemes in SDN. Specifically, we study the flow-based routing performance; combining the knowledge of the link condition and updating the period for calculating the path. The framework uses centralized control of SDN where the SDN controller calculates available paths to determine the routing policy based on a global knowledge network. This flow-based routing design aims to reduce the impact of network congestion by finding a decent way, and to choose one path that has the greatest residual bandwidth. We evaluate the effectiveness of flow-based routing in SDN and investigate its performance due to changes in the update period by using simulations. Simulation results shows that the scheme has a flow-based routing overhead that is smaller than a link state routing such as OSPF. Also, this scheme still produces a good performance for different update periods.