We employ a new, generic graph model for dynamic traffic grooming in WDM mesh networks. The novelty of this model is that, by only manipulating the edges of an auxiliary graph created by the model and the weights of these edges, the model can achieve various objectives using different grooming policies, while taking into account various constraints. Based on the auxiliary graph, we develop a dynamic traffic-grooming algorithm. Different grooming policies can be implemented by different weight functions assigned to the edges in the auxiliary graph. We propose four fixed grooming policies and an Adaptive Grooming Policy (AGP), and our results show that AGP outperforms the fixed grooming policies
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.