Abstract
This thesis studies the dynamic multicast traffic grooming problem in optical WDM networks. Path establishment and light-tree selection are the key issues of the problem. This thesis defines a cost density and uses it to develop a new algorithm to find the minimum-cost-density path and light-trees. This dynamic multicast traffic grooming algorithm is called minimum cost density (MCD) algorithm. Blocking probability and several other performance measures are used to compare with some existing algorithm via simulations. Simulation results show that the MCD algorithm has better performance.