Optimal File Placement for Distributed Coded Caching Systems 


Vol. 43,  No. 3, pp. 506-514, Mar.  2018
10.7840/kics.2018.43.3.506


PDF
  Abstract

In this paper, we study the optimal file placement strategy for distributed coded caching systems. By applying practical channels codes, such as fountain codes, we generalize the existing maximum distance separable (MDS) coded caching systems. Considering the decoding failure probability of the channels codes, we define the service failure probability of the systems, and analyze the lower bound of it. Based on the analyzed lower bound, we propose the file placement algorithm that can minimize the service failure probability. The simulation results show that the proposed algorithm can significantly improves the service failure probability of the existing methods, and the performance closely approaches to the lower bound of the systems.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

W. Lee, S. Lim, H. Park, "Optimal File Placement for Distributed Coded Caching Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 3, pp. 506-514, 2018. DOI: 10.7840/kics.2018.43.3.506.

[ACM Style]

Wonseok Lee, Seung-Chan Lim, and Hyuncheol Park. 2018. Optimal File Placement for Distributed Coded Caching Systems. The Journal of Korean Institute of Communications and Information Sciences, 43, 3, (2018), 506-514. DOI: 10.7840/kics.2018.43.3.506.

[KICS Style]

Wonseok Lee, Seung-Chan Lim, Hyuncheol Park, "Optimal File Placement for Distributed Coded Caching Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 3, pp. 506-514, 3. 2018. (https://doi.org/10.7840/kics.2018.43.3.506)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880