文献类型：期刊文献

中文题名：基于离散粒子群算法的数据中心网络流量调度研究

英文题名：Data Center Network Flow Scheduling Based on DPSO Algorithm

作者：林智华[1,2];高文[2];吴春明[2];李勇燕[3]

机构：[1]福建江夏学院电子信息科学学院;[2]浙江大学计算机学院;[3]绍兴文理学院上虞分院

年份：2016

卷号：44

期号：9

起止页码：2197

中文期刊名：电子学报

外文期刊名：Acta Electronica Sinica

收录：CSTPCD、、北大核心2014、EI(收录号：20164202917885)、CSCD2015_2016、Scopus(收录号：2-s2.0-84991244523)、北大核心、CSCD

基金：The financial support from Universiti Sains Malaysia, RUI Grant No. 1001/PBAHAN/814200 is gratefully acknowledged.

语种：中文

中文关键词：Fat-Tree;数据中心网络;离散粒子群;流调度

外文关键词：Fat-Tree; data center network; DPSO; flowscheduling

中文摘要：数据中心网络利用多个并行路径为集群计算等网络服务提供高对分带宽.然而,现有的流量调度算法可能会引起链路负载不均衡,核心交换机冲突加剧,造成网络总体性能降低.本文将流调度问题转化成0-K背包问题求解,提出基于离散粒子群的流调度算法DPSOFS(Discrete Particle Swarm Optimization Flow Scheduling).该算法根据Fat-Tree结构特点定义了粒子速度、位置和运算规则,以两次迭代冲突流个数差值作为目标函数,并限定路径搜索范围,减少随机搜索的盲目性.仿真实验验证了该算法对减少流冲突快速有效,能提高网络对分带宽.

外文摘要：Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth forcluster computing applications. However,state of the art flowscheduling algorithms may cause unfair link utilization and saturation of core switches,resulting in overall bandwidth loss. In the paper,we regard the flowscheduling problem as a 0-K knapsack problem and propose a newflowscheduling 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 blindness by limiting the range of the path search. The simulation suggests that it can improve overall network bisection efficiently.