Capacity and security of heterogeneous distributed storage systems

Ernvall, Toni; Rouayheb, Salim El; Hollanti, Camilla; Poor, H. Vincent

doi:10.1109/isit.2013.6620426

Cited by 31 publications

(51 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Combined with a tree-structured regeneration topology, it is shown that RC can further save the network bandwidth [20], [21]. Some studies [16], [22] focus on the capacity bound for a heterogeneous model. However, all the above studies do not distinguish the costs between intra-rack and cross-rack communications in data centers.…”

Section: Related Workmentioning

confidence: 99%

Rack-Aware Regenerating Codes for Data Centers

Hou

Lee

Shum

et al. 2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high, it is critical to design erasure codes that minimize the crossrack repair bandwidth during failure repair. In this paper, we analyze the optimal trade-off between storage redundancy and cross-rack repair bandwidth specifically for data centers, subject to the condition that the original data can be reconstructed from a sufficient number of any non-failed nodes. We characterize the optimal trade-off curve under functional repair, and propose a general family of erasure codes called rack-aware regenerating codes (RRC), which achieve the optimal trade-off. We further propose exact repair constructions of RRC that have minimum storage redundancy and minimum cross-rack repair bandwidth, respectively. We show that (i) the minimum storage redundancy constructions support a wide range of parameters and have crossrack repair bandwidth that is strictly less than that of the classical minimum storage regenerating codes in most cases, and (ii) the minimum cross-rack repair bandwidth constructions support all the parameters and have less cross-rack repair bandwidth than that of the minimum bandwidth regenerating codes for almost all of the parameters.

show abstract

Section: Related Workmentioning

confidence: 99%

Rack-Aware Regenerating Codes for Data Centers

Hou

Lee

Shum

et al. 2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…For a given weighting factor , let ˛ ,ˇ 1 ,ˇ 2 , : : : ,ˇ n be the optimal solution to the minimisation problem stated in (18). Now, we prove that the optimal download amount vectorˇ D ˇ 1 ,ˇ 2 , : : : ,ˇ n must satisfy the constraint in (19).…”

Section: Case B: Homogeneous Storage Amountmentioning

confidence: 89%

Tradeoff between storage cost and repair cost in heterogeneous distributed storage systems

Shum

Sung

2014

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

In distributed storage systems (DSS), the storage costs and download costs with different storage nodes, in general, can be different. In such heterogeneous storage systems, how to establish a fundamental tradeoff between system storage cost and system repair cost is investigated. We formulate the problem of establishing the tradeoff between system storage cost and system repair cost as a bi‐objective linear programming problem subject to the min‐cut constraint of information flow graphs. We give a tight min‐cut bound for heterogeneous DSSs with general setting. Moreover, we show that the tradeoff between system storage cost and system repair cost of some special heterogeneous DSSs can be established in polynomial time. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…The authors in [10] presented the secrecy capacity of a network-coded storage system in which an eavesdropper can observe a fixed number of nodes. In [11], the secrecy capacity was obtained for nodes having different storage capacities and different repair bandwidths. A coding scheme that achieves the upper bounds on secrecy capacity was proposed in [13].…”

Section: A Node Eavesdropping Problemmentioning

confidence: 99%

Eavesdropping Prevention for Network Coding Encrypted Cloud Storage Systems

Chen

Wang

Liao

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Network coding is an important cloud storage technique, which can recover data with small repair bandwidth and high reliability compared to the existing erasure coding and replication methods. However, regardless of which data recovery technique is used, the repaired data in a geographically distributed cloud storage system are easy to be eavesdropped at the transmission link between the local datacenter and its remote backup site. This kind of network security issue is called link eavesdropping in this paper. For a network coded cloud storage system, we propose a systematic design methodology to determine the important data recovery system parameters for any specified security level. Through analysis, we present the performance curves to relate the remote repair bandwidth and the number of coded data fragments. Consequently, all the important system parameters of a network coded data recovery system, including the number of storage nodes and the link capacity between the datacenter and the backup site, can be precisely designed for satisfying different security level requirements.

show abstract

Capacity and security of heterogeneous distributed storage systems

Cited by 31 publications

References 25 publications

Rack-Aware Regenerating Codes for Data Centers

Rack-Aware Regenerating Codes for Data Centers

Tradeoff between storage cost and repair cost in heterogeneous distributed storage systems

Eavesdropping Prevention for Network Coding Encrypted Cloud Storage Systems

Contact Info

Product

Resources

About