Research On Dynamic Multicast Traffic Grooming Algorithm In WDM Networks

WDM technology is an optical multiplexing technique which is the most studied, rapidly growing and widely used. After many years of development and application, WDM technology has become more mature.It is a transmission technology that can not be replaced in modern communication system.In this thesis we discuss WDM networks with traffic grooming capability.Traffic grooming is a technique which multiplex several low-speed traffic connections onto a single lightpath with high-speed.In dynamic WDM networks with traffic grooming capability, businesses randomly generate source and destination nodes.In the condition of wavelength constraint,connections can easily blocked.With recent advances in high-speed communication network the demand for providing more multi- media applications is increasing.Many of these applications require networks to provide multicast.These applications,for instance,can be audio/video conference,distributed simulation,multi- user game,distributed database.Network resources and network nodes’ processing ability will be wasted dramatically,thus it may result in network congestion if multicast is realized by sending packet copies to every destination individually.Therefore,you need to study multicast traffic grooming strategy to reduce the waste of network resources,thereby reducing the blocking rate of the network.In this thesis we use auxiliary graph to analysis traffic grooming problems,then summarize better grooming and rerouting policy to improve the performance of WDM networks.The main work of this thesis is as follows:The existing multicast traffic grooming strategy based on MPH algorithm has its inevitable defects.For this defect,first we proposed a correct multicast traffic grooming algorithm based on the physical topo logy light-tree.The algorithm is used of MPH algorithm to find the paths of the source node to multiple destination nodes in the particular Figure.The algorithm differs to the existing multicast traffic groomingstrategy,it will reduce the network traffic blocking rate.And the simulation results can prove that the correct multicast traffic grooming algorithm based on the physical topology light-tree has better performance.The algorithm reduces network congestion rate,while improving the network link utiliza tion.Next,the thesis also proposed a variety of tree-based multicast traffic grooming algorithms.Multicast traffic grooming algorithm based on the tree must first establish a tree,data packets generated by the source are forwarded along the multicast tree.The multicast tree is determined by the multicast routing algorithm,so the research construct multicast tree multicast routing algorithm is very important.In this thesis,we propose a variety of tree-based multicast traffic grooming algorithms.The algorit hms are considered from different emphases,the purpose is to reduce network traffic blocking rate.The simulation results can prove that the various proposed tree-based multicast traffic grooming algorithms while reducing network congestion rate,the greater the bandwidth required for the business,the more obvious advantages.