Fundamental limits of caching

Improved bounds for users with small buffers

Zhi Chen, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

In this study, the caching problem is investigated. Assuming that the users are only equipped with buffer of small sizes, the peak rate of caching problem is investigated in this study. In contrast to recent results in the literature, this study shows that under some specific condition, i.e. if the number of users is no less than the amount of files in the server, a lower peak rate of caching is achievable. Furthermore, this new presented peak rate of caching is demonstrated to coincide with the well-known cut-set bound.

Original languageEnglish
Pages (from-to)2315-2318
Number of pages4
JournalIET Communications
Volume10
Issue number17
DOIs
Publication statusPublished - 24 Nov 2016
Externally publishedYes

Fingerprint

Servers

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Fundamental limits of caching : Improved bounds for users with small buffers. / Chen, Zhi; Fan, Pingyi; Letaief, Khaled.

In: IET Communications, Vol. 10, No. 17, 24.11.2016, p. 2315-2318.

Research output: Contribution to journalArticle

@article{8c65c2a13c214e33b890995c8e76ca27,
title = "Fundamental limits of caching: Improved bounds for users with small buffers",
abstract = "In this study, the caching problem is investigated. Assuming that the users are only equipped with buffer of small sizes, the peak rate of caching problem is investigated in this study. In contrast to recent results in the literature, this study shows that under some specific condition, i.e. if the number of users is no less than the amount of files in the server, a lower peak rate of caching is achievable. Furthermore, this new presented peak rate of caching is demonstrated to coincide with the well-known cut-set bound.",
author = "Zhi Chen and Pingyi Fan and Khaled Letaief",
year = "2016",
month = "11",
day = "24",
doi = "10.1049/iet-com.2015.1205",
language = "English",
volume = "10",
pages = "2315--2318",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "17",

}

TY - JOUR

T1 - Fundamental limits of caching

T2 - Improved bounds for users with small buffers

AU - Chen, Zhi

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2016/11/24

Y1 - 2016/11/24

N2 - In this study, the caching problem is investigated. Assuming that the users are only equipped with buffer of small sizes, the peak rate of caching problem is investigated in this study. In contrast to recent results in the literature, this study shows that under some specific condition, i.e. if the number of users is no less than the amount of files in the server, a lower peak rate of caching is achievable. Furthermore, this new presented peak rate of caching is demonstrated to coincide with the well-known cut-set bound.

AB - In this study, the caching problem is investigated. Assuming that the users are only equipped with buffer of small sizes, the peak rate of caching problem is investigated in this study. In contrast to recent results in the literature, this study shows that under some specific condition, i.e. if the number of users is no less than the amount of files in the server, a lower peak rate of caching is achievable. Furthermore, this new presented peak rate of caching is demonstrated to coincide with the well-known cut-set bound.

UR - http://www.scopus.com/inward/record.url?scp=84996587424&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84996587424&partnerID=8YFLogxK

U2 - 10.1049/iet-com.2015.1205

DO - 10.1049/iet-com.2015.1205

M3 - Article

VL - 10

SP - 2315

EP - 2318

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 17

ER -