Rack-Aware Cooperative Regenerating Codes
Abstract
In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack. Hence, the repair bandwidth will only take into account cross-rack transfer. Rack-aware regenerating codes for the case of single node failures have been studied and their repair bandwidth tradeoff characterized. In this paper, we consider the framework of rack-aware cooperative regenerating codes for the case of multiple node failures where the node failures are uniformly distributed among a certain number of racks. We characterize the storage repair-bandwidth tradeoff as well as derive the minimum storage and minimum repair bandwidth points of the tradeoff. We also provide constructions of minimum bandwidth rack-aware cooperative regenerating codes for all parameters.
Keywords
Cite
@article{arxiv.2102.12421,
title = {Rack-Aware Cooperative Regenerating Codes},
author = {Shreya Gupta and V. Lalitha},
journal= {arXiv preprint arXiv:2102.12421},
year = {2021}
}
Comments
5 pages, 1 figure, accepted for publication in ISITA 2020