A New Dynamic-Grooming Algorithm for IP over WDM Optical Networks

摘要

Efficiently grooming low-rate traffic flows into high-capacity lightpaths will improve the network throughput and resource utilization. In this paper, we study the traffic -grooming algorithm for WDM mesh networks. A novel dynamic grooming graph is proposed, which models the number of transceivers per node and the number of wavelength per fiber in addition to the combined information of IP layer and WDM layer, while taking into account the constraints of wavelength continuity in optical domain. Based on the grooming graph, a new dynamic traffic-grooming algorithm, namely Integrated Grooming Algorithm (IGA), is developed to provide an efficient solution to the traffic-grooming problem in WDM optical mesh networks. This algorithm is evaluated via simulations and results reveal that satisfactory performance of the proposed algorithms can be achieved.