Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth forcluster computing applications.However

state of the art flow scheduling algorithms may cause unfair link utilization and saturation of core switches

resulting in overall bandwidth loss.In the paper

we regard the flow scheduling problem as a 0-

K

knapsack problem and propose a new flow scheduling algorithm named DPSOFS based on DPSO.DPSOFS formulates the position

velocity and their operation rules of particles according to Fat-Tree topology structure

and defines objective function as the difference of the number of conflict flows between two iterations.Moreover

our proposed mechanism reduces random search blindn

ess by limiting the range of the path search.The simulation suggests that it can improve overall network bisection efficiently.