56 citations · 189 across the 12 of their papers we have counts for
16 papers
ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage
Nicolas Nicolaou, Viveck Cadambe, N. Prakash +4
Atomicity or strong consistency is one of the fundamental, most intuitive, and hardest to provide primitives in distributed shared memory emulations. To ensure survivability, scala…
Updating Content in Cache-Aided Coded Multicast
Milad Mahdian, N. Prakash, Muriel Médard +1
Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study…
The Storage vs Repair Bandwidth Trade-off for Multiple Failures in Clustered Storage Networks
Vitaly Abdrashitov, N. Prakash, Muriel Médard
We study the trade-off between storage overhead and inter-cluster repair bandwidth in clustered storage systems, while recovering from multiple node failures within a cluster. A cl…
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
Kishori M. Konwar, N. Prakash, Nancy Lynch +1
Motivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read…
The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems
N. Prakash, Vitaly Abdrashitov, Muriel Medard
We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are clusters in tota…
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes
Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan +3
In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set under the exact-repair (…
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems
Kishori M. Konwar, N. Prakash, Erez Kantor +3
Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the tr…
RADON: Repairable Atomic Data Object in Networks
Kishori M. Konwar, N. Prakash, Nancy Lynch +1
Erasure codes offer an efficient way to decrease storage and communication costs while implementing atomic memory service in asynchronous distributed storage systems. In this paper…
Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes
N. Prakash, Muriel Medard
We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linea…
The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case
N. Prakash, M. Nikhil Krishnan
In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the…
Evaluation of Codes with Inherent Double Replication for Hadoop
M. Nikhil Krishnan, N. Prakash, V. Lalitha +5
In this paper, we evaluate the efficacy, in a Hadoop setting, of two coding schemes, both possessing an inherent double replication of data. The two coding schemes belong to the cl…
Codes with Locality for Two Erasures
N. Prakash, V. Lalitha, P. Vijay Kumar
In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean…
Linear Coding Schemes for the Distributed Computation of Subspaces
V. Lalitha, N. Prakash, K. Vinodh +2
Let be a set of statistically dependent sources over the common alphabet , that are linearly independent when considered as functions over the sam…
Explicit MBR All-Symbol Locality Codes
Govinda M. Kamath, Natalia Silberstein, N. Prakash +5
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e.…
Codes with Local Regeneration
Govinda M. Kamath, N. Prakash, V. Lalitha +1
Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situati…
Optimal Linear Codes with a Local-Error-Correction Property
N. Prakash, Govinda M. Kamath, V. Lalitha +1
Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is m…