面向电耗与网络同步代价优化的数据副本放置研究

在数据中心放置海量数据时,每个数据常有多个副本,服务提供商需要支付巨额电费以运行存储这些数据副本的服务器。同时,为保证多个数据副本的一致性,放置在不同数据中心的副本需要通过数据中心之间的网络进行同步,从而引发高额的网络传输费用。为此,以最小化多副本数据放置代价为目标,建立数据放置问题模型,并提出一种基于数据组和数据中心划分的数据放置算法DDDP。将数据划分为多个数据组,按用户访问数据的延迟要求将数据中心划分成数据中心子集,并将每个数据组中的数据放置到能满足访问延迟要求且能最小化放置代价的数据中心子集中。仿真结果表明,相比NPR算法,DDDP算法能有效降低数据中心存储数据时的放置代价。

Research on Data Copy Placement for Improved Power Consumption and Network Synchronization Cost

When massive data is placed in the data center,each data often has multiple copies,thus costing the service providers a huge amount of electricity fee to run and store the servers of these data copies.At the meantime,in order to ensure their consistency,the copies placed in different data centers need to be synchronized through the network between data centers,which results in high network transmission fee.Therefore,aiming at minimizing the cost of multiple data copy placement,this paper establishes a data placement model and proposes the data placement algorithm DDDP based on data group and data center division.The data is divided into multiple groups,the data center is divided into a subset of data centers according to the requirements of access delay,and the data in each data group is placed into the subset of data centers that can meet the requirements of access delay and minimize the cost of placement.Simulation results show that compared with the NPR algorithm,the DDDP algorithm can effectively reduce the placement cost of data storage in data centers.