NStripeMerge: A Storage Performance Improvement Strategy for Distributed Erasure Coded Cluster

Distributed erasure coding Internet of Things (IoT) clusters can store data and achieve data reliability. This technology achieves high fault tolerance by storing data chunks and parity chunks. However, current storage systems often face the problem of unsatisfactory storage space and bandwidth utilization due to narrow stripes. To address this, we propose the stripe merging algorithm NStripeMerge, which consists of two optimization algorithms: NStripeMerge-C and NStripeMerge-LB. These two algorithms address the minimum merging costs and the load balance problems during wide-stripe generation. We demonstrate that both algorithms can achieve minimum merging costs overhead and the highest node utilization under different conditions. NStripeMerge-C can reduce bandwidth without degrading performance. NStripeMerge-LB, on the other hand, achieves better load balance. Our experiments show that NStripeMerge-C can reduce merging costs by up to 12.4%, while NStripeMerge-LB can increase node utilization by up to 24.2% over a state-of-the-art storage scaling approach. Our proposed solution provides a promising approach for improving stripe merging performance in erasure-coded storage systems.