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 条
  • [41] New Construction of Coded Caching Scheme
    Wang, Fei
    2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, MODELLING, AND INTELLIGENT COMPUTING (CAMMIC 2022), 2022, 12259
  • [42] A Generalized Grouping Scheme in Coded Caching
    Cheng, Minquan
    Jiang, Jing
    Wang, Qiang
    Yao, Youzhi
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (05) : 3422 - 3430
  • [43] An Efficient Delivery Scheme for Coded Caching
    Ramakrishnan, Abinesh
    Westphal, Cedric
    Markopoulou, Athina
    2015 27TH INTERNATIONAL TELETRAFFIC CONGRESS ITC 27, 2015, : 46 - 54
  • [44] A hybrid file-caching scheme for distributed file access
    Yang, CZ
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 362 - 368
  • [45] A novel centralized coded caching scheme for edge caching basestation
    Cheng, Minquan
    Liu, Longsong
    Wang, Jinyu
    Deng, Qingyong
    JOURNAL OF SYSTEMS ARCHITECTURE, 2022, 128
  • [46] Decentralized Asynchronous Coded Caching in Fog-RAN
    Huang, Wenlong
    Jiang, Yanxiang
    Bennis, Mehdi
    Zheng, Fu-Chun
    Gacanin, Harts
    You, Xiaohu
    2018 IEEE 88TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-FALL), 2018,
  • [47] Decentralized Caching and Coded Delivery With Distinct Cache Capacities
    Amiri, Mohammad Mohammadi
    Yang, Qianqian
    Gunduz, Deniz
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (11) : 4657 - 4669
  • [48] Coded Caching with Optimized Shared-Cache Sizes
    Parrinello, Emanuele
    Elia, Petros
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 339 - 343
  • [49] Coded Prefetching and Efficient Delivery in Decentralized Caching Systems
    Zhang, Kai
    Tian, Chao
    Li, Husheng
    2017 IEEE 18TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2017,
  • [50] Decentralized Multisubsystem Weighted Interference Cancellation With Coded Caching
    Bao, Jianrong
    Wang, Pu
    Liu, Chao
    Wu, Jun
    Jiang, Bin
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (02) : 3175 - 3189