%0 Conference Proceedings
%T Minimization of Network Power Consumption with Redundancy Elimination
%+ Algorithms, simulation, combinatorics and optimization for telecommunications (MASCOTTE)
%+ Orange Labs [Sophia Antipolis]
%A Giroire, Frédéric
%A Moulierac, Joanna
%A Phan, Truong Khoa
%A Roudaut, Frédéric
%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 247-258
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_19
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Recently, energy-aware routing has gained increasing popularity in the networking research community. The idea is that traffic demands are aggregated over a subset of the network links, allowing other links to be turned off to save energy. In this paper, we propose GreenRE - a new energy-aware routing model with the support of the new technique of data redundancy elimination (RE). This technique, enabled within the routers, can identify and remove repeated content from network transfers. Hence, capacity of network links are virtually increased and more traffic demands can be aggregated. Based on our real experiments on Orange Labs platform, we show that performing RE consumes some energy. Thus, while preserving connectivity and QoS, it is important to identify at which routers to enable RE and which links to turn off so that the power consumption of the network is minimized. We model the problem as an Integer Linear Program and propose a greedy heuristic algorithm. Simulations on several network topologies show that GreenRE can gain further 30% of energy savings in comparison with the traditional energy-aware routing model.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-00721855/document
%2 https://inria.hal.science/hal-00721855/file/GMP_12.pdf
%L hal-00721855
%U https://inria.hal.science/hal-00721855
%~ UNICE
%~ CNRS
%~ INRIA
%~ INRIA-SOPHIA
%~ I3S
%~ INRIASO
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING
%~ UNIV-COTEDAZUR