64 citations · 466 across the 78 of their papers we have counts for
10 papers · 2 filters
On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications
Kai Wan, Daniela Tuninetti, Mingyue Ji +1
Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a…
Tight Information Theoretic Converse Results for some Pliable Index Coding Problems
Tang Liu, Daniela Tuninetti
This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD problem there are messages, users and each u…
The Strongly Asynchronous Massive Access Channel
Sara Shahi, Daniela Tuninetti, Natasha Devroye
This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where different users transmit a randomly selected message among $M_n:=e^{nR…
Fundamental Limits of Decentralized Data Shuffling
Kai Wan, Daniela Tuninetti, Mingyue Ji +2
Data shuffling of training data among different computing nodes (workers) has been identified as a core element to improve the statistical performance of modern large-scale machine…
An Information Theoretic Converse for the "Consecutive Complete--" PICOD Problem
Tang Liu, Daniela Tuninetti
Pliable Index CODing (PICOD) is a variant of the Index Coding (IC) problem in which a user is satisfied whenever it can successfully decode any one message that is not in its side…
On Combination Networks with Cache-aided Relays and Users
Kai Wan, Daniela Tuninetti, Pablo Piantanida +1
Caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the user's cache without knowledge of later demands. Coded caching strategy w…