Caching with Statistical Request Delay Information

Wei Chen, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


The communication-storage tradeoff, as a key performance metric of the fundamental limits of caching, has attracted considerable recent attention. In this paper, the issue of how much storage cost should be paid for a target effective throughput is investigated in a unified framework. This approach, from a queueing theoretic perspective, adopts Little's law to analyze the average buffer consumption, thereby giving a rate-cost function that relies only on the probability of content request delays. A time sharing policy along with its optimality criterion is further proposed to achieve the optimal storage efficiency. For pushing flows with heterogenous request delay information, a joint cost-rate allocation method is presented to maximize the overall storage efficiency in either a centralized or decentralized manner. Both analytical and numerical results reveal that the storage efficiency of caching is dominated by the demand probability and the maximum request delay.

Original languageEnglish (US)
Title of host publication2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781509050192
StatePublished - Jul 1 2017
Event2017 IEEE Global Communications Conference, GLOBECOM 2017 - Singapore, Singapore
Duration: Dec 4 2017Dec 8 2017

Publication series

Name2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings


Other2017 IEEE Global Communications Conference, GLOBECOM 2017

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Caching with Statistical Request Delay Information'. Together they form a unique fingerprint.

Cite this