Some Variant of Known Coded Caching Schemes With Good Performance

In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2020-03, Vol.68 (3), p.1370-1377
Main Authors: Cheng, Minquan, Jiang, Jing, Tang, Xiaohu, Yan, Qifa
Format: Article
Language:English
Subjects:
Cache storage
Caching
Coded caching scheme
Codes
Combinatorial analysis
Combinatorial mathematics
Complexity theory
packet number
placement delivery array
rate
Telecommunication traffic
Transmission efficiency
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2962028