Sparse traffic grooming in WDM networks using coarse granularity OXCs

Abstract

Providing grooming capability to optical crossconnects (OXCs) in wavelength division multiplexing (WDM) networks can allow an effective use of the network bandwidth, however, it increases the node cost that operators must sustain when compared to a non-grooming network. Therefore, operators might consider using sparse grooming instead of full grooming networks. In this article we consider sparse groomed optical networks. Our contribution is 2-fold. First, we address the grooming placement problem that seeks for a set of grooming nodes in the network that leads to the highest overall throughput. This problem is separated into two sub-problems: (i) selection of nodes having grooming capability; (ii) maximization of network throughput assuming the grooming nodes found by the previous step. These two sub-problems are mathematically formulated for different OXC placing strategies considering a static traffic scenario. In the second part, we design a practical heuristic grooming algorithm suitable for dynamic traffic scenarios. The benefit of using sparse grooming nodes, when compared with a non-grooming scenario, is evaluated in terms of throughput and optical port utilization. Our analysis differs of previous ones since it considers grooming at a granularity coarser than the traffic granularity, which is an important aspect since network cost improvement can be obtained at the expense of irrelevant performance impairments. Results show that the insertion of coarse granularity OXCs can be a viable solution for network throughput increase since this can be done at the expense of relatively few or no extra optical ports.