Traffic Grooming Algorithm based on Hamiltonian Cycle Protection in WDM mesh networks

摘要

In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity lightpaths to make efficient use of the bandwidth. But most of the researches related to traffic grooming focused on ring networks, and fewer concerns are about the dependable traffic grooming of low-rate connections in WDM mesh networks. In our study, we present a Hamiltonian Cycle Protection based Traffic Grooming algorithm (HCPTG) considering both the survivability and traffic grooming in WDM mesh networks. Simulation results show that good performance can be achieved in terms of capacity efficiency.