Premium
Cost‐minimizing online algorithm for internet green data centers on multi‐source energy
Author(s) -
He Huaiwen,
Shen Hong,
Liang Dieyan
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.5044
Subject(s) - lyapunov optimization , computer science , carbon footprint , online algorithm , renewable energy , cloud computing , mathematical optimization , service level agreement , linear programming , distributed computing , algorithm , greenhouse gas , engineering , lyapunov redesign , ecology , lyapunov exponent , mathematics , artificial intelligence , chaotic , electrical engineering , biology , operating system
Summary Huge energy consumption of large‐scale cloud data centers damages environments with excessive carbon emission. More and more data center operators are seeking to reduce carbon footprint via various types of renewable energy. However, the intermittent availability of renewable energy sources makes it quite challenging to cooperate with dynamically arriving workload. Meanwhile, the different natures (eg, price and carbon emission) of multiple energy sources also bring more challenges to achieve an optimal trade‐off among carbon emission, power cost, and service level agreement (SLA). In this paper, we study the problem of reducing the long‐term energy cost for geo‐distributed cloud centers, where multiple sources of renewable energy are considered and SLA requirement and carbon budget are satisfied. To tackle the randomness of workload arrival, varying electricity price, and intermittent supply of renewable energy, we first formulate the cost minimization problem as a constraint stochastic optimization problem. Second, based on Lyapunov optimization technique, we propose an online control algorithm to solve it and provide the rigorous theory analysis to demonstrate its performance. By converting the long‐term optimization problem to a mixed integer linear programming problem in each time slot, we analyze its inherent structure and propose an efficient algorithm to solve it based on Brenner's method. Our proposed algorithm makes online decisions rely only on the current system state and achieve [ O ( 1V ) , O ( V ) ] cost emission trade‐off. Finally, the effectiveness of our algorithm is evaluated by extensive simulations based on real‐world data traces.