Minimizing Cost Grooming Policy for Static Traffic in WDM Networks

[1] Dutta R and Rouskas G N. Traffic grooming in WDMnetworks: past and future[J].IEEE Network.2002, 16(6):46-56 [2] Chiu A L and Modiano E H. Traffic grooming algorithms forreducing electronic multiplexing costs in WDM ring networks[J].IEEE/OSA J. Lightwave Technol.2000, 18(1):2-12 [3] Zhu Keyao and Mukherjee B. Traffic grooming in an opticalWDM mesh network[J].IEEE J. Selected Areas inCommunications.2002, 20(1):122-133 [4] Zhu Hongyue, Zang Hui, Zhu Keyao, and Mukherjee B. Anovel generic graph model for traffic grooming inheterogeneous WDM mesh networks[J].IEEE/ACM Trans. onNetworking.2003, 11(2):285-299 [5] Yao Wang and Ramamurthy B. A link bundled auxiliarygraph model for constrained dynamic traffic grooming inWDM mesh networks[J].IEEE J. Selected Areas inCommunications.2005, 23(8):1542-1555 [6] Yao Huaxiong, Yang Zongkai, and Ou Liang, et al.. Atransceiver saving auxiliary graph model for dynamic trafficgrooming in WDM mesh networks. in the 31th IEEEConference on Local Computer Networks (LCN), Florida, US,Nov. 2006: 319-326. [7] Cerutti I and Fumagalli A. Traffic grooming in staticwavelength-division multiplexing networks. IEEECommunications Magazine, 2005, 43(1): 101-107.