Energy-Efficient Traffic Grooming in WDM Networks With Scheduled Time Traffic

• Published in: Journal of lightwave technology Vol. 29; no. 17; pp. 2577 - 2584
• Main Authors: SHUQIANG ZHANG, DONG SHEN, CHAN, Chun-Kit
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.09.2011; Institute of Electrical and Electronics Engineers
• Subjects: Applied sciences; Energy consumption; Energy efficiency; Equations; Exact sciences and technology; Information, signal and communications theory; Multiplexing; Optical fiber communications; Optical fiber networks; Optical telecommunications; Power demand; Signal and communications theory; Systems, networks and services of telecommunications; Telecommunication traffic; Telecommunications; Telecommunications and information theory; Teletraffic; traffic grooming; Transceivers; Transmission and modulation (techniques and equipments); wavelength routing networks; Backbone; Optical telecommunication; Teletraffic; Wavelength division multiplexing; Linear programming; Routing; Scheduling; Traffic load; traffic grooming; Call time; Integer programming; Optical fiber network; Energetic efficiency; Holding time; Heuristic method; Telecommunication network; Electric power consumption; Optical fiber communication; Minimum energy; Energy efficiency; wavelength routing networks; Low-power electronics
• ISSN: 0733-8724; 1558-2213
• DOI: 10.1109/JLT.2011.2161266

In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption of the core network, with the additional consideration of the holding times of the lightpaths and connection requests. In the static case, all connection requests with their setup and tear-down times are known in advance. We formulate an integer linear programming to minimize the energy consumption. In the dynamic case, we adopt a layered graph model called grooming graph and propose a new traffic grooming heuristics called time-aware traffic grooming, which takes the holding time of a new arrival connection request and the remaining holding time of existing lightpaths into consideration. We compare different traffic grooming policies, in terms of the energy efficiency, under various traffic loads. The results provide implications to select the most energy-efficient traffic grooming policies under various scenarios.