本文選題：SDN　切入點(diǎn)：OpenDaylight　出處：《北京郵電大學(xué)》2017年碩士論文

【摘要】：近年來(lái),軟件定義網(wǎng)絡(luò)(Soft Defined Network,SDN)的誕生無(wú)疑推動(dòng)了傳統(tǒng)分布式網(wǎng)絡(luò)向集中式網(wǎng)絡(luò)的過(guò)渡,而OpenDaylight是目前最為流行的開(kāi)源SDN控制器,其開(kāi)放的應(yīng)用編程接口,以及控制與轉(zhuǎn)發(fā)分離的思想被業(yè)內(nèi)所接受。但是OpenDaylight僅僅實(shí)現(xiàn)了網(wǎng)絡(luò)轉(zhuǎn)發(fā)的基礎(chǔ)功能,并沒(méi)有針對(duì)各種各樣的業(yè)務(wù)以及應(yīng)用做相應(yīng)的拓展,所以其并不能良好的滿足當(dāng)前網(wǎng)絡(luò)多樣化的業(yè)務(wù)需求,無(wú)法靈活的選擇路由策略,這與SDN開(kāi)放北向接口,面向業(yè)務(wù)的原則相違背,嚴(yán)重制約了軟件定義網(wǎng)絡(luò)的發(fā)展,而這正是木文所要解決的主要問(wèn)題。本文基于 OpenDaylight平臺(tái),利用控制平面的可編程性質(zhì),研究并實(shí)現(xiàn)了基于業(yè)務(wù)需求的路由引擎,該引擎可以根據(jù)不同的業(yè)務(wù)需求收集底層網(wǎng)絡(luò)的統(tǒng)計(jì)信息,從而作出最佳的路由決策。本文做的主要工作有:(1)通過(guò)分析OpenDaylight中web界面的開(kāi)發(fā)步驟以及Yang模型的定義方法設(shè)計(jì)并實(shí)現(xiàn)了業(yè)務(wù)描述模塊來(lái)描述具體的業(yè)務(wù)需求,獲取描述參數(shù)作為路徑計(jì)算的依據(jù);(2)通過(guò)分析OpenDaylight中網(wǎng)絡(luò)拓?fù)涞墨@取流程,監(jiān)聽(tīng)底層網(wǎng)絡(luò)節(jié)點(diǎn)的變化通知獲取網(wǎng)絡(luò)的全局拓?fù)?同時(shí)自定義Graph數(shù)據(jù)結(jié)構(gòu)存儲(chǔ)拓?fù)鋽?shù)據(jù);(3)根據(jù)具體的業(yè)務(wù)需求利用控制器向底層交換機(jī)下發(fā)封裝了時(shí)間戳的 LLDP報(bào)文、Echo request消息以及OFPT_STATS_REQUEST消息,獲取網(wǎng)絡(luò)的帶寬和時(shí)延信息,并將這些信息記錄到Graph數(shù)據(jù)結(jié)構(gòu)中;(4)設(shè)計(jì)并實(shí)現(xiàn)了路徑計(jì)算模塊,利用Dijkstra算法以及Yen算法分別計(jì)算基于跳數(shù)、時(shí)延和帶寬的轉(zhuǎn)發(fā)路徑,并將結(jié)果寫(xiě)回到DataStore; (5)對(duì)本文設(shè)計(jì)的路由引擎進(jìn)行功能性測(cè)試,確定其滿足設(shè)計(jì)要求。本文在OpenDaylight基礎(chǔ)上設(shè)計(jì)并實(shí)現(xiàn)了基于業(yè)務(wù)需求的路由引擎,經(jīng)過(guò)測(cè)試,該引擎達(dá)到了預(yù)期效果,能夠根據(jù)不同的業(yè)務(wù)需求觸發(fā)不同的路徑計(jì)算過(guò)程,從而得到最佳的路由決策。
[Abstract]:In recent years, the birth of soft Defined Network (SDN) has undoubtedly promoted the transition from traditional distributed network to centralized network. OpenDaylight is the most popular open source SDN controller, and its open application programming interface. The idea of separation of control and forwarding has been accepted by the industry. However, OpenDaylight has only realized the basic function of network forwarding, and has not made corresponding expansion for various services and applications. Therefore, it can not meet the needs of the current diversified network services, and can not flexibly choose the routing strategy, which is contrary to the SDN open northward interface and service oriented principle, which seriously restricts the development of the software defined network. Based on the OpenDaylight platform and the programmable nature of the control plane, this paper studies and implements the routing engine based on the business requirements. The engine can collect the underlying network statistics according to different business requirements, The main work of this paper is to analyze the development steps of web interface in OpenDaylight and the definition method of Yang model to design and implement the business description module to describe the specific business requirements. Obtaining description parameters as the basis of path calculation) the global topology of the network is obtained by analyzing the process of obtaining the network topology in OpenDaylight, monitoring the change notification of the underlying network node, and obtaining the global topology of the network by monitoring the change notification of the underlying network node. At the same time, the custom Graph data structure is used to store topology data. According to the specific service requirements, the controller sends the time-stamped LLDP message and OFPT_STATS_REQUEST message to the bottom switch to obtain the bandwidth and delay information of the network. The path calculation module is designed and implemented by recording these information into the Graph data structure. The forwarding paths based on hops, delay and bandwidth are calculated by using Dijkstra algorithm and Yen algorithm, respectively. The results are written back to data Store; 5) the routing engine designed in this paper is tested to satisfy the design requirements. This paper designs and implements a routing engine based on business requirements on the basis of OpenDaylight. The engine achieves the desired effect and can trigger different path calculation processes according to different business requirements, thus obtaining the best routing decision.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP393.0

【參考文獻(xiàn)】

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

1 唐菀;劉果;楊喜敏;陳凡;;數(shù)據(jù)中心間網(wǎng)絡(luò)中保證帶寬的基于OpenFlow路徑規(guī)劃（英文）[J];中南民族大學(xué)學(xué)報(bào)(自然科學(xué)版);2016年02期

2 許名廣;劉亞萍;鄧文平;;網(wǎng)絡(luò)控制器OpenDaylight的研究與分析[J];計(jì)算機(jī)科學(xué);2015年S1期

3 程瑩;張?jiān)朴?;SDN應(yīng)用及北向接口技術(shù)研究[J];信息通信技術(shù);2014年01期

4 袁廣翔;;軟件定義網(wǎng)絡(luò)技術(shù)發(fā)展與應(yīng)用研究[J];現(xiàn)代電信科技;2013年04期

5 張順淼;鄒復(fù)民;;軟件定義網(wǎng)絡(luò)研究綜述[J];計(jì)算機(jī)應(yīng)用研究;2013年08期

6 王文東;胡延楠;;軟件定義網(wǎng)絡(luò):正在進(jìn)行的網(wǎng)絡(luò)變革[J];中興通訊技術(shù);2013年01期

7 趙慧玲;馮明;史凡;;SDN——未來(lái)網(wǎng)絡(luò)演進(jìn)的重要趨勢(shì)[J];電信科學(xué);2012年11期

8 裴育杰;王洪波;程時(shí)端;;一種保證時(shí)延的關(guān)鍵流路由調(diào)整算法[J];軟件學(xué)報(bào);2010年03期

9 郝自軍;何尚錄;;最短路問(wèn)題的Floyd算法的若干討論[J];重慶工學(xué)院學(xué)報(bào)(自然科學(xué)版);2008年05期

10 李元臣,劉維群;基于Dijkstra算法的網(wǎng)絡(luò)最短路徑分析[J];微計(jì)算機(jī)應(yīng)用;2004年03期

相關(guān)碩士學(xué)位論文 前1條

1 王楠;Openflow網(wǎng)絡(luò)中路由機(jī)制的研究與實(shí)現(xiàn)[D];北京郵電大學(xué);2012年

，

本文編號(hào)：1666633