發(fā)布時間：2018-06-21 14:04

  本文選題：軟件定義網(wǎng)絡 + 規(guī)則管理��； 參考：《北京郵電大學》2017年博士論文

【摘要】：傳統(tǒng)網(wǎng)絡僵化的體系結(jié)構(gòu)為網(wǎng)絡管理和創(chuàng)新研究帶來了很大挑戰(zhàn)。因此,學術界和產(chǎn)業(yè)界提出了許多網(wǎng)絡革新方案。美國國防部高級研究計劃局1990年提出了主動網(wǎng)絡。它的基本思想是分組在傳輸過程中攜帶自定義代碼,網(wǎng)絡設備通過執(zhí)行這些代碼對分組進行靈活處理。與此同時,OpenSig組織建議在網(wǎng)絡設備上開放編程接口,允許服務提供商利用中間件(如COBAR)對網(wǎng)絡進行控制。ForCES,PCEP和RCP提出了針對路由協(xié)議控制平面與數(shù)據(jù)平面分離的方案。4D架構(gòu),SANE和Ethane提出了控制平面與數(shù)據(jù)平面完全分離,并且控制平面邏輯中心化的方案。通過對上述網(wǎng)絡可編程,控制平面和數(shù)據(jù)平面分離方案的借鑒,軟件定義網(wǎng)絡(Software-Defined Networking,SDN)成為人們將白盒設計思想引入網(wǎng)絡的重要成果,引起了學術界和產(chǎn)業(yè)界的廣泛關注。在SDN中,網(wǎng)絡交換機的功能非常簡單,僅負責數(shù)據(jù)轉(zhuǎn)發(fā)。所有交換機的控制功能被邏輯集中于控制器中,極大地方便了網(wǎng)絡管理。網(wǎng)絡管理員不需要再根據(jù)網(wǎng)絡狀態(tài)變化,頻繁地對網(wǎng)絡設備進行逐個設置,僅需要在控制器上配置能夠動態(tài)響應的高層策略。SDN對網(wǎng)路創(chuàng)新也有著巨大的推動作用。通過在控制器上進行編程,研究人員可以快速地部署新的網(wǎng)絡功能。OpenFlow綜合考慮了 SDN的網(wǎng)絡完全可編程的目標與實際部署的復雜性,使SDN由理論變?yōu)楝F(xiàn)實。OpenFlow協(xié)議已成為當前SDN中控制器與交換機之間實際的通信標準,為網(wǎng)絡管理和科研人員提供了許多新的視角。但是,OpenFlow也帶來了許多新的問題,比如,如何設計網(wǎng)絡編程語言,如何確定數(shù)據(jù)流的控制粒度,如何進行數(shù)據(jù)流測量,如何進行網(wǎng)絡虛擬化,如何將SDN網(wǎng)絡與傳統(tǒng)網(wǎng)絡進行結(jié)合。如何對規(guī)則進行管理是解決上述所有問題的關鍵環(huán)節(jié)。例如,如何進行數(shù)據(jù)流測量其實就是在網(wǎng)絡資源約束條件下合理地部署測量規(guī)則。本文首先對軟件定義網(wǎng)絡中規(guī)則管理問題的研究背景和挑戰(zhàn)進行歸納總結(jié),然后圍繞如何在流表資源有限的條件下如何進行規(guī)則放置問題進行了深入研究,具體內(nèi)容如下:1).對軟硬件SDN交換機構(gòu)成的組合SDN轉(zhuǎn)發(fā)節(jié)點的時延上限進行了理論分析。組合SDN轉(zhuǎn)發(fā)節(jié)點是解決硬件SDN交換機流表空間不足的重要方法之一。在組合轉(zhuǎn)發(fā)節(jié)點中,軟件交換機和硬件交換機的各自的特點和它們之間的協(xié)作流程決定了在硬件交換機中命中規(guī)則的數(shù)據(jù)流的時延必然比其余數(shù)據(jù)流的時延低。為了能夠?qū)?jīng)過組合轉(zhuǎn)發(fā)節(jié)點的時延上限進行定量分析,作者首先提出了組合SDN轉(zhuǎn)發(fā)節(jié)點的理論模型,然后根據(jù)進入組合SDN轉(zhuǎn)發(fā)節(jié)點所有數(shù)據(jù)流的累積到達過程,利用網(wǎng)絡演算的相關定理,如輸出定理,剩余服務定理,時延上限定理等,分析了經(jīng)過組發(fā)轉(zhuǎn)發(fā)節(jié)點的數(shù)據(jù)流在最差情況下的分組時延。在NS-3環(huán)境下進行仿真實驗,結(jié)果表明作者根據(jù)根據(jù)網(wǎng)絡演算得到的時延上限的理論值與仿真值極為接近,并且揭示了組合轉(zhuǎn)發(fā)節(jié)點中軟件交換機數(shù)量與規(guī)則放置方案對各通道時延上限的影響規(guī)律。2).提出了適用于組合SDN轉(zhuǎn)發(fā)節(jié)點的基于遺傳的規(guī)則放置算法。在組合SDN轉(zhuǎn)發(fā)節(jié)點中,由于硬件交換機中流表空間有限,所以只有部分數(shù)據(jù)流可以經(jīng)由快速通道進行轉(zhuǎn)發(fā),并且由成果1可知任意數(shù)據(jù)流的通道選擇都會影響所有數(shù)據(jù)流的時延上限。為了保障數(shù)據(jù)流在組合SDN轉(zhuǎn)發(fā)節(jié)點的時延需求,作者首先定義了時延滿意度,用于衡量規(guī)則放置方法達到的時延保障水平,其次對組合SDN轉(zhuǎn)發(fā)節(jié)點中的規(guī)則放置問題進行形式化描述,并證明該問題是NP難問題,然后基于遺傳的規(guī)則放置算法對該問題進行求解,實驗表明與另外三種算法相比,所提算法能夠獲得更高的時延滿意度。3).提出了基于時空聯(lián)合的規(guī)則放置算法。除采用類組合SDN轉(zhuǎn)發(fā)節(jié)點的方法增大交換機流表空間外,提高流表的利用效率也是克服流表空間不足的重要手段。OpenFlow的超時機制和通配符匹配機制可以分別從時間和空間上調(diào)整規(guī)則對流表的占用,為解決交換機的流表資源有限問題提供了有效的解決途徑。利用超時機制或者通配符匹配機制,研究人員提出了許多能夠有效提高規(guī)則命中率的規(guī)則放置算法。但是,這些已有的規(guī)則放置算法都僅采用一種機制進行性能優(yōu)化,不能充分提高規(guī)則命中率,并且在應用范圍方面都存在一定的局限性。為此,作者首先對聯(lián)合采用超時機制和通配符匹配機制的規(guī)則放置問題進行形式化描述,然后針對該問題提出了基于時空聯(lián)合的規(guī)則放置算法,綜合考慮規(guī)則在流表中的逗留時間和規(guī)則的匹配空間,確定規(guī)則的放置方案。實驗結(jié)果表明,所提算法產(chǎn)生的規(guī)則放置方案能夠有效提高規(guī)則命中率,降低分組拒絕率。4).提出了一個基于SDN的網(wǎng)絡虛擬化架構(gòu)。網(wǎng)絡虛擬化可以為每個網(wǎng)絡租賃者靈活地提供獨立的網(wǎng)絡拓撲和自主的網(wǎng)絡管理權限。軟件定義網(wǎng)絡,尤其是OpenFlow,提供了開放的底層物理網(wǎng)絡抽象接口,提高了網(wǎng)絡的可編程性�；赟DN的網(wǎng)絡虛擬化架構(gòu)能夠結(jié)合二者的優(yōu)勢,進一步加快網(wǎng)絡發(fā)展。盡管在SDN環(huán)境下進行網(wǎng)絡虛擬化已經(jīng)取得了許多成果,但是如何設計基于SDN的網(wǎng)絡虛擬化架構(gòu)仍然是一個開放性問題。作者首先對基于SDN的網(wǎng)絡虛擬化架構(gòu)的需求進行分析,其次提出了一個基于SDN的網(wǎng)絡虛擬化架構(gòu),SDNVA。在SDNVA中,通過對OpenDayLight控制器進行擴展,實現(xiàn)了網(wǎng)絡虛擬化組件;結(jié)合OpenFlow交換機對多級流表的支持,提出了虛擬管線機制,并擴展至組合SDN轉(zhuǎn)發(fā)節(jié)點中;提出了分別針對物理網(wǎng)絡和虛擬網(wǎng)絡的自治管理機制。最后在SDNVA的原型系統(tǒng)中驗證了虛擬化組件對資源的隔離,以及虛擬網(wǎng)絡對物理網(wǎng)絡變化的感知。
[Abstract]:The traditional network rigid architecture has brought great challenges to network management and innovation research. Therefore, a number of network innovations have been proposed by the academia and industry. The United States Department of Defense advanced research project proposed an active network in 1990. Its basic idea is to carry the custom code in the transmission process, and the network equipment is passed. At the same time, the OpenSig organization proposes to open programming interfaces on network devices and allow service providers to use middleware (such as COBAR) to control the network.ForCES, PCEP and RCP propose a.4D architecture for routing protocol control plane and data plane separation scheme, SANE and Ethane proposed. Software-Defined Networking (SDN) has become an important achievement for people to introduce white box planning ideas into the network. In SDN, the function of the network switch is very simple, only responsible for data forwarding. The control functions of all switches are logically centralized in the controller, and the network management is a great place. Network administrators do not need to set up the network equipment one by one according to the change of network state, only need to be controlled. .SDN, a high-level strategy with dynamic response on the device, has a great impetus for network innovation. By programming on the controller, researchers can quickly deploy new network functions,.OpenFlow, and take into account the complexity of the SDN network fully programmable and the actual department, so that the SDN is transformed from the theory to the reality.Op EnFlow protocol has become the actual communication standard between controllers and switches in current SDN and provides a lot of new perspectives for network management and researchers. However, OpenFlow has also brought many new problems, such as how to design network programming language, how to determine the control granularity of data flow, how to measure data flow, and how to get into the data flow Network virtualization, how to combine the SDN network with the traditional network. How to manage the rules is the key link to solve all the problems mentioned above. For example, how to conduct data flow measurement is actually a reasonable deployment of measurement rules under the constraints of network resources. The background and challenge are summarized, and then how to carry on the problem of rule placement under the limited resources of the flow meter is deeply studied. The specific contents are as follows: 1) the time delay upper limit of the combined SDN forwarding node composed of the hardware and software SDN switches is theoretically analyzed. The combination of SDN forwarding nodes is the solution to the hardware SDN switching. One of the most important methods of insufficient flow table space. In a combined forwarding node, the respective characteristics of the software switch and the hardware switch and the cooperation flow between them determine that the time delay of the data flow of the hit rule in the hardware switch is necessarily lower than that of the rest of the data stream. The upper limit is quantified. The author first proposes a theoretical model of the combined SDN forwarding node. Then, according to the cumulative arrival process of all data streams in the SDN forwarding node, the correlation theorems of the network calculus, such as the output theorem, the residual service theorem and the delay on the delay, are used to analyze the data flow through the forwarding nodes. In the worst case, the packet delay is simulated in the NS-3 environment. The results show that the theoretical value of the time delay upper limit obtained according to the network calculus is very close to the simulation value, and the effect of the number of software switches and the rule placement scheme on the upper limit of the delay of each channel in the combined forwarding node is revealed. A suitable method is proposed. A genetic based rule placement algorithm for combining SDN forwarding nodes. In a combined SDN forwarding node, because the flow table space in a hardware switch is limited, only a portion of the data stream can be forwarded via a fast channel, and the channel selection of any data stream can affect the upper limit of the delay of all data streams by results 1. In order to guarantee the delay requirement of the data flow in the combined SDN forwarding node, the author first defines the time delay satisfaction, which is used to measure the level of time delay guaranteed by the rule placement method. Secondly, the formal description of the rule placement problem in the combined SDN forwarding node is described, and it is proved that the problem is a NP difficult problem and then is placed based on the genetic rules. The method is used to solve this problem. The experiment shows that compared with the other three algorithms, the proposed algorithm can obtain higher delay satisfaction.3. A rule placement algorithm based on spatio-temporal joint is proposed. Besides the use of class combination SDN forwarding nodes to increase the flow table space of the switch, the utilization efficiency of the high flow table is also overcome the shortage of the flow table space. The important means of.OpenFlow's timeout mechanism and wildcard matching mechanism can adjust the occupancy of regular convective table respectively from time and space. It provides an effective solution to solve the problem of the limited flow table resource. By using the timeout mechanism or the matching mechanism of wildcards, the researchers have proposed many effective measures to improve the rules. However, these existing rule placement algorithms use only one mechanism to optimize the performance, which can not fully improve the rule hit rate, and there are some limitations in the scope of application. For this reason, the author first puts the problem of rules placement on the combination of timeout mechanism and wildcard matching mechanism. By formal description, a rule placement algorithm based on time and space is proposed, which considers the time of stay and the matching space of rules in the flow table, and the placement scheme of rules is determined. The experimental results show that the rule placement scheme produced by the proposed algorithm can effectively improve the rule hit rate and reduce the rejection of the packet. .4). A network virtualization architecture based on SDN is proposed. Network virtualization provides an independent network topology and independent network management authority for each network leaseholder. Software definition network, especially OpenFlow, provides an open underlying physical network pumping interface, which improves the network programmability. SDN The network virtualization architecture can combine the advantages of the two to further accelerate the development of the network. Although many achievements have been made in the network virtualization in the SDN environment, how to design the network virtualization architecture based on SDN is still an open question. The author first divides the requirements of the network virtualization architecture based on SDN. Secondly, a network virtualization architecture based on SDN is proposed. In SDNVA, the network virtualization component is realized by extending the OpenDayLight controller in SDNVA. The virtual pipeline mechanism is proposed and extended to the combined SDN forwarding node with the support of the OpenFlow switch to the multilevel flow table, and it is proposed for the physical network respectively. And the autonomous management mechanism of virtual network. Finally, in the prototype system of SDNVA, the isolation of the virtualized components to the resources and the perception of the physical network changes by the virtual network are verified.
【學位授予單位】：北京郵電大學
【學位級別】：博士
【學位授予年份】：2017
【分類號】：TP393.0

【相似文獻】

相關期刊論文 前10條

1 陸惠玲;周濤;;基于自依賴規(guī)則分析的主動規(guī)則終止性研究[J];計算機工程與科學;2013年08期

2 周志逵,羅紅;主動規(guī)則可終止性分析的規(guī)則縮減算法[J];北京理工大學學報;2001年04期

3 陳戰(zhàn)勝,王瑞祥;主動數(shù)據(jù)庫的規(guī)則終止性分析[J];齊齊哈爾大學學報;2004年03期

4 孫明,姜躍平,董繼潤;支持復合事件的主動規(guī)則的可終止性分析[J];計算機研究與發(fā)展;1998年05期

5 陳戰(zhàn)勝;滕永富;;一種改進的規(guī)則終止性分析方法的研究[J];齊齊哈爾大學學報;2007年04期

6 唐常杰;張悅;唐良;李川;陳瑜;;亞復雜系統(tǒng)中動力學干預規(guī)則挖掘技術研究進展[J];計算機應用;2008年11期

7 楊波,王海洋,董繼潤;主動規(guī)則可終止性的動態(tài)分析方法[J];計算機研究與發(fā)展;2000年08期

8 楊澤雪;周屹;胡心怡;趙慶雙;;帶有規(guī)則優(yōu)先級的主動規(guī)則終止性分析[J];黑龍江工程學院學報(自然科學版);2010年01期

9 楊澤雪;郝忠孝;;基于事務的規(guī)則終止性分析[J];哈爾濱理工大學學報;2005年06期

10 楊澤雪;;主動規(guī)則的終止性分析[J];黑龍江工程學院學報;2008年02期

相關會議論文 前3條

1 楊波;王海洋;董繼潤;;基于復合事件規(guī)則的主動數(shù)據(jù)庫動態(tài)分析模型[A];第十六屆全國數(shù)據(jù)庫學術會議論文集[C];1999年

2 陳文亮;朱靖波;呂學強;姚天順;;詞性標注規(guī)則的獲取和優(yōu)化[A];第一屆學生計算語言學研討會論文集[C];2002年

3 左維松;昝紅英;張坤麗;吳云芳;;規(guī)則和統(tǒng)計相結(jié)合的情感分析研究[A];第五屆全國信息檢索學術會議論文集[C];2009年

相關重要報紙文章 前10條

1 本報記者 張景波;“政府入世”：一切皆需按規(guī)則[N];吉林日報;2001年

2 何寶宏;軟件定義的世界[N];人民郵電;2012年

3 本報記者 郭平;網(wǎng)絡向軟件定義融合演進[N];計算機世界;2012年

4 鄧光青;軟件定義網(wǎng)絡風頭正勁[N];中國質(zhì)量報;2013年

5 本報記者 郭濤;軟件定義存儲：市場“二八”開[N];中國計算機報;2013年

6 本報記者 郭濤 策劃;軟件定義未來[N];中國計算機報;2013年

7 本報記者 李旭陽;軟件定義汽車[N];計算機世界;2013年

8 梁敏;軟件定義時代來臨[N];電腦報;2013年

9 本報記者 劉春輝;全面的虛擬化是實現(xiàn)“軟件定義”的重要基石[N];人民郵電;2013年

10 本報記者 郭濤;軟件定義存儲也要“打假”[N];中國計算機報;2014年

相關博士學位論文 前10條

1 齊慶磊;軟件定義網(wǎng)絡中規(guī)則管理關鍵技術研究[D];北京郵電大學;2017年

2 楊永福;“規(guī)則”的分析與建構(gòu)：制度的社會網(wǎng)絡基礎[D];武漢理工大學;2003年

3 郭凱;最優(yōu)利率規(guī)則：一般理論與應用[D];東北財經(jīng)大學;2007年

4 熊偉;基于空間ECA模型的空間數(shù)據(jù)庫主動規(guī)則技術研究[D];國防科學技術大學;2005年

5 李索恒;軟件定義網(wǎng)絡中多媒體傳輸路由及緩存算法研究[D];中國科學技術大學;2016年

6 肖鵬;數(shù)據(jù)中心下軟件定義網(wǎng)絡的部署及應用[D];大連海事大學;2016年

7 唐思圓;軟件定義網(wǎng)絡中資源高效的多播傳輸研究[D];中國科學技術大學;2017年

8 王軍鋒;軟件定義物聯(lián)網(wǎng)路由研究[D];華中科技大學;2016年

9 楊恩眾;軟件定義多媒體組播系統(tǒng)與傳輸策略研究[D];中國科學技術大學;2017年

10 朱明;高效軟件定義車載網(wǎng)絡關鍵技術研究[D];國防科學技術大學;2016年

相關碩士學位論文 前10條

1 王婷;基于雙聚類的多周期投資交易規(guī)則挖掘[D];華南理工大學;2015年

2 伍龍真;貴州現(xiàn)代高效農(nóng)業(yè)示范園區(qū)建設中市場規(guī)則的完善研究[D];貴州大學;2015年

3 許學軍;面向SAP人力資源系統(tǒng)的商業(yè)規(guī)則定制平臺的設計與實現(xiàn)[D];南京大學;2016年

4 李舒晗;基于MISRA的C程序規(guī)則分析驗證平臺的實現(xiàn)[D];天津大學;2014年

5 張楊;云環(huán)境下的關聯(lián)規(guī)則增量更新算法及其應用[D];北京化工大學;2016年

6 張超;民航旅客服務信息系統(tǒng)告警關聯(lián)規(guī)則挖掘[D];中國民航大學;2015年

7 程媛媛;Hadoop下基于數(shù)量關聯(lián)規(guī)則的數(shù)據(jù)挖掘研究[D];重慶交通大學;2016年

8 趙月;關聯(lián)規(guī)則挖掘方法的研究與應用[D];遼寧師范大學;2016年

9 沈冰雪;TPP國有企業(yè)規(guī)則對我國的影響及法律對策研究[D];大連海事大學;2017年

10 李琦;NBA規(guī)則和CBA規(guī)則的對比研究[D];北京體育大學;2017年

，

本文編號：2048938