本文選題：生存性　切入點(diǎn)：網(wǎng)狀網(wǎng)　出處：《南京郵電大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：網(wǎng)絡(luò)的生存性在研究在互聯(lián)網(wǎng)高速發(fā)展的時(shí)代顯得尤為重要。P圈是一種新興的生存性保護(hù)技術(shù),這一生存性保護(hù)技術(shù)集合了環(huán)網(wǎng)的恢復(fù)速度快和網(wǎng)狀網(wǎng)資源利用率高的優(yōu)點(diǎn),成為了眾多學(xué)者研究的一個(gè)熱點(diǎn)。P圈保護(hù)技術(shù)分為兩部分,第一部分是P圈的構(gòu)造,第二部分是P圈的配置。P圈的保護(hù)類型有兩種,節(jié)點(diǎn)環(huán)繞型P圈和鏈路型P圈。在節(jié)點(diǎn)環(huán)繞型P圈中,深度優(yōu)先搜索算法(DFS)在對(duì)中心節(jié)點(diǎn)構(gòu)造圈時(shí),通常不是簡(jiǎn)單圈,如果以此為基礎(chǔ)進(jìn)行擴(kuò)張得到的P圈先驗(yàn)效率不高。因此,本文提出改進(jìn)的DFS構(gòu)造算法,將由DFS算法構(gòu)造出的節(jié)點(diǎn)環(huán)繞型P圈收縮成簡(jiǎn)單圈,而且在擴(kuò)張過程中,區(qū)別于Grow算法選擇第一條邊擴(kuò)張,改進(jìn)算法選擇擴(kuò)張后先驗(yàn)效率最高的邊進(jìn)行擴(kuò)張。仿真結(jié)果表明,改進(jìn)的DFS算法構(gòu)造節(jié)點(diǎn)環(huán)繞型P圈算法先驗(yàn)效率明顯高于傳統(tǒng)DFS算法。在鏈路型P圈中,針對(duì)Grow算法構(gòu)造出來的圈集合P圈數(shù)量多,而且Grow算法在擴(kuò)張時(shí)選擇第一條進(jìn)行擴(kuò)張,先驗(yàn)效率可能較低的缺點(diǎn),本文提出了一種圈合并算法,將SLA算法、SP-Add算法和改進(jìn)的Grow算法構(gòu)造的P圈集合進(jìn)行相交邊的合并,合并后先驗(yàn)效率高的加入備選P圈,低于合并前的P圈則丟棄。仿真結(jié)果表明,合并后的P圈數(shù)量明顯減少,同時(shí)先驗(yàn)效率高于傳統(tǒng)Grow構(gòu)造的P圈。對(duì)于構(gòu)造好的P圈需要進(jìn)行空閑容量的分配。針對(duì)容量迭代CIDA算法采用Grow算法進(jìn)行備選P圈的構(gòu)造,可能會(huì)丟失性能良好的候選圈。本文采用了基于K最短路徑構(gòu)造P圈法,將所有的P圈作為候選圈,優(yōu)先選取容量效率CE大的圈,如果CE一樣大,則選取引入跨接邊多的圈進(jìn)行配置,如果選取的跨接邊還是一樣多,那么就選取浪費(fèi)空閑容量小的圈進(jìn)行配置。同時(shí)引入保護(hù)時(shí)隙比和保護(hù)開銷比來確定對(duì)實(shí)際網(wǎng)絡(luò)的保護(hù)能力。仿真結(jié)果表明,新的容量分配算法配置的P圈在大規(guī)模網(wǎng)絡(luò)中能達(dá)到與最優(yōu)解相差4.5%的冗余度優(yōu)于CIDA的6.1%,同時(shí)運(yùn)行的時(shí)間低于1.6秒,且能夠利用較少的資源提供100%的保護(hù)。
[Abstract]:The survivability of the network is especially important in the era of the rapid development of the Internet. P circle is a new survivability protection technology. This survivability protection technology combines the advantages of the fast recovery speed of the ring network and the high utilization rate of the mesh network resources. The protection technology of P cycle, which has become a hot topic of many scholars, is divided into two parts: the first part is the construction of P cycle, the second part is the configuration of P cycle. There are two kinds of protection types of P cycle. In the node-surrounded P-cycle, the depth-first search algorithm (DFS) is usually not a simple loop when constructing a circle for the central node. If the priori efficiency of P-cycle expansion based on this is not high, an improved DFS construction algorithm is proposed in this paper, in which the node-encircling P-cycle constructed by DFS algorithm is reduced to a simple cycle, and in the process of expansion, Different from the Grow algorithm, the first edge extension is selected, and the improved algorithm is used to select the edge with the highest prior efficiency after the expansion. The simulation results show that, The priori efficiency of the improved DFS algorithm is obviously higher than that of the traditional DFS algorithm. In the link-type P-cycle, the number of cycles constructed by the Grow algorithm is large, and the Grow algorithm chooses the first one to expand when it is extended. In this paper, a cycle merging algorithm is proposed, in which the set of P cycles constructed by the SLA algorithm and the improved Grow algorithm are combined with the intersection edges, and the priori cycles are added into the alternative P cycles with high prior efficiency. The results of simulation show that the number of P-cycles after merging is obviously reduced. At the same time, the priori efficiency is higher than the P-cycle constructed by traditional Grow. The free capacity allocation is needed for the constructed P-cycle. The Grow algorithm is used to construct the alternative P-cycle for the capacity iterative CIDA algorithm. In this paper, we use the method of constructing P-cycle based on the shortest path of K, take all P-cycles as candidate cycles, select the cycle with large capacity efficiency CE, if CE is as large, Then select the number of loops that introduce more straddle edges, and if the number of cross-edges is the same, At the same time, the protection time slot ratio and the protection overhead ratio are introduced to determine the protection ability of the actual network. The simulation results show that, The P-cycle configured by the new capacity allocation algorithm can achieve the redundancy of 4.5% different from the optimal solution in large-scale networks, which is better than that of CIDA in 6.1 seconds, and the time of running at the same time is less than 1.6 seconds, and can provide 100% protection with less resources.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.1

【參考文獻(xiàn)】

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

1 丁玉龍;吳雯婷;徐榮青;;基于鏈路容量有限的啟發(fā)式p圈容量分配算法[J];光通信研究;2014年01期

2 陶思言;李潔;;P圈技術(shù)研究[J];計(jì)算機(jī)光盤軟件與應(yīng)用;2012年01期

3 韋樂平;;光網(wǎng)絡(luò)的發(fā)展趨勢(shì)與挑戰(zhàn)[J];電信科學(xué);2011年02期

4 甘寶寶;蔣紅亮;孫曉寅;徐榮青;;一種改進(jìn)的啟發(fā)式P圈構(gòu)造算法[J];計(jì)算機(jī)應(yīng)用研究;2009年09期

5 臧云華;鄧宇;張杰;顧畹儀;;Mesh光網(wǎng)絡(luò)基于有向P圈的保護(hù)配置策略[J];光通信研究;2007年04期

6 高飛;王汝言;;光網(wǎng)絡(luò)的保護(hù)策略[J];數(shù)據(jù)通信;2006年03期

7 趙太飛;虞紅芳;李樂民;;基于Local-map的Mesh光網(wǎng)絡(luò)簡(jiǎn)單p圈構(gòu)造法[J];光電工程;2006年05期

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

1 陳春風(fēng);光網(wǎng)狀網(wǎng)中的路徑保護(hù)技術(shù)研究[D];上海交通大學(xué);2007年

2 趙太飛;抗毀光網(wǎng)絡(luò)中預(yù)置圈算法研究[D];電子科技大學(xué);2007年

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

1 丁玉龍;光網(wǎng)絡(luò)中基于p圈的啟發(fā)式算法研究[D];南京郵電大學(xué);2014年

2 徐珊珊;特殊圖類中子圖的度和與路圈性質(zhì)[D];山東師范大學(xué);2013年

3 胡秀園;基于P圈的Mesh光網(wǎng)絡(luò)生存性機(jī)制研究[D];華北電力大學(xué);2013年

4 姚曉宇;WDM光網(wǎng)絡(luò)中基于p-Cycle的保護(hù)算法研究[D];南京郵電大學(xué);2011年

5 毛彗巖;自動(dòng)交換光網(wǎng)絡(luò)保護(hù)恢復(fù)方式的研究[D];北京郵電大學(xué);2007年

，

本文編號(hào)：1562582