English

Hierarchical Coding for Cloud Storage: Topology-Adaptivity, Scalability, and Flexibility

Information Theory 2020-09-22 v1 math.IT

Abstract

In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data storage systems are required to be scalable, flexible, and heterogeneous. The recent rise of the blockchain technology is also moving various information systems towards decentralization to achieve high privacy at low costs. While codes with hierarchical locality have been intensively studied in the context of centralized cloud storage due to their effectiveness in reducing the average reading time, those for decentralized storage networks (DSNs) have not yet been discussed. In this paper, we propose a joint coding scheme where each node receives extra protection through the cooperation with nodes in its neighborhood in a heterogeneous DSN with any given topology. This work extends and subsumes our prior work on coding for centralized cloud storage. In particular, our proposed construction not only preserves desirable properties such as scalability and flexibility, which are critical in dynamic networks, but also adapts to arbitrary topologies, a property that is essential in DSNs but has been overlooked in existing works.

Keywords

Cite

@article{arxiv.2009.09146,
  title  = {Hierarchical Coding for Cloud Storage: Topology-Adaptivity, Scalability, and Flexibility},
  author = {Siyi Yang and Ahmed Hareedy and Robert Calderbank and Lara Dolecek},
  journal= {arXiv preprint arXiv:2009.09146},
  year   = {2020}
}

Comments

25 pages (single column), 19 figures, submitted to the IEEE Transactions on Information Theory (TIT)

R2 v1 2026-06-23T18:39:28.648Z