English
Related papers

Related papers: Correlation-Aware Distributed Caching and Coded De…

200 papers

Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size.…

Information Theory · Computer Science 2018-06-14 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

The combination of edge caching and coded multicasting is a promising approach to improve the efficiency of content delivery over cache-aided networks. The global caching gain resulting from content overlap distributed across the network in…

Information Theory · Computer Science 2016-11-17 Parisa Hassanzadeh , Antonia Tulino , Jaime Llorca , Elza Erkip

Coded caching and delivery is studied taking into account the correlations among the contents in the library. Correlations are modeled as common parts shared by multiple contents; that is, each file in the database is composed of a group of…

Information Theory · Computer Science 2017-11-13 Qianqian Yang , Deniz Gündüz

Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast…

Information Theory · Computer Science 2018-05-02 Milad Mahdian , N. Prakash , Muriel Médard , Edmund Yeh

The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and…

Information Theory · Computer Science 2017-12-06 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested…

Information Theory · Computer Science 2015-09-08 Mohammad Ali Maddah-Ali , Urs Niesen

Future Internet usage will be dominated by the consumption of a rich variety of online multimedia services accessed from an exponentially growing number of multimedia capable mobile devices. As such, future Internet designs will be…

Information Theory · Computer Science 2016-11-17 Angela Sara Cacciapuoti , Marcello Caleffi , Mingyue Ji , Jaime Llorca , Antonia Maria Tulino

This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of…

Information Theory · Computer Science 2018-06-20 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

Content delivery networks store information distributed across multiple servers, so as to balance the load and avoid unrecoverable losses in case of node or disk failures. Coded caching has been shown to be a useful technique which can…

Information Theory · Computer Science 2016-11-22 Tianqiong Luo , Vaneet Aggarwal , Borja Peleato

Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in modern content centric wireless networks by leveraging network load-balancing in the form of localized content storage and delivery.…

Information Theory · Computer Science 2016-06-15 Avik Sengupta , Ravi Tandon

The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple…

Information Theory · Computer Science 2015-11-25 Mingyue Ji , Antonia Tulino , Jaime Llorca , Giuseppe Caire

This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$,…

Information Theory · Computer Science 2021-06-15 Kai Wan , Daniela Tuninetti , Mingyue Ji , Giuseppe Caire

This paper addresses the problem of exponentially increasing sub-packetization with the number of users in a centralized coded caching system by introducing a new coded caching scheme inspired by the symmetric neighboring consecutive side…

Information Theory · Computer Science 2020-09-24 Anjana A. Mahesh , B. Sundar Rajan

Caching at the wireless edge can be used to keep up with the increasing demand for high-definition wireless video streaming. By prefetching popular content into memory at wireless access points or end-user devices, requests can be served…

Information Theory · Computer Science 2019-12-03 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

Cache-aided content delivery is studied in a multi-server system with $P$ servers and $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ out of $P$ servers. Thanks to the…

Information Theory · Computer Science 2020-03-12 Nitish Mital , Deniz Gunduz , Cong Ling

The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through…

Networking and Internet Architecture · Computer Science 2015-04-08 Wei Huang , Sinong Wang , Lianghui Ding , Feng Yang , Wenjun Zhang

Coded caching is a promising technique to create coded multicast opportunities for cache-aided networks. By splitting each file into $F$ equal packets (i.e., the subpacketization level $F$) and letting each user cache a set of packets, the…

Information Theory · Computer Science 2025-10-28 Minquan Cheng , Yifei Huang , Youlong Wu , Jinyan Wang

Cache-aided content delivery is studied in a multi-server system with $P$ servers and $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ out of $P$ servers. Thanks to the…

Information Theory · Computer Science 2018-04-16 Nitish Mital , Deniz Gunduz , Cong Ling

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 exists a fundamental trade-off between the delivery…

Information Theory · Computer Science 2019-03-15 Abdelrahman M. Ibrahim , Ahmed A. Zewail , Aylin Yener

Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen…

Information Theory · Computer Science 2022-03-18 Kai Wan , Minquan Cheng , Mari Kobayashi , Giuseppe Caire
‹ Prev 1 2 3 10 Next ›