Skip to Main content Skip to Navigation
Journal articles

Power-aware replica placement in tree networks with multiple servers per client

Abstract : In this paper, we revisit the well-studied problem of replica placement in tree networks. Rather than minimizing the number of servers needed to serve all client requests, we aim at minimizing the total power consumed by these servers. In addition, we use the most general (and powerful) server assignment policy, where the requests of a client can be served by multiple servers located in the (unique) path from this client to the root of the tree. We consider multi-modal servers that can operate at a set of discrete speeds, using the dynamic voltage and frequency scaling (DVFS) technique. The optimization problem is to determine an optimal location of the servers in the tree, as well as the speed at which each server is operated. A major result is the NP-completeness of this problem, to be contrasted with the minimization of the number of servers, which has polynomial complexity. Another important contribution is the formulation of a Mixed Integer Linear Program (MILP) for the problem, together with the design of several polynomial-time heuristics. We assess the efficiency of these heuristics by simulation. For mid-size instances (up to 30 nodes in the tree), we evaluate their absolute performance by comparison with the optimal solution (obtained via the MILP). The most efficient heuristics provide satisfactory results, within 20% of the optimal solution.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Thursday, October 16, 2014 - 3:31:10 PM
Last modification on : Friday, September 30, 2022 - 4:12:07 AM
Long-term archiving on: : Saturday, January 17, 2015 - 10:46:08 AM


Files produced by the author(s)



Guillaume Aupy, Anne Benoit, Matthieu Journault, Yves Robert. Power-aware replica placement in tree networks with multiple servers per client. Sustainable Computing : Informatics and Systems, Elsevier, 2015, 5, pp.41-53. ⟨10.1016/j.suscom.2014.08.013⟩. ⟨hal-01059364⟩



Record views


Files downloads