Traffic grooming in WDM networks

Abstract

Wavelength Division Multiplexing (WDM) is the promising technology, which provides very wide bandwidths to support the exponential growth of lnternet traffic. A major part of the WDM network cost is the cost of opto-electronic switching components. By grooming low speed traffic connections efficiently onto the lightpaths, the cost of the WDM network can be reduced significantly. In the first part of the thesis, different WDM ring network architectures under a non-statistical traffic model are considered. The average number of Line Terminating Equipments (LTEs) required per node in these networks is significantly lower when compared to a ring network with opaque nodes. To utilize the bandwidth efficiently, the low speed traffic connections have to be rearranged by bridge and roll. In the second part of the thesis, grooming in WDM mesh networks under a static traffic model is considered. The main objective here is to minimize the total lightpaths required. A greedy heuristic algorithm for the lightpath minimization problem is presented.