Fast and efficient bandwidth-delay constrained routing algorithm for SDN networks

In this paper, we propose a new routing algorithm which calculates bandwidth-delay constrained routes in the fast and efficient manner. The algorithm is designed for the software-defined backbone networks, where the control plane is separated from the data plane and logically centralized. Besides providing the required quality of service (QoS), the algorithm aims to maximize utilization of network resources, as that is the major interest of the infrastructure providers. To reduce the computational complexity of this complex traffic engineering task, we consider the control framework which classifies traffic flows in a finite number of categories based on the level of delay sensitivity. The simulation results show that the proposed approach to QoS provisioning, although relatively simple, leads to smaller amount of rejected QoS requests under a wide range of system parameters than the competitive complex solutions.