Dynamic Allocation of Replication and Erasure Codes for Improving Storage Efficiency in Object Storage System

초록

Object storage is spotlighted technology because it provides suitable architecture for unstructured data and effectively manage large amount of data such as medical records [1]. It employs replication technic for data protection which protecting from devices, servers failures. But, the replication approach uses two replicas from original data. Thus the storage efficiency would be decreased by replicas. On the other hand, erasure codes can achieve equivalent level of data protection but use less storage redundancy than replication [2]. But since parity fragments must be generated, it could leads to performance problems [3]. These approaches have different characteristics depending on access frequency and object size. We proposed the dynamic allocation of replication and erasure codes approach (DARE) which dynamically allocates redundancy technics to objects for improving storage efficiency without performance degradation.