本文選題：WDM網絡　切入點：多播業(yè)務疏導　出處：《西安電子科技大學》2014年碩士論文　論文類型：學位論文

【摘要】：光波分復用(WDM)技術是目前研究最多、發(fā)展最快、應用最為廣泛的光復用技術。經過多年的發(fā)展和應用,波分復用技術已趨于成熟,而且越來越成為現(xiàn)代通信系統(tǒng)中不可代替的傳輸技術。WDM光疏導網絡是具有業(yè)務疏導能力的光網絡。業(yè)務疏導技術是指利用電復用技術將低速業(yè)務有效地匯聚到高速的波長通道中傳輸。在動態(tài)地光疏導網絡中,業(yè)務隨機產生源節(jié)點和目的節(jié)點,在具有波長一致性限制的條件下,業(yè)務很容易產生阻塞。當前通信網絡帶寬和處理能力的提高使網絡能提供更多的多媒體業(yè)務,其中許多業(yè)務都要求網絡具有多播能力,例如音頻/視頻會議、交互式仿真、多人游戲、分布式數(shù)據(jù)庫等。在多播通信中,若對每個信宿單獨發(fā)送數(shù)據(jù)包,則將大大浪費網絡資源,增加節(jié)點的處理負擔,嚴重時會加劇網絡的擁塞。因此,需要研究多播業(yè)務的疏導策略,減少網絡資源的浪費,從而降低網絡的阻塞率。在本文中結合輔助圖模型,通過對網絡中業(yè)務疏導問題的分析,研究好的疏導策略和基于樹的多播業(yè)務疏導算法來提高WDM網絡的性能。本文中主要做的工作如下:現(xiàn)有的基于MPH算法的多播業(yè)務疏導策略有其不可避免的缺陷,針對這種缺陷,首先提出了一種基于物理拓撲光樹修正的多播業(yè)務疏導算法,該算法是利用MPH算法在特定的圖上尋找源節(jié)點到多個目的節(jié)點的路徑,以不同于現(xiàn)有的多播業(yè)務疏導策略的方法,來降低網絡中的業(yè)務阻塞率,并通過仿真來證明,基于物理拓撲光樹修正的多播業(yè)務疏導算法有著更好的性能,該算法策略降低了網絡阻塞率,同時,提高了網絡中的鏈路利用率。接下來,本文又提出了多種基于樹的多播業(yè)務疏導算法,基于樹的多播業(yè)務疏導算法首先要建立一棵樹,信源產生的數(shù)據(jù)包沿著多播樹進行轉發(fā),這棵多播樹由多播路由算法決定,因此研究構造多播樹的多播路由算法就非常重要,在本文中,我們提出了基于單棵中心樹的多播業(yè)務疏導算法、基于兩棵單向中心樹的多播業(yè)務疏導算法、基于兩棵雙向中心樹的多播業(yè)務疏導算法、基于單棵大節(jié)點中心樹的多播業(yè)務疏導算法以及基于兩棵大節(jié)點中心樹的多播業(yè)務疏導算法。上述幾種基于樹的多播業(yè)務疏導算法分別從不同的側重點考慮,目的就是降低網絡中的業(yè)務阻塞率,從本文的仿真結果中可以證明,本文提出的多種基于樹的多播業(yè)務疏導算法在降低網絡阻塞率方面,業(yè)務所需帶寬越大優(yōu)勢越明顯。
[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.
【學位授予單位】：西安電子科技大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN929.1

【相似文獻】

相關期刊論文 前10條

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

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

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

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

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

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

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

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

9 徐赤t，

本文編號：1610395