• Publications
  • Influence
Network Coding for Distributed Storage Systems
TLDR
This paper shows how to optimally generate MDS fragments directly from existing fragments in the system, and introduces a new scheme called regenerating codes which use slightly larger fragments than MDS but have lower overall bandwidth use.
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
TLDR
This work shows that the uncoded optimum file assignment is NP-hard, and develops a greedy strategy that is provably within a factor 2 of the optimum, and provides an efficient algorithm achieving a provably better approximation ratio of 1-1/d d, where d is the maximum number of helpers a user can be connected to.
Compressed Sensing using Generative Models
TLDR
This work shows how to achieve guarantees similar to standard compressed sensing but without employing sparsity at all, and proves that, if G is L-Lipschitz, then roughly O(k log L) random Gaussian measurements suffice for an l2/l2 recovery guarantee.
XORing Elephants: Novel Erasure Codes for Big Data
TLDR
A novel family of erasure codes that are efficiently repairable and offer higher reliability compared to Reed-Solomon codes are presented, which provides higher reliability, which is orders of magnitude higher compared to replication.
FemtoCaching: Wireless video content delivery through distributed caching helpers
TLDR
The theoretical contribution of this paper lies in formalizing the distributed caching problem, showing that this problem is NP-hard, and presenting approximation algorithms that lie within a constant factor of the theoretical optimum.
Gradient Coding: Avoiding Stragglers in Distributed Learning
We propose a novel coding theoretic framework for mitigating stragglers in distributed learning. We show how carefully replicating data blocks and coding across gradients can provide tolerance to
Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution
TLDR
A new architecture based on distributed caching of the content in femtobasestations with small or non-existing backhaul capacity but with considerable storage space, called helper nodes is presented, which allows an improvement in the video throughput without deployment of any additional infrastructure.
A Survey on Network Codes for Distributed Storage
TLDR
An overview of the research results on network coding techniques is provided, establishing that maintenance bandwidth can be reduced by orders of magnitude compared to standard erasure codes.
Network coding for distributed storage systems
TLDR
It is shown that there is a fundamental tradeoff between storage and repair bandwidth which is theoretically characterize using flow arguments on an appropriately constructed graph and regenerating codes are introduced that can achieve any point in this optimal tradeoff.
Locally Repairable Codes
TLDR
This paper explores the repair metric of locality, which corresponds to the number of disk accesses required during a single node repair, and shows the existence of optimal locally repairable codes (LRCs) that achieve this tradeoff.
...
...