Online Electricity Cost Saving Algorithms for Co-Location Data Centers

This work studies the online electricity cost minimization problem at a co-location data center, which serves multiple tenants who rent the physical infrastructure within the data center to run their respective cloud computing services. The co-location operator has no direct control over power consumption of its tenants, and an efficient mechanism is desired for eliciting desirable consumption patterns from the tenants. Electricity billing faced by a data center is nowadays based on both the total volume consumed and the peak consumption rate. This leads to an interesting new combinatorial optimization structure on the electricity cost optimization problem, which also exhibits an online nature due to the definition of peak consumption. We model and solve the problem through two approaches: the pricing approach and the auction approach, and design online algorithms with small competitive ratios.

[1]  Chaitanya Swamy,et al.  Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Yossi Azar,et al.  Online Mixed Packing and Covering , 2012, SODA.

[3]  David B. Shmoys,et al.  Primal-dual schema for capacitated covering problems , 2015, Math. Program..

[4]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[5]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[6]  Lachlan L. H. Andrew,et al.  Dynamic Right-Sizing for Power-Proportional Data Centers , 2011, IEEE/ACM Transactions on Networking.

[7]  Wolf-Dietrich Weber,et al.  Power provisioning for a warehouse-sized computer , 2007, ISCA '07.

[8]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[9]  Anand Sivasubramaniam,et al.  Data Center Cost Optimization Via Workload Modulation Under Real-World Electricity Pricing , 2013, ArXiv.

[10]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[11]  Robert D. Carr,et al.  Randomized metarounding , 2002, Random Struct. Algorithms.

[12]  Shaolei Ren,et al.  A truthful incentive mechanism for emergency demand response in colocation data centers , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[13]  Baochun Li,et al.  Temperature Aware Workload Managementin Geo-Distributed Data Centers , 2013, IEEE Trans. Parallel Distributed Syst..

[14]  Amar Phanishayee,et al.  Safe and effective fine-grained TCP retransmissions for datacenter communication , 2009, SIGCOMM '09.

[15]  Navendu Jain,et al.  Managing cost, performance, and reliability tradeoffs for energy-aware server provisioning , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Adam Wierman,et al.  Data center demand response: avoiding the coincident peak via workload shifting and local generation , 2013, SIGMETRICS '13.

[17]  Bruce M. Maggs,et al.  Cutting the electric bill for internet-scale systems , 2009, SIGCOMM '09.

[18]  Baochun Li,et al.  Reducing electricity demand charge for data centers with partial execution , 2013, e-Energy.

[19]  Hamed Mohsenian Rad,et al.  Exploring smart grid and data center interactions for electric power load balancing , 2014, PERV.

[20]  Adam Wierman,et al.  Pricing data center demand response , 2014, SIGMETRICS '14.

[21]  Amotz Bar-Noy,et al.  Peak Shaving through Resource Buffering , 2009, WAOA.