本文關(guān)鍵詞：基于SDN的物聯(lián)網(wǎng)擁塞控制研究　出處：《湖北工業(yè)大學》2017年碩士論文　論文類型：學位論文

  更多相關(guān)文章： 物聯(lián)網(wǎng) 軟件定義網(wǎng)絡(luò) 主動隊列管理 最小費用流映射

【摘要】：隨著物聯(lián)網(wǎng)(IoT)快速發(fā)展,接入網(wǎng)絡(luò)的設(shè)備持續(xù)增加,帶來業(yè)務(wù)數(shù)據(jù)流量爆發(fā)式的增漲。而傳統(tǒng)IP網(wǎng)絡(luò)采用分布式控制方法,缺乏全局網(wǎng)絡(luò)信息,不能很好滿足大量不同業(yè)務(wù)類型需求,使現(xiàn)有網(wǎng)絡(luò)擁塞控制陷入瓶頸。軟件定義網(wǎng)絡(luò)技術(shù)(Software Defined Networking,SDN)通過將數(shù)據(jù)轉(zhuǎn)發(fā)層與控制層解耦,擺脫了傳統(tǒng)擁塞控制的固有限制,實現(xiàn)更優(yōu)化、適應(yīng)性更強的擁塞控制,進而解決物聯(lián)網(wǎng)對傳輸網(wǎng)絡(luò)的需求。論文對傳統(tǒng)網(wǎng)絡(luò)中存在節(jié)點的阻塞問題和網(wǎng)絡(luò)資源分配不均衡的問題,設(shè)計了基于SDN的物聯(lián)網(wǎng)中數(shù)據(jù)轉(zhuǎn)發(fā)層和控制層擁塞控制方案。其主要工作如下:針對基于SDN的物聯(lián)網(wǎng)數(shù)據(jù)轉(zhuǎn)發(fā)節(jié)點擁塞的問題,分析了目前尾部丟棄、隨機早起檢測(RED)、公平排隊(SFQ)等主流的隊列管理算法在隊列的公平性和分組優(yōu)先級等方面的不足,設(shè)計了一種基于區(qū)分業(yè)務(wù)流的主動隊列管理算法。該算法利用馬爾可夫決策預(yù)測下一時刻的狀態(tài),并用層次分析法計算不同業(yè)務(wù)流的隊列屬性權(quán)重。然后基于切換動作和隊列狀態(tài)構(gòu)建期望回報函數(shù),采用逐次逼近的迭代得到長期期望回報最大的隊列切換選擇。最后通過仿真分析,對提出的方案進行了驗證。結(jié)果表明,該方法可有效降低數(shù)據(jù)業(yè)務(wù)流在轉(zhuǎn)發(fā)節(jié)點的阻塞率,提高網(wǎng)絡(luò)資源利用率。針對基于SDN的物聯(lián)網(wǎng)網(wǎng)絡(luò)資源分配不均衡以及資源利用率較低的問題,在控制層設(shè)計了一種基于最小費用流的虛擬映射算法來實現(xiàn)流量優(yōu)化控制。通過對SDN控制器的流量轉(zhuǎn)發(fā)的特點進行分析,建立虛擬網(wǎng)絡(luò)映射的數(shù)學模型,將最小費用流應(yīng)用于流量路徑的尋優(yōu),以實現(xiàn)對網(wǎng)絡(luò)的集中控制。根據(jù)改進單純形法和k短路法構(gòu)造一種禁忌搜索算法以解決上述規(guī)劃問題。最后給出該算法的仿真分析,結(jié)果表明,該算法相較于傳統(tǒng)的SPF(Shortest Path First)算法分布均衡性更好,資源利用率更高。
[Abstract]:With the rapid development of IoT, the number of devices connected to the network continues to increase, which leads to the explosive increase of service data flow. The traditional IP network uses distributed control method and lacks global network information. It can not meet the needs of a large number of different business types, which makes the existing network congestion control into a bottleneck. Software Defined Networking. By decoupling the data forwarding layer and the control layer, SDN gets rid of the inherent limitation of the traditional congestion control and realizes more optimized and more adaptive congestion control. Then solve the demand of the Internet of things for the transmission network. The traditional network of nodes in the problem of congestion and uneven allocation of network resources. This paper designs the congestion control scheme of data forwarding layer and control layer in Internet of things based on SDN. The main work is as follows: aiming at the congestion problem of data forwarding node in Internet of things based on SDN, this paper analyzes the current tail discard. The main queue management algorithms, such as random early detection (red), fair queuing (SFQ) and so on, are insufficient in queue fairness and packet priority. An active queue management algorithm based on differentiated traffic flow is designed, which uses Markov decision to predict the state of the next moment. The queue attribute weights of different traffic flows are calculated by AHP, and then the expected return function is constructed based on the switching action and queue state. Finally, the proposed scheme is verified by simulation analysis, and the results show that the proposed scheme is feasible. This method can effectively reduce the blocking rate of data traffic in forwarding nodes and improve the utilization of network resources. Aiming at the problem of unbalanced resource allocation and low resource utilization in the Internet of things based on SDN. In the control layer, a virtual mapping algorithm based on minimum cost flow is designed to realize optimal flow control. By analyzing the characteristics of traffic forwarding of SDN controller, the mathematical model of virtual network mapping is established. The minimum cost flow is applied to the optimization of the flow path. In order to realize the centralized control of the network, a Tabu search algorithm is constructed according to the improved simplex method and k-short circuit method to solve the above planning problem. Finally, the simulation analysis of the algorithm is given, and the results show that the algorithm can solve the problem. Compared with the traditional SPF(Shortest Path first algorithm, this algorithm has better distribution balance and higher resource utilization.
【學位授予單位】：湖北工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN929.5;TP391.44

【相似文獻】

相關(guān)期刊論文 前10條

1 吳雪霽;;把握“物聯(lián)網(wǎng)”時代的三個關(guān)鍵點[J];通信世界;2009年33期

2 秦茜;;物聯(lián)網(wǎng)驟成產(chǎn)業(yè)巨浪 各方大肆追捧恐為時尚早[J];IT時代周刊;2009年Z2期

3 石菲;;物聯(lián)網(wǎng)還有多遠[J];中國計算機用戶;2009年Z2期

4 馬繼華;韓文哲;;物聯(lián)網(wǎng)的未來會變成“空中樓閣”嗎?[J];信息網(wǎng)絡(luò);2009年10期

5 ;物聯(lián)網(wǎng)系列報道之一 理性物聯(lián)網(wǎng)[J];通信世界;2009年40期

6 李鵬;;物聯(lián)網(wǎng)發(fā)展 標準與應(yīng)用先行[J];通信世界;2009年40期

7 李鵬;趙經(jīng)緯;;北郵謝東亮 物聯(lián)網(wǎng)需兩顆紅心一種準備[J];通信世界;2009年40期

8 周雙陽;;尋找物聯(lián)網(wǎng)的制高點[J];通信世界;2009年41期

9 張鵬;;物聯(lián)網(wǎng),十年涅i，

本文編號：1425581