Resource Efficient Grooming Policy in Groomable WDM Mesh Networks

Abstract

This paper addresses the traffic grooming problem in wavelength-division multiplexing (WDM) mesh networks. We first introduce a transceiver saving auxiliary graph model, in which various grooming policies can easily be achieved by assigning weight values for various edges. Then we propose a resource efficient grooming policy (REGP) based on the graph model, which take into account the wavelength constraint and transceiver constraint simultaneously according to the correlation between them while other policies consider only one between them. The REGP policy can apply to dynamic traffic and static traffic. In dynamic traffic scenario, REGP utilizes network resources efficiently according to the ratio of the available number of two resources. In static traffic scenario, REGP chooses the most economical routing path according to the cost ratio between the two resources. Simulation results validate that REGP reduces the blocking probability for dynamic traffic and saves the total network cost for static traffic. Results also show that REGP always has a better performance than other policies in various conditions, static traffic, dynamic traffic and various resource deployments.