發(fā)布時(shí)間：2018-07-13 13:49

【摘要】：波分復(fù)用(Wavelength Division Multiplexing,WDM)技術(shù)的提出和發(fā)展使得網(wǎng)絡(luò)帶寬資源得到了充分的利用。業(yè)務(wù)量疏導(dǎo)技術(shù)將多個(gè)低速的業(yè)務(wù)請(qǐng)求匯聚到高速的波長(zhǎng)通道上進(jìn)行傳輸,有效地提高了網(wǎng)絡(luò)資源利用率,同時(shí)降低了網(wǎng)絡(luò)阻塞率。由于WDM業(yè)務(wù)量疏導(dǎo)網(wǎng)絡(luò)承載了巨大的業(yè)務(wù)量,一旦網(wǎng)絡(luò)發(fā)生突發(fā)故障,便會(huì)導(dǎo)致大量業(yè)務(wù)的中斷,帶來(lái)嚴(yán)重的后果。因此對(duì)WDM業(yè)務(wù)疏導(dǎo)網(wǎng)絡(luò)生存性問(wèn)題的研究極為重要。為了解決WDM業(yè)務(wù)疏導(dǎo)網(wǎng)絡(luò)的生存性問(wèn)題,本文研究了WDM業(yè)務(wù)疏導(dǎo)網(wǎng)絡(luò)的動(dòng)態(tài)恢復(fù)機(jī)制。完整的動(dòng)態(tài)恢復(fù)機(jī)制包括重路由算法和恢復(fù)協(xié)議。本文首先研究了基于鏈路捆綁輔助圖LBAG的動(dòng)態(tài)疏導(dǎo)算法DGA L,并將其作為動(dòng)態(tài)恢復(fù)機(jī)制的重路由算法；其次,研究并設(shè)計(jì)了雙節(jié)點(diǎn)啟動(dòng)恢復(fù)協(xié)議BNRP和多節(jié)點(diǎn)啟動(dòng)恢復(fù)協(xié)議MNRP,將這兩種恢復(fù)協(xié)議應(yīng)用到疏導(dǎo)網(wǎng)絡(luò)中,完整地設(shè)計(jì)了單鏈路故障雙節(jié)點(diǎn)啟動(dòng)恢復(fù)機(jī)制。按照恢復(fù)粒度要求的不同,設(shè)計(jì)分析了連接級(jí)和光路級(jí)雙節(jié)點(diǎn)啟動(dòng)恢復(fù)機(jī)制,C-BNRM和L-BNRM。之后,對(duì)C-BNRM進(jìn)行擴(kuò)展,設(shè)計(jì)了單鏈路故障多節(jié)點(diǎn)啟動(dòng)恢復(fù)機(jī)制S-MNRM;再次,考慮到隨著網(wǎng)絡(luò)規(guī)模的日益擴(kuò)大,網(wǎng)絡(luò)中存在發(fā)生雙鏈路故障的可能性,本文針對(duì)網(wǎng)絡(luò)發(fā)生雙鏈路故障的情況分別設(shè)計(jì)了雙鏈路故障雙節(jié)點(diǎn)和多節(jié)點(diǎn)啟動(dòng)恢復(fù)機(jī)制,D-BNRM和D-MNRM。論文最后對(duì)設(shè)計(jì)的WDM業(yè)務(wù)疏導(dǎo)網(wǎng)絡(luò)的動(dòng)態(tài)恢復(fù)機(jī)制進(jìn)行了仿真,仿真結(jié)果表明,C-BNRM相對(duì)于L-BNRM靈活性較強(qiáng),C-BNRM的恢復(fù)成功率和資源利用率高于L-BNRM,且C-BNRM的故障恢復(fù)時(shí)間整體上短于L-BNRM;將C-BNRM進(jìn)行擴(kuò)展設(shè)計(jì)了S-MNRM,將這兩種動(dòng)態(tài)恢復(fù)機(jī)制與源節(jié)點(diǎn)啟動(dòng)恢復(fù)機(jī)制SIRM及傳統(tǒng)的無(wú)疏導(dǎo)的動(dòng)態(tài)恢復(fù)算法DPR進(jìn)行比較,結(jié)果表明,S-MNRM的恢復(fù)性能最好,S-MNRM增加了恢復(fù)過(guò)程啟動(dòng)節(jié)點(diǎn)的個(gè)數(shù),縮短了故障消息到達(dá)啟動(dòng)節(jié)點(diǎn)的傳輸時(shí)延,從而縮短了故障恢復(fù)時(shí)間。此外,業(yè)務(wù)量疏導(dǎo)技術(shù)的應(yīng)用有助于提高動(dòng)態(tài)恢復(fù)機(jī)制的故障恢復(fù)率,同時(shí)降低故障恢復(fù)時(shí)間；將D-BNR RM和D-MNRM進(jìn)行比較的結(jié)果表明,D-MNR M在不增加故障恢復(fù)率、資源利用率及網(wǎng)絡(luò)阻塞率的前提下,有效地縮短了故障恢復(fù)時(shí)間,具有良好的恢復(fù)性能。
[Abstract]:With the development of wavelength Division Multiplexing (WDM) technology, the network bandwidth resources are fully utilized. Traffic grooming technology converges multiple low-speed traffic requests to high speed wavelength channels for transmission, which effectively improves the utilization of network resources and reduces the network blocking rate. As the WDM traffic grooming network carries a huge amount of traffic, once the network has a sudden failure, it will lead to a large number of business disruption, which will bring serious consequences. Therefore, it is very important to study the survivability of WDM traffic grooming networks. In order to solve the survivability problem of WDM traffic grooming networks, the dynamic recovery mechanism of WDM traffic grooming networks is studied in this paper. The complete dynamic recovery mechanism includes rerouting algorithm and recovery protocol. In this paper, the dynamic grooming algorithm DGA Lbased on link binding auxiliary graph LBAG is studied, and it is regarded as the rerouting algorithm of dynamic recovery mechanism. A two-node startup recovery protocol (BNRP) and a multi-node start recovery protocol (MNRP) are studied and designed. The two recovery protocols are applied to the grooming network and a two-node startup recovery mechanism for a single link fault is designed. C-BNRM and L-BNRM are designed and analyzed according to different granularity requirements. After that, C-BNRM is extended to design a single-link fault multi-node startup recovery mechanism S-MNRM.The third, considering the possibility of double-link failure in the network with the increasing scale of the network, In this paper, the dual-link fault dual-node and multi-node startup recovery mechanisms, D-BNRM and D-MNRMrespectively, are designed for the case of double-link failure in the network. Finally, the dynamic recovery mechanism of WDM grooming network is simulated. The simulation results show that C-BNRM is more flexible than L-BNRM and C-BNRM has higher recovery success rate and resource utilization than L-BNRM.The fault recovery time of C-BNRM is shorter than that of L-BNRM.The C-BNRM is extended to design S-MNRMand the two dynamic recovery mechanisms and source sections are designed. The point start recovery mechanism (SIRM) is compared with the traditional ungrooming dynamic recovery algorithm (DPR). The results show that S-MNRM has the best recovery performance. S-MNRM increases the number of starting nodes in the recovery process, shortens the transmission delay of the fault message to start node, and thus shortens the time of fault recovery. In addition, the application of traffic grooming technique can improve the recovery rate of dynamic recovery mechanism and reduce the recovery time. The comparison between D-BNR RM and D-MNRM shows that D-MNR M does not increase the recovery rate. Under the premise of resource utilization and network blocking rate, the fault recovery time is shortened effectively and the recovery performance is good.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.1

【相似文獻(xiàn)】

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

1 羅海麗;;含錯(cuò)誤恢復(fù)機(jī)制的預(yù)測(cè)分析法的構(gòu)造[J];陰山學(xué)刊(自然科學(xué)版);2007年01期

2 羅海麗;;含錯(cuò)誤診斷恢復(fù)機(jī)制的算符優(yōu)先法的構(gòu)造[J];陰山學(xué)刊(自然科學(xué)版);2007年02期

3 徐潔;郭星廷;夏夢(mèng)芹;;一種基于分段共享的預(yù)測(cè)式錯(cuò)誤恢復(fù)機(jī)制[J];計(jì)算機(jī)科學(xué);2003年12期

4 熊余;林艷芳;王汝言;;一種端節(jié)點(diǎn)啟動(dòng)的光網(wǎng)絡(luò)快速恢復(fù)機(jī)制[J];微計(jì)算機(jī)信息;2008年18期

5 匡興紅;李軍軍;梁擁成;;WSN跟蹤應(yīng)用中一種新的目標(biāo)恢復(fù)機(jī)制研究[J];科學(xué)技術(shù)與工程;2010年34期

6 劉鑄,李鋼,姚益平,季利春;聯(lián)盟執(zhí)行的保存恢復(fù)機(jī)制及其實(shí)現(xiàn)[J];計(jì)算機(jī)仿真;2004年08期

7 羅海麗;;語(yǔ)法分析中錯(cuò)誤恢復(fù)機(jī)制的構(gòu)造[J];內(nèi)蒙古科技與經(jīng)濟(jì);2007年14期

8 海深;陸陽(yáng);袁菲;;嵌入式存儲(chǔ)系統(tǒng)恢復(fù)機(jī)制的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)工程;2006年24期

9 劉方方;余潔;吳靖U，

本文編號(hào)：2119582