587 citations · 2.1k across the 58 of their papers we have counts for
13 papers · 1 filter
Information-theoretically Secure Erasure Codes for Distributed Storage
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran +1
Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the secur…
Fundamental Limits on Communication for Oblivious Updates in Storage Networks
Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi
In distributed storage systems, storage nodes intermittently go offline for numerous reasons. On coming back online, nodes need to update their contents to reflect any modification…
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran
We present a new 'piggybacking' framework for designing distributed storage codes that are efficient in data-read and download required during node-repair. We illustrate the power…
On Minimizing Data-read and Download for Storage-Node Recovery
Nihar B. Shah
We consider the problem of efficient recovery of the data stored in any individual node of a distributed storage system, from the rest of the nodes. Applications include handling f…
The MDS Queue: Analysing the Latency Performance of Erasure Codes
Nihar B. Shah, Kangwook Lee, Kannan Ramchandran
In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes,…
Regenerating Codes for Errors and Erasures in Distributed Storage
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran +1
Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address th…