An Energy-Efficient Storage Strategy for Cloud Datacenters Based on Variable K-Coverage of a Hypergraph

• Published in: IEEE transactions on parallel and distributed systems 2017-12, Vol.28 (12), p.3344-3355
• Main Authors: Ting Yang, Haibo Pen, Wei Li, Dong Yuan, Zomaya, Albert Y.
• Format: Article
• Language: English
• Subjects: Algorithm design and analysis; Algorithms; Availability; Cloud computing; cloud datacenters; data availability; Data centers; Datasets; Distributed databases; Energy conservation; Energy consumption; Energy efficiency; Energy saving; Energy storage; Fault tolerance; Graph theory; Graphs; Heuristic algorithms; hypergraph; minimum <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">K -coverage; Network storage; Nodes; Performance evaluation; Storage systems; Strategy; User requirements
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2017.2723004

Distributed storage systems, e.g., Hadoop Distributed File System (HDFS), have been widely used in datacenters for handling large amounts of data due to their excellent performance in terms of fault tolerance, reliability and scalability. However, these storage systems usually adopt the same replication and storage strategy to guarantee data availability, i.e., creating the same number of replicas for all data sets and randomly storing them across data nodes. Such strategies do not fully consider the difference requirements of data availability on different data sets. More servers than necessary should thus be used to store replicas of rarely-used data, which will lead to increased energy consumption. To address this issue, we propose an energy-efficient storage strategy for cloud datacenters based on a novel hypergraph coverage model. According to users' requirements of data availability in different applications, our proposed algorithm can selectively determine the corresponding minimum hyperedge coverage, which represents the minimum set of data nodes required in the datacenter. Hence, some other data nodes can be turned off for the purpose of energy saving. We have also implemented our proposed algorithm as a dynamic runtime strategy in a HDFS based prototype datacenter for performance evaluation. Experimental results show that the variable hypergraph coverage based strategy can not only reduce energy consumption, but can also improve the network performance in the datacenter.