Dynamic optical multicast routing in sparse-splitting WDM networks

While most of the previous optical multicast routing and wavelength assignment algorithms for sparse-splitting networks have focused on the static traffic patterns, this thesis concentrated on the algorithm performance in the dynamic traffic environment. A dynamic constrained multicast routing algorithm that is based on a widest-first path heuristics (DCMR-WFPH) has been proposed. On the contrary, all of the other optical multicast algorithms known to date utilize the Shortest-Path-based Heuristics (SPH) during the routing stage. A bottleneck wavelength assignment scheme has also been introduced. Combined with the DCMR-WFPH algorithm, this approach can reduce wavelength search space during the dynamic wavelength assignment stage. Furthermore, in this thesis, a problem in the well-known shortest-widest algorithm has been discovered and presented.;Due to the special properties of the widest-first routing algorithm, it is possible that loops can be generated during the tree generation stage. Through formal analysis, in this thesis, a number of properties in the DCMR-WFPH algorithm have been proven. Moreover, it was justified that the DCMR-WFPH algorithm can guarantee to generate real trees: No loops will be produced during the routing process.;The advantages of the algorithm have been demonstrated by simulation results. Compared to the Member-only algorithm, a well known SPH based tree generation algorithm, our algorithm outperforms in load balancing and blocking probability performances. Experiments have also shown that the method of limiting the number of wavelengths each forest can occupy, termed as forest trimming, can be utilized to improve the blocking probability performance. It has also been shown by simulation experiments that certain sparse-splitting networks equipped with less fanout capacity MCOXCs can achieve similar performance to networks with more fanout capacities.