Fundamental limits of caching: Improved bounds for users with small buffers

Zhi Chen, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

48 Citations (Scopus)


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
Issue number17
Publication statusPublished - 24 Nov 2016
Externally publishedYes


ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this