Power-aware replica placement in tree networks with multiple servers per client
Power-aware replica placement on tree networks. Multiple servers per client. NP-completeness of the problem. Mixed Integer Linear Program (MILP) for the problem with the design of several polynomial time heuristics. Extensive simulations and theoretical approximation show good performance of the heuristics.
replica placement tree network multiple servers power-aware algorithm complexity discrete speeds