發(fā)布時(shí)間：2018-02-15 12:56

  本文關(guān)鍵詞： 軟件定義網(wǎng)絡(luò) 數(shù)據(jù)中心網(wǎng)絡(luò) 分段路由 流調(diào)度 ECMP算法　出處：《電子與信息學(xué)報(bào)》2017年04期 　論文類型：期刊論文

【摘要】：針對(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)銷的同時(shí)還提高了網(wǎng)絡(luò)吞吐率。
[Abstract]:Aiming at the performance bottleneck caused by the low scalability of the current large-scale software defined data center network traffic routing mechanism, In this paper, a tree-oriented segmented routing mechanism for data center networks is proposed, which uses edge switches to detect the threshold of data streams in order to distinguish between large and small flows. At the same time, in order to meet the requirements of QoS guarantee and network extensibility of different services, this paper proposes an online first adaptive algorithm for large flow. Finally, the simulation results on the Fat-tree structure with Mininet are carried out, and the simulation results show that, Compared with the traditional ECMP and Mahout algorithms, the proposed scheme not only reduces the total controller overhead, but also improves the network throughput.
【作者單位】： 國(guó)家數(shù)字交換系統(tǒng)工程技術(shù)研究中心;
【分類號(hào)】：TP393.2

【相似文獻(xiàn)】

相關(guān)會(huì)議論文 前10條

1 姚，

本文編號(hào)：1513312