Decentralized Coded Caching Scheme With Heterogeneous File Sizes

被引:16
|
作者
Zheng, Lei [1 ,2 ]
Chen, Qingchun [3 ]
Yan, Qifa [4 ]
Tang, Xiaohu [5 ]
机构
[1] Southwest Jiaotong Univ, Chengdu 611756, Peoples R China
[2] Guangzhou Univ, Guangzhou 510006, Peoples R China
[3] Guangzhou Univ, Dept Elect & Commun Engn, Guangzhou 510006, Peoples R China
[4] Telecom ParisTech, Lab Traitement & Commun Informat, F-75013 Paris, France
[5] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 611756, Peoples R China
基金
中国国家自然科学基金;
关键词
Decentralized coded caching; heterogeneous file sizes; file partitioning and grouping; placement design; CONTENT DELIVERY; DESIGN;
D O I
10.1109/TVT.2019.2949979
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Coded caching is an effective technique to reduce peak network traffic load by exploiting coded multicasting opportunities among users with all possible requests. However, most existing works on coded caching design assume identical file sizes. In this paper, to fully exploit the coded multicasting opportunities in decentralized coded caching system with heterogenous file sizes, a file partitioning and grouping (FPG) scheme is proposed. In the FPG scheme, every file is divided into multiple subfiles, so that the subfiles of the same size from different files can be grouped into subfile groups. Based on the proposed FPG scheme, we formulate a placement optimized design problem to minimize the worst-case transmission load, in which we address how to allocate the limited cache sizes at users to different subfile groups. The optimal placement is found to be dependent on all file sizes and the cache size, as well as the number of subfile groups. The numerical results show that, the FPG scheme outperforms the existing decentralized coded caching schemes in the literature. Moreover, it can even approach the performance of the optimized centralized coded caching scheme when the number of files is smaller than the number of users.
引用
收藏
页码:818 / 827
页数:10
相关论文
共 50 条
  • [21] Coded Caching With File and Demand Privacy
    Qi, Chao
    Ravi, Jithin
    IEEE COMMUNICATIONS LETTERS, 2022, 26 (09) : 1979 - 1983
  • [22] Coded Caching with Multiple File Requests
    Wei, Yi-Peng
    Ulukus, Sennur
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 437 - 442
  • [23] Novel Decentralized Coded Caching through Coded Prefetching
    Wei, Yi-Peng
    Ulukus, Sennur
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 1 - 5
  • [24] Decentralized Coded Caching for Shared Caches
    Dutta, Monolina
    Thomas, Anoop
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (05) : 1458 - 1462
  • [25] Decentralized Coded Caching For Interference Networks
    Garg, Navneet
    Sellathurai, Mathini
    Ratnarajah, Tharmalingam
    2020 54TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2020, : 1046 - 1050
  • [26] Erasure Coding for Decentralized Coded Caching
    Reisizadeh, Hadi
    Maddah-Ali, Mohammad Ali
    Mohajer, Soheil
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1715 - 1719
  • [27] Optimization of Heterogeneous Coded Caching
    Daniel, Alexander Michael
    Yu, Wei
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (03) : 1893 - 1919
  • [28] A novel coded caching scheme with coded prefetching
    Gomez-Vilardebo, Jesus
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2082 - 2086
  • [29] On the Greedy Coded Caching Scheme
    Yan, Qifa
    Tang, Xiaohu
    Chen, Qingchun
    2016 8TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS & SIGNAL PROCESSING (WCSP), 2016,
  • [30] Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
    Cao, Daming
    Zhang, Deyao
    Chen, Pengyao
    Liu, Nan
    Kang, Wei
    Gunduz, Deniz
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1545 - 1549