liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimized Dynamic Cache Instantiation and Accurate LRU Approximations under Time-varying Request Volume
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-1367-1594
University of Sakatchewan, Canada.
2023 (English)In: IEEE Transactions on Cloud Computing, ISSN 2168-7161, Vol. 11, no 1, p. 779-797Article in journal (Refereed) Published
Abstract [en]

Content-delivery applications can achieve scalability and reduce wide-area network traffic using geographically distributed caches. However, each deployed cache has an associated cost, and under time-varying request rates (e.g., a daily cycle) there may be long periods when the request rate from the local region is not high enough to justify this cost. Cloud computing offers a solution to problems of this kind, by supporting dynamic allocation and release of resources. In this paper, we analyze the potential benefits from dynamically instantiating caches using resources from cloud service providers. We develop novel analytic caching models that accommodate time-varying request rates, transient behavior as a cache fills following instantiation, and selective cache insertion policies. Within the context of a simple cost model, we then develop bounds and compare policies with optimized parameter selections to obtain insights into key cost/performance tradeoffs. We find that dynamic cache instantiation can provide substantial cost reductions, that potential reductions strongly dependent on the object popularity skew, and that selective cache insertion can be even more beneficial in this context than with conventional edge caches. Finally, our contributions also include accurate and easy-to-compute approximations that are shown applicable to LRU caches under time-varying workloads.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2023. Vol. 11, no 1, p. 779-797
Keywords [en]
Costs; Cloud computing; Measurement; Transient analysis; Context modeling; Computational modeling; Analytical models; edge cloud; dynamic cache instantiation; time-varying request volumes; selective cache insertion; request count window
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-188890DOI: 10.1109/tcc.2021.3115959ISI: 000965223500001OAI: oai:DiVA.org:liu-188890DiVA, id: diva2:1700112
Funder
Swedish Research Council
Note

Funding: Swedish Research Council; Natural Sciences and Engineering Research Council (NSERC) of Canada

Available from: 2022-09-29 Created: 2022-09-29 Last updated: 2023-11-11

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Carlsson, Niklas

Search in DiVA

By author/editor
Carlsson, Niklas
By organisation
Database and information techniquesFaculty of Science & Engineering
In the same journal
IEEE Transactions on Cloud Computing
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 35 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf