On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes

Gupta, Shreya; Devi, Bh. Rekha; Lalitha, V.

doi:10.1109/jsait.2022.3182365

Cited by 6 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constructions with nonuniform download are considered when the transmission cost from different helpers to the failed node is not the same, giving rise to heterogeneous regenerating codes. Different versions of such systems include models with two subsets of nodes assigned different communication costs [1], systems with different link capacities [35], rack-aware storage [5], [6], [12], [13], [32], [33], general models of clustered systems [25], [31], systems with varying amounts of data downloaded from the helper nodes [34], [16], and general systems with topology-aware repair [36].…”

Section: A Heterogeneous and Graph-constrained Storage Systemsmentioning

confidence: 99%

Regenerating codes on graphs

Patra

Barg

2021

2021 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the graph for the purpose of recovering the lost data. Compared to the standard setting, regenerating codes on graphs address two additional features. The repair information is moved across the network, and the cost of node repair is determined by the graphical distance from the helper nodes to the failed node. Accordingly, the helpers far away from the failed node may be expected to contribute less data for repair than the nodes in the neighborhood of that node. We analyze regenerating codes with nonuniform download for repair on graphs. Moreover, in the process of repair, the information moved from the helpers to the failed node may be combined through intermediate processing, reducing the repair bandwidth. We derive lower bounds for communication complexity of node repair on graphs, including repair schemes with nonuniform download and intermediate processing, and construct codes that attain these bounds.Additionally, some of the nodes may act as adversaries, introducing errors into the data moved in the network. For repair on graphs in the presence of adversarial nodes, we construct codes that support node repair and error correction in systematic nodes.

show abstract

Section: A Heterogeneous and Graph-constrained Storage Systemsmentioning

confidence: 99%

Regenerating codes on graphs

Patra

Barg

2021

2021 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…On the other hand, we defined the cost notion more formally and assumed capacityconstrained communication channels. A later work [7] addressed the cooperative scenario for rack-aware regeneration in a limited context where cooperation is allowed only among nodes of different racks. Moreover, no BS or a back-up server is utilized in such a setting.…”

Section: Introductionmentioning

confidence: 99%

Base Station-Assisted Cooperative Network Coding for Cellular Systems with Link Constraints

Arslan

Pourmandi²,

Haytaoğlu

2022

2022 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

We consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers 1 . Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities between the nodes of the cellular system and the base stations are also constrained. Under such a setting, we formulate the fundamental trade-off with closed form expressions between repair bandwidth cost and the storage space per node. Particularly, the minimum storage as well as bandwidth cost points are formulated. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a special set of system parameters.

show abstract