• Electronics Optics & Control
  • Vol. 27, Issue 12, 6 (2020)
LIU Yi1、2, LI Jianhua1, and CHEN Yu3
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • 3[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1671-637x.2020.12.002 Cite this Article
    LIU Yi, LI Jianhua, CHEN Yu. A Multi-path Traffic Scheduling Algorithm Based on Ant Colony Optimization[J]. Electronics Optics & Control, 2020, 27(12): 6 Copy Citation Text show less

    Abstract

    To solve the problems of frequent collision of elephant flows, severe link congestion and unbalanced load in data center networks, a multi-path traffic scheduling algorithm based on Ant Colony Optimization (ACO) is proposed.The algorithm combines the multi-path characteristics of network topology with the advantages of Software Defined Network (SDN) global view.First, the large and small flows are detected by using the sFlow controller.Then, the K short path algorithm is used to add the non-shortest paths on the basis of the shortest path, and calculate the criticality of each path in the path library.The less critical path is selected as the candidate path to reduce the cost of the scheduling algorithm.Finally, according to the characteristics of the large and small flows, the link transmission cost and the pheromone's update method in the ACO are set respectively, and the multi-path traffic scheduling is realized by calculating the number of optimal paths and assigning weights.Simulation results show that under different-type traffic modes, the proposed algorithm effectively improves the average network bisection bandwidth, lowers the maximum link utilization, and reduces the average transmission delay.
    LIU Yi, LI Jianhua, CHEN Yu. A Multi-path Traffic Scheduling Algorithm Based on Ant Colony Optimization[J]. Electronics Optics & Control, 2020, 27(12): 6
    Download Citation