WDM网络中动态多播业务疏导算法的研究

发布时间：2018-03-14 08:26

本文选题：WDM网络　切入点：多播业务疏导　出处：《西安电子科技大学》2014年硕士论文　论文类型：学位论文

【摘要】：光波分复用(WDM)技术是目前研究最多、发展最快、应用最为广泛的光复用技术。经过多年的发展和应用,波分复用技术已趋于成熟,而且越来越成为现代通信系统中不可代替的传输技术。WDM光疏导网络是具有业务疏导能力的光网络。业务疏导技术是指利用电复用技术将低速业务有效地汇聚到高速的波长通道中传输。在动态地光疏导网络中,业务随机产生源节点和目的节点,在具有波长一致性限制的条件下,业务很容易产生阻塞。当前通信网络带宽和处理能力的提高使网络能提供更多的多媒体业务,其中许多业务都要求网络具有多播能力,例如音频/视频会议、交互式仿真、多人游戏、分布式数据库等。在多播通信中,若对每个信宿单独发送数据包,则将大大浪费网络资源,增加节点的处理负担,严重时会加剧网络的拥塞。因此,需要研究多播业务的疏导策略,减少网络资源的浪费,从而降低网络的阻塞率。在本文中结合辅助图模型,通过对网络中业务疏导问题的分析,研究好的疏导策略和基于树的多播业务疏导算法来提高WDM网络的性能。本文中主要做的工作如下:现有的基于MPH算法的多播业务疏导策略有其不可避免的缺陷,针对这种缺陷,首先提出了一种基于物理拓扑光树修正的多播业务疏导算法,该算法是利用MPH算法在特定的图上寻找源节点到多个目的节点的路径,以不同于现有的多播业务疏导策略的方法,来降低网络中的业务阻塞率,并通过仿真来证明,基于物理拓扑光树修正的多播业务疏导算法有着更好的性能,该算法策略降低了网络阻塞率,同时,提高了网络中的链路利用率。接下来,本文又提出了多种基于树的多播业务疏导算法,基于树的多播业务疏导算法首先要建立一棵树,信源产生的数据包沿着多播树进行转发,这棵多播树由多播路由算法决定,因此研究构造多播树的多播路由算法就非常重要,在本文中,我们提出了基于单棵中心树的多播业务疏导算法、基于两棵单向中心树的多播业务疏导算法、基于两棵双向中心树的多播业务疏导算法、基于单棵大节点中心树的多播业务疏导算法以及基于两棵大节点中心树的多播业务疏导算法。上述几种基于树的多播业务疏导算法分别从不同的侧重点考虑,目的就是降低网络中的业务阻塞率,从本文的仿真结果中可以证明,本文提出的多种基于树的多播业务疏导算法在降低网络阻塞率方面,业务所需带宽越大优势越明显。
[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

【相似文献】