Abstract:
In distributed storage systems, storage nodes are organized in racks in which the cross-rack communication cost is much more expensive than the intra-rack communication c...View moreMetadata
Abstract:
In distributed storage systems, storage nodes are organized in racks in which the cross-rack communication cost is much more expensive than the intra-rack communication cost. It is critical to design erasure codes that minimize the cross-rack update bandwidth which is defined as the total amount of symbols transferred across different racks during an update process. In this paper, we analyze the cross-rack update bandwidth of erasure codes for distributed storage systems. We derive a lower bound on the cross-rack update bandwidth and show that the proposed lower bound is achievable under certain parameters.
Date of Conference: 04-08 December 2023
Date Added to IEEE Xplore: 26 February 2024
ISBN Information: