Research On Traffic Grooming Algorithms For Optical Networks

With the development of optical network, gradual maturity of WDM technology and expansion of IP traffic demand, the significance of developing broadband and intelligent Optical Transport Network (OTN) is becoming obvious. In this thesis present network structures and future development characteristics are investigated. Based on this investigation, we study the traffic grooming problem in optical network, and provide effective solutions and strategies for optical network design. These solutions and strategies are expected to have some theoretical value and application prospect.In this dissertation, traffic grooming in WDM network are researched thoroughly. To address this problem, we propose a novel auxiliary graph model and corresponding algorithms. The main research works done are listed as follows.(1) The idea of multicast routing is applied to solve the problem of static traffic grooming in this thesis. The grooming trees are constructed when traffic is groomed.(2) Based on the lower utilization of wavelength resources in dynamic traffic grooming, we propose an efficient dynamic traffic grooming algorithm, its advantage lies in using wavelength resources sufficiently, and reduces blocking probability of request.(3) The traffic grooming problem in mufti-granularity optical networks is studied in this thesis. We propose an efficient waveband traffic grooming algorithm, its advantage lies in using a little more wavelength resource to get much more reduction in the number of switching ports, and reduces the cost of networks.The performance of the proposed algorithms is analyzed and validated by computer simulation in multiple aspects. Finally, the whole summary of this dissertation is given and the issues to be studied further are also presented.