Traffic Grooming Algorithm for minimizing the number of SONET ADM in the WDM Ring Network

WDM 링에서 SONET ADM 수 최소화를 위한 트래픽 grooming 알고리즘

In this paper, we propose new algorithm to minimize the total cost of overall system in WDM ring networks. The cost of system includes the number of SONET ADMs as well as the number of wavelength. As optical technologies and WDM components are developed, the dominant cost of system is the number of SONET ADMs which is electronic equipment. To reduce the number of SONET ADMs in nonuniform traffic, we propose two algorithms one is the algorithm to construct full circles as many as possible to minimize gaps by cutting and combining the connections. The other is the algorithm to groom circles Into a wavelength to share the maximum number of nodes. The simulation results show that the proposed algorithm is superior to conventional algorithm in nonuniform traffic