【摘要】：軟件定義網(wǎng)絡(luò)(SDN,Software-definned Networking)是一種新型的網(wǎng)絡(luò)架構(gòu)模型,其核心思想是將控制層和數(shù)據(jù)轉(zhuǎn)發(fā)層分離�？刂茖又械目刂破骷惺焦芾頂�(shù)據(jù)轉(zhuǎn)發(fā)層網(wǎng)絡(luò),可以獲得全網(wǎng)的拓?fù)湫畔ⅰ８鶕?jù)全網(wǎng)的拓?fù)湫畔?控制器可以提供鏈路的負(fù)載均衡、路徑優(yōu)化、流量分發(fā)等應(yīng)用功能。 當(dāng)網(wǎng)絡(luò)規(guī)模較小時(shí),一個(gè)控制器可以集中式管理全網(wǎng),控制器獲取全網(wǎng)拓?fù)湫畔⒑?jiǎn)單直接。但當(dāng)網(wǎng)絡(luò)規(guī)模較大時(shí),依靠單一控制器已無法滿足管理全網(wǎng)的需求,多控制器共同管理全網(wǎng)的方式隨之出現(xiàn)。使用多控制器管理全網(wǎng),每個(gè)控制器只集中管理全網(wǎng)的一個(gè)子網(wǎng),即每個(gè)控制器只收集它負(fù)責(zé)管理的子網(wǎng)的信息,并對(duì)這個(gè)子網(wǎng)的資源性能分配。控制器彼此之間交換自身控制的子網(wǎng)中的網(wǎng)絡(luò)拓?fù)湫畔?以此來獲得全網(wǎng)完整的拓?fù)湫畔?并在此基礎(chǔ)上做出決策。然而,如果其中某個(gè)控制器由于故障無法正確獲得自身子網(wǎng)中網(wǎng)絡(luò)拓?fù)湫畔?那么,其它控制器都無法從該控制器獲得完整的全網(wǎng)拓?fù)湫畔?由此導(dǎo)致控制器上各種應(yīng)用的決策失誤。本論文提出了解決這個(gè)問題的兩個(gè)方案,在這兩個(gè)方案中,控制器獨(dú)立探測(cè)網(wǎng)絡(luò)中的鏈路狀態(tài),并能定位網(wǎng)絡(luò)中出現(xiàn)的鏈路故障的方案。論文的貢獻(xiàn)如下： (1)針對(duì)已有方案定位多控制器SDN中多鏈路故障能力弱的問題,本文提出了基于遺傳算法的多環(huán)生成算法,該算法可以生成多環(huán)覆蓋網(wǎng)絡(luò)中所有鏈路,通過這些多環(huán)定位網(wǎng)絡(luò)中的多鏈路故障。算法同時(shí)對(duì)生成的多環(huán)的性能進(jìn)行了優(yōu)化,使得生成的多環(huán)包含的重復(fù)鏈路數(shù)盡量少。實(shí)驗(yàn)結(jié)果表明該方案在探測(cè)多鏈路故障的能力上比現(xiàn)有方案優(yōu)越。 (2)為了適應(yīng)網(wǎng)絡(luò)中出現(xiàn)鏈路增刪的情形,本文提出了基于樹分解定位多控制器SDN中鏈路故障的方案。首先,提出多度無損圖分割算法將網(wǎng)絡(luò)分割成多個(gè)獨(dú)立子網(wǎng),相較于傳統(tǒng)的圖分割算法生成的子網(wǎng),有如下特點(diǎn)：每個(gè)子圖中的節(jié)點(diǎn)具有連通性并且節(jié)點(diǎn)的度大于等于2；生成的子圖之間既有獨(dú)立性又具有連通性。其次,提出了最大度-寬度優(yōu)先樹分解算法在子圖中生成多環(huán),該算法生成的多環(huán)的鏈路數(shù)目的均勻性和總時(shí)延較遺傳算法生成的多環(huán)優(yōu)越。實(shí)驗(yàn)表明,基于樹分解定位多控制器SDN中鏈路故障的方案在需要下發(fā)的靜態(tài)流表項(xiàng)、發(fā)送探測(cè)信息的個(gè)數(shù)等指標(biāo)上比現(xiàn)有方案優(yōu)越。
[Abstract]:Software defined Network (SDN,Software-definned Networking) is a new network architecture model, whose core idea is to separate the control layer from the data forwarding layer. The controller centralized management of the data forwarding layer network in the control layer can obtain the topology information of the whole network. According to the topology information of the whole network, the controller can provide load balancing, path optimization, traffic distribution and other application functions. When the network scale is small, a controller can manage the whole network centrally, and the controller can obtain the topology information of the whole network simply and directly. However, when the network scale is large, relying on a single controller can no longer meet the needs of the management of the whole network. Using multiple controllers to manage the whole network, each controller manages only one subnet of the whole network, that is, each controller only collects the information of the subnet it is responsible for, and allocates the resource performance of the subnet. The controller exchanges the network topology information of its own control subnet with each other to obtain the complete topology information of the whole network and make the decision on this basis. However, if one of the controllers is unable to obtain the network topology information in its own subnet correctly due to a fault, the other controllers cannot obtain the complete network topology information from the controller. As a result, the decision making of various applications on the controller is wrong. In this paper, two schemes are proposed to solve this problem. In these two schemes, the controller detects the link state in the network independently and can locate the link fault in the network. The contributions of this paper are as follows: (1) aiming at the problem of weak multi-link fault capability in SDN, a multi-loop generation algorithm based on genetic algorithm is proposed in this paper. The algorithm can generate all links in the multi-ring overlay network and locate the multi-link faults in the multi-ring network. The algorithm also optimizes the performance of the generated multi-loop to minimize the number of duplicate links. The experimental results show that the proposed scheme is superior to the existing scheme in detecting multi-link faults. (2) in order to adapt to the condition of link adding and deleting in network, this paper proposes a scheme of link fault location in SDN based on tree decomposition. Firstly, the multi-degree lossless graph segmentation algorithm is proposed to divide the network into several independent subnets. Compared with the subnets generated by the traditional graph segmentation algorithm, it has the following characteristics: the nodes in each subgraph are connected and the degree of the nodes is greater than 2; The generated subgraphs are independent and connected. Secondly, the maximum-width first tree decomposition algorithm is proposed to generate multiple rings in the subgraph. The uniformity of the number of links and the total delay of the links generated by the algorithm are superior to those generated by genetic algorithm. Experimental results show that the scheme based on tree decomposition to locate link faults in multi-controller SDN is superior to the existing scheme in terms of static flow table items that need to be sent down and the number of detection information sent.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 侯林;周煜;顧畹儀;;靜態(tài)p-cycles雙鏈路故障保護(hù)配置準(zhǔn)則[J];北京郵電大學(xué)學(xué)報(bào);2006年04期

2 王汝言;常交法;隆克平;張杰;郭芳;;基于圈覆蓋的光突發(fā)交換網(wǎng)狀網(wǎng)故障監(jiān)測(cè)方案[J];北京郵電大學(xué)學(xué)報(bào);2007年04期

3 唐立新;旅行商問題(TSP)的改進(jìn)遺傳算法[J];東北大學(xué)學(xué)報(bào);1999年01期

4 毛期儉;顏紅;王汝言;吳大鵬;;多域全光網(wǎng)絡(luò)快速多鏈路故障定位機(jī)制[J];光通信技術(shù);2010年09期

5 韓愛麗;朱大銘;;基于一種新的邊權(quán)編碼方案的中國(guó)郵遞員問題的DNA計(jì)算模型[J];計(jì)算機(jī)研究與發(fā)展;2007年06期

6 李瑋;王雷;;中國(guó)郵遞員問題的DNA計(jì)算[J];計(jì)算機(jī)應(yīng)用;2009年07期

7 李天龍;呂勇哉;;基于自組織優(yōu)化算法的一類多旅行商問題[J];計(jì)算機(jī)應(yīng)用;2010年02期

8 姚文俊;遺傳算法及其研究進(jìn)展[J];計(jì)算機(jī)與數(shù)字工程;2004年04期

9 郭強(qiáng);遲洪欽;;基于GA的MTSP問題的研究[J];計(jì)算機(jī)與數(shù)字工程;2010年10期

10 趙國(guó)忠;陳靖一;凌韜;;遺傳算法求最優(yōu)路徑的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)與數(shù)字工程;2010年12期

，

本文編號(hào)：2366525