Cache-Aided Interference Channels

被引:0
|
作者
Maddah-Ali, Mohammad Ali [1 ]
Niesen, Urs [2 ]
机构
[1] Alcatel Lucent, Bell Labs, Holmdel, NJ 07733 USA
[2] Qualcomm New Jersey Res Ctr, Bridgewater, NJ USA
关键词
ALIGNMENT; NETWORKS; FREEDOM;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most of the prior literature focuses on the reduction of load in the backhaul and core networks due to caching, i.e., on the benefits caching offers for the wireline communication link between the origin server and the caches. In this paper, we are instead interested in the benefits caching can offer for the wireless communication link between the caches and the end users. To quantify the gains of caching for this wireless link, we consider an interference channel in which each transmitter is equipped with an isolated cache memory. Communication takes place in two phases, a content placement phase followed by a content delivery phase. The objective is to design both the placement and the delivery phases to maximize the rate in the delivery phase in response to any possible user demands. Focusing on the three-user case, we show that through careful joint design of these phases, we can reap three distinct benefits from caching: a load balancing gain, an interference cancellation gain, and an interference alignment gain. In our proposed scheme, load balancing is achieved through a specific file splitting and placement, creating a particular pattern of content overlap at the caches. This overlap allows to implement interference cancellation. Further, it allows us to construct several virtual transmitters, each responsible for a part of the requested content, which increases interference alignment possibilities.
引用
收藏
页码:809 / 813
页数:5
相关论文
共 50 条
  • [31] Cache-Aided Matrix Multiplication Retrieval
    Wan, Kai
    Sun, Hua
    Ji, Mingyue
    Tuninetti, Daniela
    Caire, Giuseppe
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2810 - 2815
  • [32] Cache-Aided K-User Broadcast Channels With State Information at Receivers
    Reisizadeh, Hadi
    Maddah-Ali, Mohammad Ali
    Mohajer, Soheil
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (04) : 2518 - 2537
  • [33] Cache-Aided Two-User Broadcast Channels with State Information at Receivers
    Reisizadeh, Hadi
    Maddah-Ali, Mohammad Ali
    Mohajer, Soheil
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 16 - 20
  • [34] Cache-Aided General Linear Function Retrieval
    Wan, Kai
    Sun, Hua
    Ji, Mingyue
    Tuninetti, Daniela
    Caire, Giuseppe
    ENTROPY, 2021, 23 (01) : 1 - 16
  • [35] Cache-Aided Scalar Linear Function Retrieval
    Wan, Kai
    Sun, Hua
    Ji, Mingyue
    Tuninetti, Daniela
    Caire, Giuseppe
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1717 - 1722
  • [36] Cache-Aided Combination Networks with Secrecy Guarantees
    Zewail, Ahmed A.
    Yener, Aylin
    2018 52ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2018,
  • [37] Practical scheme for MISO Cache-Aided Communication
    Bergel, Itsik
    Mohajer, Soheil
    PROCEEDINGS OF THE 21ST IEEE INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (IEEE SPAWC2020), 2020,
  • [38] MISO Cache-Aided Communication with Reduced Subpacketization
    Mohajer, Soheil
    Bergel, Itsik
    ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
  • [39] Cache-Aided Coded Multicast for Correlated Sources
    Hassanzadeh, P.
    Tulino, A.
    Llorca, J.
    Erkip, E.
    2016 9TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND ITERATIVE INFORMATION PROCESSING (ISTC), 2016, : 360 - 364
  • [40] Cache-aided Multiuser Private Information Retrieval
    Zhang, Xiang
    Wan, Kai
    Sun, Hua
    Ji, Mingyue
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1095 - 1100