Data Center Network Flow Scheduling Based on DPSO Algorithm

LIN Zhi-hua; GAO Wen; WU Chun-ming; LI Yong-yan

doi:10.3969/j.issn.0372-2112.2016.09.026

您当前的位置：

首页 >

文章列表页 >

Data Center Network Flow Scheduling Based on DPSO Algorithm

更新时间：2025-07-16

- Data Center Network Flow Scheduling Based on DPSO Algorithm
- Acta Electronica Sinica Vol. 44, Issue 9, Pages: 2197-2202(2016)
- 作者机构：
  
  1. 福建江夏学院电子信息科学学院,福建,福州,350108
  2. 浙江大学计算机学院,浙江,杭州,310027
  3. 绍兴文理学院上虞分院, 浙江上虞,312300
  4. 福建江夏学院电子信息科学学院,福建,福州,350108
  5. 浙江大学计算机学院,浙江,杭州,310027
  6. 绍兴文理学院上虞分院浙江上虞,312300
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2016.09.026
  CLC： TP393
- Published Online：25 September 2016，
  
  Published：2016
- 稿件说明：
移动端阅览
LIN Zhi-hua, GAO Wen, WU Chun-ming, et al. Data Center Network Flow Scheduling Based on DPSO Algorithm[J]. Acta Electronica Sinica, 2016, 44(9): 2197-2202.
DOI：

LIN Zhi-hua, GAO Wen, WU Chun-ming, et al. Data Center Network Flow Scheduling Based on DPSO Algorithm[J]. Acta Electronica Sinica, 2016, 44(9): 2197-2202. DOI： 10.3969/j.issn.0372-2112.2016.09.026.

摘要

数据中心网络利用多个并行路径为集群计算等网络服务提供高对分带宽.然而，现有的流量调度算法可能会引起链路负载不均衡，核心交换机冲突加剧，造成网络总体性能降低.本文将流调度问题转化成0-

背包问题求解，提出基于离散粒子群的流调度算法DPSOFS（Discrete Particle Swarm Optimization Flow Scheduling）.该算法根据Fat-Tree结构特点定义了粒子速度、位置和运算规则，以两次迭代冲突流个数差值作为目标函数，并限定路径搜索范围，减少随机搜索的盲目性.仿真实验验证了该算法对减少流冲突快速有效，能提高网络对分带宽.

Abstract

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-

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.

关键词

Keywords

references

Views

599

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Deep Reinforcement Learning Based Coflow Scheduling in Data Center Networks

A Hierarchical Fault Diagnosis Algorithm for Data Center Networks

Research on Energy-Saving Routing Devices and Protocols in the Internet

Slack Time and Accumulation-Based Mix-flow Scheduling in Data Center Networks

Related Author

MA Teng

HU Yu-xiang

ZHANG Xiao-hui

XUAN Heng-nong

ZHANG Run-chi

ZUO Miao

LIU Tian-tian

SHANG Yun-fei

Related Institution

国家数字交换系统工程技术研究中心

School of Information Engineering, Nanjing University of Finance and Economics

National Computer Network Emergency Response Technical Team/Coordination Center of China

School of Information Engineering Nanjing University of Finance and Economics Nanjing Jiangsu China

National Computer Network Emergency Response Technical Team/Coordination Center of China Hefei Anhui China

⁰