王欣欣,,
刘亦星
重庆邮电大学移动通信技术重庆市重点实验室 ??重庆 ??400065
基金项目:****和创新团队发展计划(IRT_16R72)
详细信息
作者简介:唐宏：男，1967年生，教授，研究方向为计算机网络、移动通信
王欣欣：女，1994年生，硕士生，研究方向为数据中心网络、软件定义网络
刘亦星：男，1992年生，硕士生，研究方向为数据中心网络、软件定义网络
通讯作者:王欣欣 17782358734@163.com
中图分类号:TP393计量
文章访问数:1662
HTML全文浏览量:427
PDF下载量:50
被引次数:0
出版历程
收稿日期:2018-05-16
修回日期:2018-11-16
网络出版日期:2018-12-04
刊出日期:2019-04-01
A Traffic Scheduling Algorithm for Bandwidth Fragmentation Minimization and QoS Guarantee in Data Center Network
Hong TANG,Xinxin WANG,,
Yixing LIU
Chongqing Key Laboratory of Mobile Communications Technology, Chongqing University of Post and Communications, Chongqing 400065, China
Funds:The Changjiang Scholars and Innovative Research Team Program in University (IRT_16R72)
摘要
摘要:随着数据中心网络流量的迅速增长，如何提高数据中心网络性能和服务质量成为了研究热点。然而现有的流量调度算法在网络负载加大时，一方面会导致网络带宽碎片化从而使得网络吞吐量降低，另一方面忽视了流量应用需求导致网络服务质量较差。为此，该文提出一种面向带宽碎片最小化和QoS保障的动态流量调度算法，算法综合考虑了带宽敏感的大流、时延与丢包敏感的小流的不同需求，首先根据待调度流的源地址和目的地址建立最短路径集，其次从中筛选出满足待调度流的带宽需求的所有路径，然后根据路径剩余带宽信息和小流应用需求情况为每条路径建立权重函数，最后根据权重函数值利用轮盘赌算法选择转发路径。实验仿真结果显示，与其它算法相比，所提算法降低了小流的丢包率和时延，同时在网络负载较大时提升了网络吞吐量。
关键词:数据中心网络/
流量调度/
带宽碎片/
服务质量
Abstract:With the rapid growth of Data Center Network (DCN) traffic, how to improve the performance and service quality of data center network become a research hotspot. However, when the network load increases, the existing traffic scheduling algorithm on the one hand may cause bandwidth fragmentation results in the network throughput decrease, on the other hand, it neglects the traffic application requirements to lead to poor QoS. Therefore, a dynamic traffic scheduling algorithm for bandwidth fragmentation minimization and QoS guarantee is proposed. The algorithm takes into account the different requirements of the bandwidth-sensitive large flows, and delay sensitive and packet-loss sensitive small flows. Firstly, the shortest path set is established according to the source address and destination address of the to-be-scheduled flow. Secondly, all the paths that satisfy the bandwidth requirement of the to-be-scheduled flow are selected. Then, the weight function is established for each path according to the free bandwidth of the path and the application requirements of the small flow. Finally, the forwarding path is selected based on the weight function value by roulette algorithm. The network simulation results show that when the network load increases, the proposed algorithm reduces the packet loss rate and delay of small flows, and improves the network throughput compared with other algorithms.
Key words:Data Center Network(DCN)/
Traffic scheduling/
Bandwidth fragmentation/
QoS
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=2dd8c4ab-c9d7-43b0-8019-5ef2dc8e2cff
