一种可扩展的软件定义数据中心网络流调度策略

伊鹏; 刘洪; 胡宇翔

doi:10.11999/JEIT160623

一种可扩展的软件定义数据中心网络流调度策略

doi: 10.11999/JEIT160623

基金项目:

国家自然科学基金(61521003, 61572519, 61502530, 61672471)

计量
- 文章访问数: 1384
- HTML全文浏览量: 146
- PDF下载量: 476
- 被引次数: 0
出版历程
- 收稿日期: 2016-06-12
- 修回日期: 2016-12-28
- 刊出日期: 2017-04-19

A Scalable Traffic Scheduling Policy for Software Defined Data Center Network

Funds:

The National Natural Science Foundation of China (61521003, 61572519, 61502530, 61672471)

摘要

摘要: 针对目前大规模软件定义数据中心网络流量路由机制中可扩展性低所带来的性能瓶颈问题，该文提出一种面向树型结构的数据中心网络分段路由机制。该机制利用边缘交换机对数据流进行阈值检测以区分大小流，同时为满足其不同业务的QoS保证和网络可扩展性的要求，该文提出一种针对大流的在线最先适应算法。最后，利用Mininet在Fat-tree结构上进行实验仿真验证，仿真结果表明，与传统的ECMP算法和Mahout算法相比，该机制在降低了控制器总开销的同时还提高了网络吞吐率。
- 软件定义网络 /
- 数据中心网络 /
- 分段路由 /
- 流调度 /
- ECMP算法
Abstract: According to the low scalability of current large-scale software defined data center network traffic routing mechanism which causes network performance bottleneck, this paper proposes a data center network Segment Routing (SR) mechanism based on OpenFlow. The mechanism distinguishes the size of the flow by making use of edge switches to conduct a data stream threshold test. In order to meet the QoS guarantee and network scalability requirements of different services, this paper proposes a segment routing algorithm for elephant flow.Finally, Mininet is utilized for experiment simulation on Fat-tree topology. Compared to the traditional ECMP algorithm and Mahout algorithm, simulation results show that the mechanism reduces the overhead of controller, and has better network throughout.
- Software Defined Network (SDN) /
- Data Center Networks (DCN) /
- Segment Routing (SR) /
- Traffic scheduling /
- ECMP algorithm

HTML全文

参考文献(19)

AL-FARES M, LOUKISSAS A, and VAHDAT A. A scalable, commodity data center network architecture[C]. Proceedings of the ACM Special Interest Group on Data Communication, New York, 2008: 63-74.

GUO C, LU G, LI D, et al. BCube: A high performance, server-centric network architecture for modular data centers[C]. Proceedings of the ACM Special Interest Group on Data Communication, Barcelona, Spain, 2009: 63-74.

MYSORE R N, PAMBORIS A, FARRINGTON N, et al. PortLand: A scalable fault-tolerant layer 2 data center network fabric[C]. Proceedings of the ACM Special Interest Group on Data Communication, New York, 2009: 39-50.

MCKEOWN N, ANDERSON T, BALAKRISHNAN H, et al. OpenFlow: Enabling innovation in campus networks[J]. SIGCOMM Computer Communication Review, 2008, 38(2): 69-74.

周桐庆, 蔡志平, 夏竟, 等. 基于软件定义网络的流量工程[J]. 软件学报, 2016, 27(2): 394-417. doi: 10.13328/j.cnki.jos. 004935.

ZHOU Tongqing, CAI Zhiping, XIA Jing, et al. Traffic engineering for software defined networks[J]. Journal of Software, 2016, 27(2): 394-417. doi: 10.13328/j.cnki.jos. 004935.

陈鸣, 胡慧, 刘波, 等. 一种基于OpenFlow的多路径传输机制[J]. 电子信息学报, 2016, 38(5): 1242-1248. doi: 10.11999/ JEIT150928.

CHEN Ming, HU Hui, LIU Bo, et al. An OpenFlow based multipath transmission mechanism[J]. Journal of Electronics Information Technology, 2016, 38(5): 1242-1248. doi: 10.11999/JEIT150928.

AL-FARES M，RADHAKRISHNAN S, RAGHAVAN B, et al. Hedera: Dynamic flow scheduling for data center networks[C]. Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, San Jose, USA, 2010: 281-296.

CURTIS A R, KIM W, and YALAGANDULA P. Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection[C]. IEEE International Conference on Computer Communications, Shanghai, China, 2011: 1629-1637. doi: 10.1109/INFOCOM.2011.5934956.

李龙, 付斌章, 陈明宇, 等. Nimble: 一种适用于OpenFlow网络的快速流调度策略[J]. 计算机学报, 2015, 38(5): 1056-1068. doi: 10.3724/SP.J.1016.2015.0156.

LI Long, FU Binzhang, CHEN Mingyu, et al. Nimble: A fast flow scheduling strategy for OpenFlow networks[J]. Journal of Computers, 2015, 38(5): 1056-1068. doi: 10.3724/SP. J.1016.2015.0156.

BHATIA R, HAO F, KODIALAM M, et al. Optimized network traffic engineering using segment routing[C]. IEEE International Conference on Computer Communications, Hong Kong, China, 2015: 657-665. doi: 10.1109/INFOCOM. 2015.7218434.

DAVOLI L, VELTRI L, VENTRE P, et al. Traffic engineering with segment routing: SDN-based architecture design and open source implementation[C]. Proceedings of the 2015 Fourth European Workshop on Software Defined Networks, Bilbao, Spain, 2015: 111-112. doi: 10.1109/ EWSDN.2015.73.

KANDULA S, SENGUPTA S, GREENBERG A, et al. The nature of data center traffic: measurements and analysis[C]. Proceedings of the 2010 ACM Internet Measurement Conference, Chicago, Illinois, USA, 2009: 202-208.

BENSON T, ANAND A, AKELLA A, et al. Understanding data center traffic characteristics[C]. Proceedings of the ACM Special Interest Group on Data Communication, New York, ACM, 2010: 92-99.

BENSON T, AKELLA A, and MALTZ D A. Network traffic characteristics of data centers in the wild[C]. Proceedings of the 2010 ACM Internet Measurement Conference, Melbourne, Australia, 2010: 267-280.

CURTIS A R, MOGUL J C, TOURRILHES J, et al. Scaling flow management for high-performance networks[C]. Proceedings of the ACM Special Interest Group on Data Communication, Toronto, Ontario, Canada, 2011: 254-265.

CHEN Kai, GUO Chuanxiong, WU Haitao, et al. DAC: Generic and automatic address configuration for data center networks[J]. IEEE Transactions on Networking, 2012, 20(1): 84-99. doi: 10.110./TNET.2011.2157520.

施引文献

资源附件(0)

访问统计