本文選題：WDM網(wǎng)絡(luò)　切入點(diǎn)：多播業(yè)務(wù)疏導(dǎo)　出處：《西安電子科技大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：光波分復(fù)用(WDM)技術(shù)是目前研究最多、發(fā)展最快、應(yīng)用最為廣泛的光復(fù)用技術(shù)。經(jīng)過(guò)多年的發(fā)展和應(yīng)用,波分復(fù)用技術(shù)已趨于成熟,而且越來(lái)越成為現(xiàn)代通信系統(tǒng)中不可代替的傳輸技術(shù)。WDM光疏導(dǎo)網(wǎng)絡(luò)是具有業(yè)務(wù)疏導(dǎo)能力的光網(wǎng)絡(luò)。業(yè)務(wù)疏導(dǎo)技術(shù)是指利用電復(fù)用技術(shù)將低速業(yè)務(wù)有效地匯聚到高速的波長(zhǎng)通道中傳輸。在動(dòng)態(tài)地光疏導(dǎo)網(wǎng)絡(luò)中,業(yè)務(wù)隨機(jī)產(chǎn)生源節(jié)點(diǎn)和目的節(jié)點(diǎn),在具有波長(zhǎng)一致性限制的條件下,業(yè)務(wù)很容易產(chǎn)生阻塞。當(dāng)前通信網(wǎng)絡(luò)帶寬和處理能力的提高使網(wǎng)絡(luò)能提供更多的多媒體業(yè)務(wù),其中許多業(yè)務(wù)都要求網(wǎng)絡(luò)具有多播能力,例如音頻/視頻會(huì)議、交互式仿真、多人游戲、分布式數(shù)據(jù)庫(kù)等。在多播通信中,若對(duì)每個(gè)信宿單獨(dú)發(fā)送數(shù)據(jù)包,則將大大浪費(fèi)網(wǎng)絡(luò)資源,增加節(jié)點(diǎn)的處理負(fù)擔(dān),嚴(yán)重時(shí)會(huì)加劇網(wǎng)絡(luò)的擁塞。因此,需要研究多播業(yè)務(wù)的疏導(dǎo)策略,減少網(wǎng)絡(luò)資源的浪費(fèi),從而降低網(wǎng)絡(luò)的阻塞率。在本文中結(jié)合輔助圖模型,通過(guò)對(duì)網(wǎng)絡(luò)中業(yè)務(wù)疏導(dǎo)問(wèn)題的分析,研究好的疏導(dǎo)策略和基于樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法來(lái)提高WDM網(wǎng)絡(luò)的性能。本文中主要做的工作如下:現(xiàn)有的基于MPH算法的多播業(yè)務(wù)疏導(dǎo)策略有其不可避免的缺陷,針對(duì)這種缺陷,首先提出了一種基于物理拓?fù)涔鈽?shù)修正的多播業(yè)務(wù)疏導(dǎo)算法,該算法是利用MPH算法在特定的圖上尋找源節(jié)點(diǎn)到多個(gè)目的節(jié)點(diǎn)的路徑,以不同于現(xiàn)有的多播業(yè)務(wù)疏導(dǎo)策略的方法,來(lái)降低網(wǎng)絡(luò)中的業(yè)務(wù)阻塞率,并通過(guò)仿真來(lái)證明,基于物理拓?fù)涔鈽?shù)修正的多播業(yè)務(wù)疏導(dǎo)算法有著更好的性能,該算法策略降低了網(wǎng)絡(luò)阻塞率,同時(shí),提高了網(wǎng)絡(luò)中的鏈路利用率。接下來(lái),本文又提出了多種基于樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法,基于樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法首先要建立一棵樹(shù),信源產(chǎn)生的數(shù)據(jù)包沿著多播樹(shù)進(jìn)行轉(zhuǎn)發(fā),這棵多播樹(shù)由多播路由算法決定,因此研究構(gòu)造多播樹(shù)的多播路由算法就非常重要,在本文中,我們提出了基于單棵中心樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法、基于兩棵單向中心樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法、基于兩棵雙向中心樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法、基于單棵大節(jié)點(diǎn)中心樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法以及基于兩棵大節(jié)點(diǎn)中心樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法。上述幾種基于樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法分別從不同的側(cè)重點(diǎn)考慮,目的就是降低網(wǎng)絡(luò)中的業(yè)務(wù)阻塞率,從本文的仿真結(jié)果中可以證明,本文提出的多種基于樹(shù)的多播業(yè)務(wù)疏導(dǎo)算法在降低網(wǎng)絡(luò)阻塞率方面,業(yè)務(wù)所需帶寬越大優(yōu)勢(shì)越明顯。
[Abstract]:Optical wavelength Division Multiplexing (WDM) is the most widely used optical reuse technology, which is the most widely studied, developed and widely used. After years of development and application, wavelength division multiplexing (WDM) technology has become more and more mature. WDM optical grooming network, which is an irreplaceable transmission technology in modern communication systems, is an optical network with the ability of traffic grooming. Traffic grooming technology refers to the use of electrical multiplexing technology to effectively converge low-speed services to high performance. Transmission in a fast wavelength channel. In a dynamic optical grooming network, With the limitation of wavelength consistency, the traffic is easily blocked. The improvement of the bandwidth and processing capability of the current communication network enables the network to provide more multimedia services. Many of these services require the network to have multicast capabilities, such as audio / video conferencing, interactive simulation, multiplayer games, distributed databases, etc. It will greatly waste the network resources, increase the processing burden of the nodes, and aggravate the congestion of the network. Therefore, it is necessary to study the grooming strategy of multicast services to reduce the waste of network resources. In this paper, combining with the auxiliary graph model, the traffic grooming problem in the network is analyzed. The main work of this paper is as follows: the existing multicast traffic grooming strategy based on MPH algorithm has its inevitable defects, which is aimed at this defect. Firstly, a modified multicast traffic grooming algorithm based on physical topological optical tree is proposed. The algorithm uses MPH algorithm to find the path from source node to multiple destination nodes on a specific graph, which is different from the existing grooming strategy of multicast services. The simulation results show that the multicast grooming algorithm based on the physical topology optical tree has better performance, and the algorithm strategy reduces the blocking rate of the network, at the same time, Secondly, this paper proposes a variety of tree-based multicast traffic grooming algorithms. The tree-based multicast traffic grooming algorithm first establishes a tree, and the packets generated by the source are forwarded along the multicast tree. The multicast tree is determined by the multicast routing algorithm, so it is very important to study the multicast routing algorithm to construct the multicast tree. In this paper, we propose a multicast traffic grooming algorithm based on a single central tree. The multicast traffic grooming algorithm based on two unidirectional center trees and the multicast traffic grooming algorithm based on two bidirectional center trees. The multicast traffic grooming algorithm based on single large node center tree and the multicast traffic grooming algorithm based on two large node center trees. The aim of this paper is to reduce the traffic blocking rate in the network. From the simulation results in this paper, it can be proved that the advantage of the proposed tree-based multicast grooming algorithm in reducing the congestion rate of the network is more obvious than that of the larger bandwidth required by the service.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TN929.1

【相似文獻(xiàn)】

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

1 楊樹(shù)偉;田霖;石晶林;;單小區(qū)多播業(yè)務(wù)調(diào)度算法設(shè)計(jì)與仿真[J];系統(tǒng)仿真學(xué)報(bào);2009年18期

2 張林叢;劉業(yè)君;郭磊;魏可峰;戴翠琴;;以太無(wú)源光網(wǎng)絡(luò)中面向多播業(yè)務(wù)的節(jié)能算法(英文)[J];光子學(xué)報(bào);2014年07期

3 趙紹剛;;WCDMA中支持MBMS業(yè)務(wù)的無(wú)線鏈路技術(shù)[J];電信快報(bào);2006年05期

4 石明衛(wèi);;MBMS及其演進(jìn)[J];電視技術(shù);2012年11期

5 趙紹剛;;WCDMA中支持MBMS業(yè)務(wù)的無(wú)線鏈路技術(shù)[J];移動(dòng)通信;2006年06期

6 趙紹剛,李岳夢(mèng);CDMA2000系統(tǒng)中的廣播和多播業(yè)務(wù)[J];電信快報(bào);2005年08期

7 趙紹剛;李岳夢(mèng);;CDMA2000系統(tǒng)中的廣播和多播業(yè)務(wù)[J];數(shù)字通信世界;2005年08期

8 鄭瑜;;CDMA 2000廣播—多播業(yè)務(wù)的安全研究[J];移動(dòng)通信;2008年09期

9 徐赤t，

本文編號(hào)：1610395