TY - GEN
T1 - Energy-aware path selection for scheduled lightpaths in IP-over-WDM networks
AU - Yang, Song
AU - Kuipers, Fernando
PY - 2011
Y1 - 2011
N2 - Traffic grooming, i.e. the aggregation of multiple traffic streams on one channel or wavelength, has often been considered in the context of reducing blocking and improving capacity utilization. More recently, traffic grooming has also been advocated in the context of energy-aware routing. In this paper we study energy-efficient path selection under the scheduled traffic model in IP-over-WDM optical networks. We show that there is indeed a strong relation between traffic grooming and energy efficiency, but also that it sometimes pays off not to groom. We propose an energy-aware routing algorithm that is based on traffic grooming, but which has the flexibility to deviate from it where needed. Our approach can be applied to networks with and without wavelength conversion. Simulations show that our energy-aware routing algorithm both brings significant energy savings as well as a lower blocking probability in comparison to a shortest paths based routing algorithm and a traffic grooming algorithm.
AB - Traffic grooming, i.e. the aggregation of multiple traffic streams on one channel or wavelength, has often been considered in the context of reducing blocking and improving capacity utilization. More recently, traffic grooming has also been advocated in the context of energy-aware routing. In this paper we study energy-efficient path selection under the scheduled traffic model in IP-over-WDM optical networks. We show that there is indeed a strong relation between traffic grooming and energy efficiency, but also that it sometimes pays off not to groom. We propose an energy-aware routing algorithm that is based on traffic grooming, but which has the flexibility to deviate from it where needed. Our approach can be applied to networks with and without wavelength conversion. Simulations show that our energy-aware routing algorithm both brings significant energy savings as well as a lower blocking probability in comparison to a shortest paths based routing algorithm and a traffic grooming algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84862916696&partnerID=8YFLogxK
U2 - 10.1109/SCVT.2011.6101312
DO - 10.1109/SCVT.2011.6101312
M3 - Conference contribution
AN - SCOPUS:84862916696
SN - 9781457712890
T3 - 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011
BT - 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011
T2 - 2011 18th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2011
Y2 - 22 November 2011 through 23 November 2011
ER -