Coded caching with nonuniform demands

Coded caching with nonuniform demands

We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files in the database, the goal is to optimally populate the caches such as to minimize the expected load of the shared link....

Full description

Saved in:
Bibliographic Details
Published in:2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) pp. 221 - 226
Main Authors: Niesen, Urs, Maddah-Ali, Mohammad Ali
Format: Conference Proceeding
Language:English
Published: IEEE 01-04-2014
Subjects:
Approximation algorithms
Cache memory
Conferences
Encoding
Memory management
Multicast communication
Servers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files in the database, the goal is to optimally populate the caches such as to minimize the expected load of the shared link. For a single user, it is well known that caching the most popular files is optimal in this setting. However we show here that this is no longer the case for multiple users. Indeed, caching only the most popular files can be highly suboptimal. Instead, a fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link. We propose such a coded caching scheme and prove that it is close to optimal.
DOI:10.1109/INFCOMW.2014.6849235