An Improved Ant Colony Algorithm for Routing in Software Defined Networking

摘要

It is difficult for the best-effort service way of traditional network to meet QoS requirements of applications. Software Defined Networking (SDN) raises a good idea for the above-mentioned issue. The controller can control and manage network resources in SDN. This paper proposes an improved ant colony algorithm by mainly adding the QoS constraints. This algorithm calculates routes meeting QoS requirements through obtaining the network topology and resources usage status from the controller. When the network is in state of heavy load, it is impossible for the bandwidth of the single path to meet the bandwidth requirements of applications. And this algorithm uses the multipath aggregation strategy to distribute the flow to the multiple paths and makes the sum of bandwidth of these multiple paths satisfy the bandwidth requirement of applications. Experiment results show that this algorithm can meet latency and bandwidth requirements of applications.