Capacity of Distributed Storage Systems with Clusters and Separate Nodes

01/10/2019
by   Jingzhao Wang, et al.
0

In distributed storage systems (DSSs), the optimal tradeoff between node storage and repair bandwidth is an important issue for designing distributed coding strategies to ensure large scale data reliability. The capacity of DSSs is obtained as a function of node storage and repair bandwidth parameters, characterizing the tradeoff. There are lots of works on DSSs with clusters (racks) where the repair bandwidths from intra-cluster and cross-cluster are differentiated. However, separate nodes are also prevalent in the realistic DSSs, but the works on DSSs with clusters and separate nodes (CSN-DSSs) are insufficient. In this paper, we formulate the capacity of CSN-DSSs with one separate node for the first time where the bandwidth to repair a separate node is of cross-cluster. Consequently, the optimal tradeoff between node storage and repair bandwidth are derived and compared with cluster DSSs. A regenerating code instance is constructed based on the tradeoff. Furthermore, the influence of adding a separate node is analyzed and formulated theoretically. We prove that when each cluster contains R nodes and any k nodes suffice to recover the original file (MDS property), adding an extra separate node will keep the capacity if R|k, and reduce the capacity otherwise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2018

Storage and Repair Bandwidth Tradeoff for Distributed Storage Systems with Clusters and Separate Nodes

The optimal tradeoff between node storage and repair bandwidth is an imp...
research
02/24/2021

Rack-Aware Cooperative Regenerating Codes

In distributed storage systems, cooperative regenerating codes tradeoff ...
research
08/26/2019

Capacity of dynamical storage systems

We introduce a dynamical model of node repair in distributed storage sys...
research
01/11/2018

New Results on Multilevel Diversity Coding with Secure Regeneration

The problem of multilevel diversity coding with secure regeneration is r...
research
11/03/2020

Multi-level Forwarding and Scheduling Recovery Algorithm in Rapidly-changing Network for Erasure-coded Clusters

A key design goal of erasure-coded clusters is to reduce the repair time...
research
12/09/2017

Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point

The problem of multilevel diversity coding with secure regeneration (MDC...
research
01/06/2018

A Class of MSR Codes for Clustered Distributed Storage

Clustered distributed storage models real data centers where intra- and ...

Please sign up or login with your details

Forgot password? Click here to reset