Routing On Demand: Toward the Energy-Aware Traffic Engineering with OSPF

Abstract

Energy consumption has already become a major challenge to the current Internet. Most researches aim at lowering energy consumption under certain fixed performance constraints. Since trade-offs exist between network performance and energy saving, Internet Service Providers (ISPs) may desire to achieve different Traffic Engineering (TE) goals corresponding to changeable requirements. The major contributions of this paper are twofold: 1) we present an OSPF-based routing mechanism, Routing On Demand (ROD), that considers both performance and energy saving, and 2) we theoretically prove that a set of link weights always exists for each trade-off variant of the TE objective, under which solutions (i.e., routes) derived from ROD can be converted into shortest paths and realized through OSPF. Extensive evaluation results show that ROD can achieve various trade-offs between energy saving and performance in terms of Maximum Link Utilization, while maintaining better packet delay than that of the energy-agnostic TE. © 2012 IFIP International Federation for Information Processing.

Document type: Part of book or chapter of book

Full document

Original document

The different versions of the original document can be found in:

• http://epubs.surrey.ac.uk/766213

• https://link.springer.com/content/pdf/10.1007%2F978-3-642-30045-5_18.pdf

• http://www.springerlink.com/index/pdf/10.1007/978-3-642-30045-5_18,

http://dx.doi.org/10.1007/978-3-642-30045-5_18

• https://hal.inria.fr/hal-01531129,

https://hal.inria.fr/hal-01531129/document,

https://hal.inria.fr/hal-01531129/file/978-3-642-30045-5_18_Chapter.pdf under the license http://creativecommons.org/licenses/by/

• https://hal.inria.fr/hal-01531129/document,

http://epubs.surrey.ac.uk/766213/1/Routing%20on%20demand.pdf,

http://epubs.surrey.ac.uk/766213,

https://core.ac.uk/display/16518162,

https://link.springer.com/chapter/10.1007%2F978-3-642-30045-5_18,

https://dblp.uni-trier.de/db/conf/networking/networking2012-1.html#ShenLXWZ12,

https://dl.acm.org/citation.cfm?id=2342065,

https://rd.springer.com/chapter/10.1007/978-3-642-30045-5_18,

https://hal.inria.fr/hal-01531129,

https://academic.microsoft.com/#/detail/1887551122