發(fā)布時間：2018-05-26 02:09

  本文選題：彈性光網(wǎng)絡(luò) + 多播�。� 參考：《西安電子科技大學(xué)》2016年碩士論文

【摘要】：隨著網(wǎng)絡(luò)中業(yè)務(wù)量的急劇增長以及寬帶業(yè)務(wù)的普及,網(wǎng)絡(luò)中的頻譜資源變得越來越寶貴,傳統(tǒng)的波長路由全光網(wǎng)由于靈活性差、頻譜資源浪費嚴重而面臨嚴峻挑戰(zhàn)。近些年提出的彈性光網(wǎng)絡(luò)以靈活利用頻譜為特征,通過采用以O(shè)FDM調(diào)制方式為基礎(chǔ)的帶寬可變技術(shù),可以根據(jù)用戶需要和業(yè)務(wù)量大小動態(tài)分配適量的頻譜資源并配置相應(yīng)的調(diào)制格式,有效克服了波長路由全光網(wǎng)的缺陷。同時,彈性光網(wǎng)絡(luò)中的路由和頻譜分配問題變得更加復(fù)雜。本文對彈性光網(wǎng)絡(luò)中的多播路由算法進行了研究,所做的主要工作如下:(1)首先介紹了全光網(wǎng)的發(fā)展歷程、彈性光網(wǎng)絡(luò)的產(chǎn)生背景及技術(shù)特點,其次介紹了彈性光網(wǎng)絡(luò)中多播技術(shù)的研究情況,并對多播技術(shù)的影響因素和主要問題進行了分析。(2)基于較優(yōu)路徑優(yōu)先選用的思想對多播路由算法進行了研究。首先,基于對路徑頻譜可利用程度的評價提出了頻譜連續(xù)度最大路徑優(yōu)先選用算法,其次,提出了多播樹頻譜連續(xù)度的概念,并基于這個概念提出了使多播樹頻譜連續(xù)度最大的路徑優(yōu)先選用算法,最后,從空隙頻隙的角度對多播樹頻譜的可利用程度進行了評價,分別提出了業(yè)務(wù)相關(guān)一致空閑頻隙算法和有效空閑頻隙算法。對這幾種算法進行了仿真,并與MPH多播路由算法進行了性能比較,結(jié)果表明,這幾種算法具有良好的阻塞性能。(3)通過改變鏈路權(quán)值和路徑權(quán)值的計算方式對Dijkstra算法進行了改進,使改進的Dijkstra算法計算出的路徑的頻譜有較大的可利用程度,同時保證路徑不會太長。對基于改進的Dijkstra算法的多播路由算法進行了仿真和性能分析。另外,提出了基于不同路由策略再次尋路的有效路徑接入算法,在多播樹建立過程中因無頻譜可分配而停止建樹時,用改進的Dijkstra算法再次尋路,盡可能地保證多播樹繼續(xù)建立并最終建立成功。對提出的算法進行了仿真和性能分析。(4)對已有的基于分層策略的多播路由算法進行了改進,提出一種基于最小代價選層的多播路由算法,通過選取代價最小的多播樹,可以有效節(jié)省頻譜資源。仿真結(jié)果表明,該算法的阻塞性能顯著提高。
[Abstract]:With the rapid growth of network traffic and the popularization of broadband services, the spectrum resources in the network become more and more valuable. The traditional wavelength routing all-optical network is faced with severe challenges because of its poor flexibility and serious waste of spectrum resources. In recent years, elastic optical networks are characterized by flexible use of spectrum, and the bandwidth variable technology based on OFDM modulation is adopted. Appropriate spectrum resources can be dynamically allocated and corresponding modulation formats can be configured according to user needs and traffic size, which effectively overcomes the defects of wavelength routing all-optical networks. At the same time, routing and spectrum allocation problems in elastic optical networks become more complex. In this paper, the multicast routing algorithm in elastic optical networks is studied. The main work is as follows: firstly, the development of all-optical networks, the background and technical characteristics of elastic optical networks are introduced. Secondly, this paper introduces the research situation of multicast technology in elastic optical networks, and analyzes the influencing factors and main problems of multicast technology. (2) based on the idea of preferred path selection, the multicast routing algorithm is studied. Firstly, based on the evaluation of the spectrum availability of the path, an algorithm of maximum path preference for spectrum continuity is proposed. Secondly, the concept of spectrum continuity of multicast tree is proposed. Based on this concept, a path preference algorithm is proposed to maximize the spectral continuity of the multicast tree. Finally, the availability of the spectrum of the multicast tree is evaluated from the point of view of the gap frequency slot. The uniform idle slot algorithm and the effective idle frequency slot algorithm are proposed respectively. These algorithms are simulated and compared with MPH multicast routing algorithm. The results show that these algorithms have good blocking performance. (3) the Dijkstra algorithm is improved by changing the calculation method of link weight and path weight. The spectrum of the path calculated by the improved Dijkstra algorithm has a greater degree of utilization, while ensuring that the path will not be too long. The multicast routing algorithm based on improved Dijkstra algorithm is simulated and its performance is analyzed. In addition, an effective path access algorithm based on different routing strategies is proposed. When the multicast tree is stopped due to no spectrum allocation, the improved Dijkstra algorithm is used to find the path again. Ensure as much as possible that the multicast tree continues to be built and eventually established successfully. Simulation and performance analysis of the proposed algorithm. (4) the existing multicast routing algorithm based on hierarchical strategy is improved, and a multicast routing algorithm based on minimum cost layer selection is proposed. By selecting the least cost multicast tree, a new multicast routing algorithm is proposed. It can save spectrum resource effectively. Simulation results show that the proposed algorithm can significantly improve the blocking performance.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2016
【分類號】：TN929.1

【相似文獻】

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

1 吳家皋;楊音穎;陳益新;;延時受限的覆蓋多播路由協(xié)議及優(yōu)化策略[J];東南大學(xué)學(xué)報(自然科學(xué)版);2005年06期

2 王東;曾鋒;閔應(yīng)驊;;基于鏈路可共享性的多播路由算法[J];湖南大學(xué)學(xué)報(自然科學(xué)版);2006年04期

3 孫學(xué)梅;張志強;李春青;;基于分層結(jié)構(gòu)的多播路由協(xié)議[J];計算機工程;2008年22期

4 周毅;和凌云;;基于最小生成樹的動態(tài)貪婪多播路由算法研究[J];硅谷;2009年08期

5 黨燕;;一種動態(tài)貪婪多播路由算法仿真模型[J];硅谷;2009年17期

6 張賢;胡致遠;黃東;;無線Mesh網(wǎng)絡(luò)可靠多播路由[J];信息安全與通信保密;2010年08期

7 師東生;;網(wǎng)絡(luò)多播路由優(yōu)化與仿真研究[J];計算機仿真;2011年10期

8 馬鈺璐,王重鋼,程時端;多核單向共享樹多播路由協(xié)議[J];計算機學(xué)報;2001年07期

9 俎云霄,孫雨耕;具有帶寬約束的靜態(tài)多播路由算法[J];電路與系統(tǒng)學(xué)報;2001年01期

10 吳家皋,楊音穎,陳益新,葉曉國;支持延時約束的覆蓋多播路由協(xié)議的研究[J];通信學(xué)報;2005年09期

相關(guān)會議論文 前6條

1 高玲玲;李偉生;;一種新的動態(tài)QoS多播路由啟發(fā)式算法[A];2006年全國通信軟件學(xué)術(shù)會議論文集[C];2006年

2 王琳珠;單_，

本文編號：1935536