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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Energy-aware path selection for scheduled lightpaths in IP-over-WDM networks


    Contributors:
    Song Yang, (author) / Kuipers, F. (author)


    Publication date :

    2011-11-01


    Size :

    310390 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Control of multi-domain lightpaths in peer-to-peer optical networking

    Wu, J. / Savoie, J.M. / Vukovic, A. et al. | IEEE | 2002


    Time-Scheduled Quantum Key Distribution (QKD) Over WDM Networks

    Cao, Y. / Zhao, Y. / Wu, Y. et al. | British Library Online Contents | 2018


    Scheduled flights over the Lindbergh circle

    Van Dusen, W.I. | Engineering Index Backfile | 1929


    Dynamic Journeying in Scheduled Networks

    Hame, Lauri / Hakula, Harri | IEEE | 2013


    Dynamic Journeying in Scheduled Networks

    Häme, L | Online Contents | 2013