Age-optimal constrained cache updating

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

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

    27 Citations (Scopus)

    Abstract

    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.
    Pages141-145
    Number of pages5
    ISBN (Electronic)9781509040964
    DOIs
    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

    Other

    Other2017 IEEE International Symposium on Information Theory, ISIT 2017
    CountryGermany
    CityAachen
    Period6/25/176/30/17

    Fingerprint

    Optimal Policy
    Cache
    Updating
    Servers
    Update
    Asymptotically Optimal
    Square root
    Proportion
    Server
    Metric
    Necessary
    Formulation
    Policy
    Design

    All Science Journal Classification (ASJC) codes

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

    Cite this

    Yates, R. D., Ciblat, P., Yener, A., & Wigger, M. (2017). Age-optimal constrained cache updating. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 141-145). [8006506] (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006506
    Yates, Roy D. ; Ciblat, Philippe ; Yener, Aylin ; Wigger, Michele. / Age-optimal constrained cache updating. 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 141-145 (IEEE International Symposium on Information Theory - Proceedings).
    @inproceedings{7ee7a8bd24d34dca97c2432dd9148fb2,
    title = "Age-optimal constrained cache updating",
    abstract = "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.",
    author = "Yates, {Roy D.} and Philippe Ciblat and Aylin Yener and Michele Wigger",
    year = "2017",
    month = "8",
    day = "9",
    doi = "10.1109/ISIT.2017.8006506",
    language = "English (US)",
    series = "IEEE International Symposium on Information Theory - Proceedings",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    pages = "141--145",
    booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
    address = "United States",

    }

    Yates, RD, Ciblat, P, Yener, A & Wigger, M 2017, Age-optimal constrained cache updating. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006506, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 141-145, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8006506

    Age-optimal constrained cache updating. / Yates, Roy D.; Ciblat, Philippe; Yener, Aylin; Wigger, Michele.

    2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 141-145 8006506 (IEEE International Symposium on Information Theory - Proceedings).

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

    TY - GEN

    T1 - Age-optimal constrained cache updating

    AU - Yates, Roy D.

    AU - Ciblat, Philippe

    AU - Yener, Aylin

    AU - Wigger, Michele

    PY - 2017/8/9

    Y1 - 2017/8/9

    N2 - 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.

    AB - 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.

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

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

    U2 - 10.1109/ISIT.2017.8006506

    DO - 10.1109/ISIT.2017.8006506

    M3 - Conference contribution

    AN - SCOPUS:85034087140

    T3 - IEEE International Symposium on Information Theory - Proceedings

    SP - 141

    EP - 145

    BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Yates RD, Ciblat P, Yener A, Wigger M. Age-optimal constrained cache updating. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 141-145. 8006506. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2017.8006506