Coding for Caching: Fundamental Limits and Practical Challenges

被引:67
作者
Maddah-Ali, Mohammad Ali [1 ]
Niesen, Urs [2 ]
机构
[1] Nokia Bell Labs, Holmdel, NJ 07733 USA
[2] Qualcomm New Jersey Res Ctr, Bridgewater, NJ USA
关键词
Cache memory;
D O I
10.1109/MCOM.2016.7537173
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Caching is an essential technique to improve throughput and latency in a vast variety of applications. The core idea is to duplicate content in memories distributed across the network, which can then be exploited to deliver requested content with less congestion and delay. The traditional role of cache memories is to deliver the maximal amount of requested content locally rather than from a remote server. While this approach is optimal for single-cache systems, it has recently been shown to be significantly suboptimal for systems with multiple caches (i.e., cache networks). Instead, cache memories should be used to enable a coded multicasting gain. In this article, we survey these recent developments. We discuss both the fundamental performance limits of cache networks and the practical challenges that need to be overcome in real-life scenarios.
引用
收藏
页码:23 / 29
页数:7
相关论文
共 15 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]   Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients [J].
Birk, Yitzhak ;
Kol, Tomer .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2825-2830
[3]  
Golrezaei N, 2012, IEEE INFOCOM SER, P1107, DOI 10.1109/INFCOM.2012.6195469
[4]   Fundamental Limits of Caching in Wireless D2D Networks [J].
Ji, Mingyue ;
Caire, Giuseppe ;
Molisch, Andreas F. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (02) :849-869
[5]  
Ji MY, 2014, 2014 11TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATIONS SYSTEMS (ISWCS), P922, DOI 10.1109/ISWCS.2014.6933485
[6]  
Karamchandani N, 2014, IEEE INT SYMP INFO, P2142, DOI 10.1109/ISIT.2014.6875212
[7]  
Maddah-Ali MA, 2015, IEEE INT SYMP INFO, P809, DOI 10.1109/ISIT.2015.7282567
[8]   Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff [J].
Maddah-Ali, Mohammad Ali ;
Niesen, Urs .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (04) :1029-1040
[9]   Fundamental Limits of Caching [J].
Maddah-Ali, Mohammad Ali ;
Niesen, Urs .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) :2856-2867
[10]  
Naderializadeh N., 2016, P IEEE ISIT JUL