Dynamic Allocation of Replication and Erasure Codes for Enhancing Storage Efficiency in OpenStack Swift

Abstract

The object storage system introduced data redundancy techniques such as replication and erasure codes to build a reliable system. However, replication method has storage efficiency problem with large and less frequently accessed data types, and erase coding method has performance problem with small and frequently accessed data types. In this paper, we propose a dynamic allocation of replication and erasure coding approach (DARE) to improve storage efficiency and performance using access frequency and object size factors. Experimental results show that the proposed DARE can improve storage efficiency by 21 percent compared to the traditional resilient system