Nikhil Karamchandani

Nikhil Karamchandani

Auto-generated profile, based on publicly available information

Nikhil Karamchandani

Indian Institute of Technology Bombay

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
NKNikhil Karamchandani
Nikhil Karamchandani
UNUrs Niesen
Urs Niesen
MMMohammad Ali Maddah-Ali
Mohammad Ali Maddah-Ali
SDSuhas N. Diggavi
Suhas N. Diggavi
Caching of popular content during off-peak hours is a strategy to reduce network loads during peak hours. Recent work has shown significant benefits of designing such caching strategies not only to locally deliver the part of the content, but also to provide coded multicasting opportunities even among users with different demands. Exploiting both of these gains was shown to be approximately optimal for caching systems with a single layer of caches. Motivated by practical scenarios, we consider, in this paper, a hierarchical content delivery network with two layers of caches. We propose a new caching scheme that combines two basic approaches. The first approach provides coded multicasting opportunities within each layer; the second approach provides coded multicasting opportunities across multiple layers. By striking the right balance between these two approaches, we show that the proposed scheme achieves the optimal communication rates to within a constant multiplicative and additive gap. We further show that there is no tension between the rates in each of the two layers up to the aforementioned gap. Thus, both the layers can simultaneously operate at approximately the minimum rate.

23 October 2017 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
VRVaishakh Ravindrakumar
Vaishakh Ravindrakumar
PPParthasarathi Panda
Parthasarathi Panda
NKNikhil Karamchandani
Nikhil Karamchandani
VPVinod M. Prabhakaran
Vinod M. Prabhakaran
Recent work by Maddah-Ali and Niesen (2014) introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of private coded caching where we impose the additional constraint that no user learns any information about the contents of the files it did not request from what is stored in its cache and the server transmissions. We propose a feasible scheme for this setting and demonstrate its order-optimality by deriving information-theoretic lower bounds.

16 March 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KRKota Srinivas Reddy
Kota Srinivas Reddy
NKNikhil Karamchandani
Nikhil Karamchandani
We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of N files, K caches with limited memory M, and K users such that each user has access to L consecutive caches with a cyclic wrap-around and requests one file from the central server's catalog. The server assists in file delivery by transmitting a message of size R over a shared error-free link and the goal is to characterize the optimal rate-memory trade-off. This setup was studied previously by Hachem et al., where an achievable rate and an information-theoretic lower bound were derived. However, the multiplicative gap between them was shown to scale linearly with the access degree L and thus order-optimality could not be established. A series of recent works have used a natural mapping of the coded caching problem to the well-known index coding problem to derive tighter characterizations of the optimal rate-memory trade-off under the additional assumption that the caches store uncoded content. We follow a similar strategy for the multi-access framework and provide new bounds for the optimal rate-memory tradeoff R*(M) over all uncoded placement policies. In particular, we derive a new achievable rate for any L ≥ 1 and a new lower bound, which works for any uncoded placement policy and L ≥ K/2. We then establish that the (multiplicative) gap between the new achievable rate and the lower bound is at most 2 independent of all parameters, thus establishing an order-optimal characterization of R*(M) for any L ≥ K/2. This is a significant improvement over the previously known gap result, albeit under the restriction of uncoded placement policies. Finally, we also characterize R*(M) exactly for a few special cases.

9 November 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
KRKota Srinivas Reddy
Kota Srinivas Reddy
NKNikhil Karamchandani
Nikhil Karamchandani
Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed by the union of several symmetric ICPs. We derive upper and lower bounds on the optimal server transmission rate for this class of ICPs and demonstrate that they differ by at most a factor of two. Finally, we apply these results to the multi-access coded caching problem to derive better bounds than the state of the art.

9 February 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
CGChinmay Gurjarpadhye
Chinmay Gurjarpadhye
JRJithin Ravi
Jithin Ravi
SKSneha Kamath
Sneha Kamath
BDBikash Kumar Dey
Bikash Kumar Dey
NKNikhil Karamchandani
Nikhil Karamchandani
We consider the coded caching problem with an additional privacy constraint that a user should not get any information about the demands of the other users. We first show that a demand-private scheme for $N$ files and $K$ users can be obtained from a non-private scheme that serves only a subset of the demands for the $N$ files and $NK$ users problem. We further use this fact to construct a demand-private scheme for $N$ files and $K$ users from a particular known non-private scheme for $N$ files and $NK-K+1$ users. It is then demonstrated that, the memory-rate pair $(M,\min \{N,K\}(1-M/N))$ , which is achievable for non-private schemes with uncoded transmissions, is also achievable under demand privacy. We further propose a scheme that improves on these ideas by removing some redundant transmissions. The memory-rate trade-off achieved using our schemes is shown to be within a multiplicative factor of 3 from the optimal when $K < N$ and of 8 when $N \leq K$ . Finally, we give the exact memory-rate trade-off for demand-private coded caching problems with $N\geq K=2$ .

17 August 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
LCLalhruaizela Chhangte
Lalhruaizela Chhangte
NKNikhil Karamchandani
Nikhil Karamchandani
DMD. Manjunath
D. Manjunath
EVEmanuele Viterbo
Emanuele Viterbo
Caching content close to the end users, e.g., at cellular base stations (BSs), WiFi access points (APs), and end user devices is known to improve efficiency and effectiveness of content delivery. This motivates the development of caching-as-a-service where edge networks and devices provide storage capacity to content providers, and enable them to strategically populate these caches to improve user experience in the targeted network. In this paper, we describe Wi-Cache, a prototype for providing caching-as-a-service at the WiFi edge. Wi-Cache is an SDN (Software Defined Networking) based distributed content caching system at the WiFi edge that uses storage at the APs for caching content. Wi-Cache caches content on wireless APs and delivers them to mobile clients when they are requested. It allows content providers to have fine-grained control over the AP-caches and also execute efficient content placement and delivery algorithms at the WiFi edge using a set of APIs that are provided by Wi-Cache. We also show the effectiveness of the Wi-Cache system using an extensive set of experiments.