Routing for Energy Minimization in the Speed Scaling Model

Abstract

Abstract-We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the power consumption of telecommunication networks by matching the consumption of each network element to the amount of processing required for its carried traffic. Most existing research on speed scaling focuses on a single network element in isolation. We aim for a network-wide optimization.Specifically, we study a routing problem with the objective of provisioning guaranteed speed/bandwidth for a given demand matrix while minimizing energy consumption. Optimizing the routes critically relies on the characteristic of the energy curve f (s), which is how energy is consumed as a function of the processing speed s. If f is superadditive, we show that there is no bounded approximation in general for integral routing, i.e., each traffic demand follows a single path. This contrasts with the well-known logarithmic approximation for subadditive functions. However, for common energy curves such as polynomials f (s) = µs α , we are able to show a constant approximation via a simple scheme of randomized rounding.The scenario is quite different when a non-zero startup cost σ

The Green Project of Data Management for Industrial Integration

“…What is widely discussed is the optimization in multiple constraint conditions. Linear and heuristic algorithm offer the answer [16][17][18]. According to load and energy consumption, Dou Hui suggested the optimization strategy [19].…”

Towards Energy-aware Web Service Composition

“…In the non-compute intense activities, the user can reduce the energy consumption by lowering the clock frequency [6]; the researchers also put forward a heterogeneous multi-core architecture of single instruction [7], which can be a mechanism of lowering the energy consumption of processors. In the aspect of system and software, literature [8] tells us the energy-aware design in hard real-time system; when users attempt to minimize the energy consumption in network optimization, they can try the method of studying the routing problem [9]; literature [10] talks about the measurement problem of single Web service energy consumption. In the aspect of modelling and management, the DVS(Dynamic Voltage Supply) method has been proposed [11], which is used to lower the usage frequency of servers through the mechanism of adjusting voltage dynamically; an adaptive framework based on service application is also put forward [12], which can reduce energy consumption from the perspective of workload observation.…”

Identifying and using energy-critical paths

“…Andrews et al [8] formally prove that the problem of energy minimization does not have a bounded approximation in general, but on the positive side, they present a constant approximation under the assumption that the energy curve is a polynomial.…”