The Intelligent Analysis In The Problem Of Grooming Of Traffics In WDM Tree Networks

Traffic grooming in WDM optical networks is one of the most important and hot problem in the area of optical networks. We systematically investigated the grooming problems in WDM optical tree networks with static and dynamic traffic requirements in this thesis. The major innovation of this thesis include: (1) To formulate a set of multi-objective integer nonlinear programming equations to the general grooming problems in WDM tree networks with both static and dynamically changing traffics; (2) To propose the genetic algorithms to deal with a variety of grooming problems in tree networks. Some of the minor contributions of this thesis are: (1) To propose the connection model of optical tree networks, and which is come true in the computer. (2) To apply the technology of wavelengths-reuse in the decoding of the individual in the genetic algorithms.The main content of this thesis is as follows.In this thesis , firstly, we briefly recommend the research instance of the technology in optical networks at present. Then , we introduce the theory, means, applied mechanics and the research instance in the genetic algorithms. Secondly, we in particular discuss the grooming problems in WDM optical tree networks with static traffic requirements. We formulate a set of multi-objective integer nonlinear programming equations to the general grooming problems in WDM tree networks with traffic requirements, then we derived the theoretical lower and upper bounds on the number of wavelengths and ADM in trees. Then we propose the genetic algorithms to deal with a variety of grooming problems in tree networks, and receive the simulated results to the computer which are discussed. Then we investigate strictly non-blocking grooming problems in WDM tree networks with dynamically changing traffics, formulate the genetic algorithms to deal with it, and discuss the resulting of grooming. Finally, some problems in the study are analyzed and discussed.