We consider a basic cache network, in which a single server is connected to multiple users
via a shared bottleneck link. The server has a database of files (content). Each user has an …

We consider a basic caching system, where a single server with a database of N files (eg,
movies) is connected to a set of K users through a shared bottleneck link. Each user has a …

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 …

An erasure broadcast network is considered with two disjoint sets of receivers: a set of weak
receivers with all-equal erasure probabilities and equal cache sizes and a set of strong …

We illustrate how computer-aided methods can be used to investigate the fundamental limits
of the caching systems, which are significantly different from the conventional analytical …

We consider a cache network, in which a single server is connected to multiple users via a
shared error free link. The server has access to a database with N files of equal length F …

Decentralized proactive caching and coded delivery is studied in a content delivery network,
where each user is equipped with a cache memory, not necessarily of equal capacity …

Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated
with cache memories. Lower and upper bounds are derived on the capacity-memory …

Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of
the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and …

Cache-aided coded content delivery is studied for devices with diverse quality-of-service
requirements, specified by a different average distortion target. The network consists of a …