885 citations · 3.8k across the 104 of their papers we have counts for
6 papers · 2 filters
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,…
Semi-Definite Programming Relaxation for Non-Line-of-Sight Localization
Venkatesan Ekambaram, Giulia Fanti, Kannan Ramchandran
We consider the problem of estimating the locations of a set of points in a k-dimensional euclidean space given a subset of the pairwise distance measurements between the points. W…
Minimum Cost Multicast with Decentralized Sources
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
In this paper we study the multisource multicast problem where every sink in a given directed acyclic graph is a client and is interested in a common file. We consider the case whe…
Data Exchange Problem with Helpers
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only…
A Compression Algorithm Using Mis-aligned Side-information
Nan Ma, Kannan Ramchandran, David Tse
We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a si…
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…