Abstract

Traffic grooming in optical networks refers to consolidation of subwavelength client connections onto lightpaths. Depending on whether client connections are given in advance or randomly arrive/depart, traffic grooming is classified as static and dynamic. Dynamic traffic grooming has been traditionally performed through establishing/releasing lightpaths online. In this paper, the authors propose an alternate approach to design a static logical topology a priori and then route randomly arriving client connections on it to avoid frequent lightpath setup/teardown. Two problems are considered: 1) minimize resource usage constrained by traffic blocking requirements and 2) maximize performance constrained by given resources. These are formulated as integer linear-programming (ILP) problems. The numerical results show that the resource usage dramatically decreases when the blocking requirement is relaxed, and the grooming performance slowly increases when given more resources. In addition, the number of ports at client nodes has more profound impact on traffic grooming than the number of wavelengths.

© 2006 IEEE

Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands

Arunita Jaekel, Ying Chen, and Ataul Bari
J. Opt. Commun. Netw. 2(10) 793-802 (2010)

Dynamic Multicast Traffic Grooming in Optical WDM Mesh Networks: Lightpath Versus Light-Tree

Xiaojun Yu, Gaoxi Xiao, and Tee-Hiang Cheng
J. Opt. Commun. Netw. 5(8) 870-880 (2013)

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca
J. Opt. Commun. Netw. 2(6) 305-318 (2010)

Multicast Traffic Grooming in Tap-and-Continue WDM Mesh Networks

Rongping Lin, Wen-De Zhong, Sanjay Kumar Bose, and Moshe Zukerman
J. Opt. Commun. Netw. 4(11) 918-935 (2012)

Energy Efficiency and Blocking Reduction for Tidal Traffic via Stateful Grooming in IP-Over-Optical Networks

Zhizhen Zhong, Nan Hua, Massimo Tornatore, Yao Li, Haijiao Liu, Chen Ma, Yanhe Li, Xiaoping Zheng, and Biswanath Mukherjee
J. Opt. Commun. Netw. 8(3) 175-189 (2016)