一種可擴(kuò)展的軟件定義數(shù)據(jù)中心網(wǎng)絡(luò)流調(diào)度策略

伊鵬; 劉洪; 胡宇翔

doi:10.11999/JEIT160623

一種可擴(kuò)展的軟件定義數(shù)據(jù)中心網(wǎng)絡(luò)流調(diào)度策略

doi: 10.11999/JEIT160623 cstr: 32379.14.JEIT160623

基金項(xiàng)目:

國(guó)家自然科學(xué)基金(61521003, 61572519, 61502530, 61672471)

計(jì)量
- 文章訪問(wèn)數(shù): 1514
- HTML全文瀏覽量: 169
- PDF下載量: 479
- 被引次數(shù): 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)

摘要

摘要: 針對(duì)目前大規(guī)模軟件定義數(shù)據(jù)中心網(wǎng)絡(luò)流量路由機(jī)制中可擴(kuò)展性低所帶來(lái)的性能瓶頸問(wèn)題，該文提出一種面向樹(shù)型結(jié)構(gòu)的數(shù)據(jù)中心網(wǎng)絡(luò)分段路由機(jī)制。該機(jī)制利用邊緣交換機(jī)對(duì)數(shù)據(jù)流進(jìn)行閾值檢測(cè)以區(qū)分大小流，同時(shí)為滿足其不同業(yè)務(wù)的QoS保證和網(wǎng)絡(luò)可擴(kuò)展性的要求，該文提出一種針對(duì)大流的在線最先適應(yīng)算法。最后，利用Mininet在Fat-tree結(jié)構(gòu)上進(jìn)行實(shí)驗(yàn)仿真驗(yàn)證，仿真結(jié)果表明，與傳統(tǒng)的ECMP算法和Mahout算法相比，該機(jī)制在降低了控制器總開(kāi)銷(xiāo)的同時(shí)還提高了網(wǎng)絡(luò)吞吐率。
- 軟件定義網(wǎng)絡(luò) /
- 數(shù)據(jù)中心網(wǎng)絡(luò) /
- 分段路由 /
- 流調(diào)度 /
- 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全文

參考文獻(xiàn)(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.

周桐慶, 蔡志平, 夏竟, 等. 基于軟件定義網(wǎng)絡(luò)的流量工程[J]. 軟件學(xué)報(bào), 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ī)制[J]. 電子信息學(xué)報(bào), 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網(wǎng)絡(luò) 的快速流調(diào)度策略[J]. 計(jì)算機(jī)學(xué)報(bào), 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.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問(wèn)統(tǒng)計(jì)