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.
Keywords: Ant Colony Algorithm; Multipath Aggregation; QoS (Quality of Service); Routing Algorithm; SDN (Software Defined Networking)
Document Type: Research Article
Affiliations: 1: Computer Science and Technology School of UESTC, 611731, Chengdu of China 2: School of Information Science and Technology, Southwest Jiaotong University, 610031, Chengdu of China
Publication date: 01 January 2016
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content