Online algorithms for geographical load balancing

  • Authors:
  • Minghong Lin;Zhenhua Liu;Adam Wierman;Lachlan L. H. Andrew

  • Affiliations:
  • California Institute of Technology, USA;California Institute of Technology, USA;California Institute of Technology, USA;Swinburne University of Technology, Australia

  • Venue:
  • IGCC '12 Proceedings of the 2012 International Green Computing Conference (IGCC)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has recently been proposed that Internet energy costs, both monetary and environmental, can be reduced by exploiting temporal variations and shifting processing to data centers located in regions where energy currently has low cost. Lightly loaded data centers can then turn off surplus servers. This paper studies online algorithms for determining the number of servers to leave on in each data center, and then uses these algorithms to study the environmental potential of geographical load balancing (GLB). A commonly suggested algorithm for this setting is “receding horizon control” (RHC), which computes the provisioning for the current time by optimizing over a window of predicted future loads. We show that RHC performs well in a homogeneous setting, in which all servers can serve all jobs equally well; however, we also prove that differences in propagation delays, servers, and electricity prices can cause RHC perform badly, So, we introduce variants of RHC that are guaranteed to perform as well in the face of such heterogeneity. These algorithms are then used to study the feasibility of powering a continent-wide set of data centers mostly by renewable sources, and to understand what portfolio of renewable energy is most effective.