Explicit Construction of Minimum Bandwidth Rack-Aware Regenerating Codes

In large data centers, storage nodes are organized in racks, and the cross-rack communication dominates the system bandwidth. We explicitly construct codes for exact repair of single node failures that achieve the optimal tradeoff between the storage redundancy and cross-rack repair bandwidth at the minimum bandwidth point (i.e., the cross-rack bandwidth equals the storage size per node). Moreover, we explore the node repair when only a few number of helper racks are connected. Thus we provide explicit constructions of codes for rack-aware storage with the minimum cross-rack repair bandwidth, lowest possible redundancy, and small repair degree (i.e., the number of helper racks connected for repair).Comment: 4 pages, 1 figure. arXiv admin note: text overlap with arXiv:2101.0873

Global repair bandwidth cost optimization of generalized regenerating codes in clustered distributed storage systems

In clustered distributed storage systems (CDSSs), one of the main design goals is minimizing the transmission cost during the failed storage nodes repairing. Generalized regenerating codes (GRCs) are proposed to balance the intra-cluster repair bandwidth and the inter-cluster repair bandwidth for guaranteeing data availability. The trade-off performance of GRCs illustrates that, it can reduce storage overhead and inter-cluster repair bandwidths simultaneously. However, in practical big data storage scenarios, GRCs cannot give an effective solution to handle the heterogeneity of bandwidth costs among different clusters for node failures recovery. This paper proposes an asymmetric bandwidth allocation strategy (ABAS) of GRCs for the inter-cluster repair in heterogeneous CDSSs. Furthermore, an upper bound of the achievable capacity of ABAS is derived based on the information flow graph (IFG), and the constraints of storage capacity and intra-cluster repair bandwidth are also elaborated. Then, a metric termed global repair bandwidth cost (GRBC), which can be minimized regarding of the inter-cluster repair bandwidths by solving a linear programming problem, is defined. The numerical results demonstrate that, maintaining the same data availability and storage overhead, the proposed ABAS of GRCs can effectively reduce the GRBC compared to the traditional symmetric bandwidth allocation schemes