A Generalized Grouping Scheme in Coded Caching

被引:35
作者
Cheng, Minquan [1 ]
Jiang, Jing [1 ]
Wang, Qiang [2 ]
Yao, Youzhi [1 ]
机构
[1] Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin 541004, Peoples R China
[2] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada
基金
加拿大自然科学与工程研究理事会; 瑞典研究理事会;
关键词
Coded caching scheme; placement delivery array; concatenating construction; rate; packet number; FUNDAMENTAL LIMITS; DELIVERY;
D O I
10.1109/TCOMM.2019.2896960
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Coded caching, which could significantly reduce the maximum amount of transmission rate during the peak traffic times in wireless network, has been widely studied recently. Apart from the transmission rate, sub-packetization F reflecting the implementation complexity, is also concerned in coded caching. The grouping method proposed by Shanmugam et al. is well-known and widely used to reduce the sub-packetization level of the coded caching problem. In this paper, we propose a concatenating construction method for coded caching schemes, which generalizes the grouping method. Moreover, we demonstrate the advantage of our method in reducing the transmission rate over the grouping method. In particular, some new explicit schemes are obtained from previously known schemes. From one of these schemes, we can derive all the results by Tang and Ramamoorthy as special cases. Furthermore, the analysis and comparison of these new schemes are also performed.
引用
收藏
页码:3422 / 3430
页数:9
相关论文
共 22 条
[1]   The use of multicast delivery to provide a scalable and interactive video-on-demand service [J].
Almeroth, KC ;
Ammar, MH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (06) :1110-1122
[2]   APPROXIMATION ALGORITHMS FOR DATA PLACEMENT PROBLEMS [J].
Baev, Ivan ;
Rajaraman, Rajmohan ;
Swamy, Chaitanya .
SIAM JOURNAL ON COMPUTING, 2008, 38 (04) :1411-1429
[3]   Five Disruptive Technology Directions for 5G [J].
Boccardi, Federico ;
Heath, Robert W., Jr. ;
Lozano, Angel ;
Marzetta, Thomas L. ;
Popovski, Petar .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (02) :74-80
[4]   Distributed Caching Algorithms for Content Distribution Networks [J].
Borst, Sem ;
Gupta, Varun ;
Walid, Anwar .
2010 PROCEEDINGS IEEE INFOCOM, 2010,
[5]  
Cheng M., 2016, OPTIMAL PLACEMENT DE
[6]  
Cheng M., 2017, CONSTRUCTIONS CODED
[7]  
Cheng M., 2017, CODED CACHING SCHEME
[8]   Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach [J].
Chong Shangguan ;
Zhang, Yiwei ;
Ge, Gennian .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (08) :5755-5766
[9]   Dynamic batching policies for an on-demand video server [J].
Dan, A ;
Sitaram, D ;
Shahabuddin, P .
MULTIMEDIA SYSTEMS, 1996, 4 (03) :112-121
[10]  
Ghasemi H, 2016, IEEE INT SYMP INFO, P2319, DOI 10.1109/ISIT.2016.7541713