%0 Conference Proceedings
%T Routing On Demand: Toward the Energy-Aware Traffic Engineering with OSPF
%+ Tsinghua National Laboratory for Information Science and Technology
%+ School of Mathematics and Systems Science
%+ Institute for Communication Systems [University of Surrey]
%A Shen, Meng
%A Liu, Hongying
%A Xu, Ke
%A Wang, Ning
%A Zhong, Yifeng
%Z Part 5: IP Routing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 232-246
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_18
%K Traffic Engineering
%K OSPF
%K Energy Saving
%K Routing
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531129/document
%2 https://inria.hal.science/hal-01531129/file/978-3-642-30045-5_18_Chapter.pdf
%L hal-01531129
%U https://inria.hal.science/hal-01531129
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING