We consider a wireless device-to-device (D2D) network where communication is restricted
to be single-hop. Users make arbitrary requests from a finite library of files and have pre …

We consider the canonical shared link caching network formed by a source node, hosting a
library of m information messages (files), connected via a noiseless multicast link to n user …

Caching is an efficient way to reduce network traffic congestion during peak hours, by
storing some content at the user's local cache memory, even without knowledge of user's …

Caching is an effective way to reduce peak-hour network traffic congestion by storing some
contents at user's local cache. Maddah-Ali and Niesen (MAN) initiated a fundamental study …

This work identifies the fundamental limits of multi-access coded caching (MACC) where
each user is connected to multiple caches in a manner that follows a generalized …

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 …

Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

We consider a cache-aided wireless device-to-device (D2D) network of the type introduced
by Ji et al., where the placement phase is orchestrated by a central server. We assume that …

This paper considers a cache-aided device-to-device (D2D) system where the users are
equipped with cache memories of different size. During low traffic hours, a server places …

In cache-aided networks, the server populates the cache memories at the users during low-
traffic periods in order to reduce the delivery load during peak-traffic hours. In turn, there …