Age-optimal constrained cache updating

Roy D. Yates, Philippe Ciblat, Aylin Yener, Michele Wigger

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

    98 Scopus citations


    We consider a system where a local cache maintains a collection of N dynamic content items that are randomly requested by local users. A capacity-constrained link to a remote network server limits the ability of the cache to hold the latest version of each item at all times, making it necessary to design an update policy. Using an age of information metric, we show under a relaxed problem formulation that an asymptotically optimal policy updates a cached item in proportion to the square root of the item's popularity. We then show experimentally that a physically realizable policy closely approximates the asymptotic optimal policy.

    Original languageEnglish (US)
    Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Number of pages5
    ISBN (Electronic)9781509040964
    StatePublished - Aug 9 2017
    Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
    Duration: Jun 25 2017Jun 30 2017

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8095


    Other2017 IEEE International Symposium on Information Theory, ISIT 2017

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Information Systems
    • Modeling and Simulation
    • Applied Mathematics


    Dive into the research topics of 'Age-optimal constrained cache updating'. Together they form a unique fingerprint.

    Cite this