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
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
Univ Saskatchewan, Canada.
2020 (English)In: 2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), IEEE , 2020, p. 145-153Conference paper, Published paper (Refereed)
Abstract [en]

By caching content at geographically distributed servers, content delivery applications can achieve scalability and reduce wide-area network traffic. However, each deployed cache has an associated cost. As the request rate from a region varies (e.g., according to a daily cycle), there may be periods when the request rate is high enough to justify this cost, and other periods when it is not. Cloud computing offers a solution to problems of this kind, by supporting the 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. Using these models, 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.

Place, publisher, year, edition, pages
IEEE , 2020. p. 145-153
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-173879ISI: 000619498400017ISBN: 978-3-903176-28-7 (electronic)OAI: oai:DiVA.org:liu-173879DiVA, id: diva2:1535624
Conference
19th IFIP Networking Conference (Networking), ELECTR NETWORK, jun 22-25, 2020
Note

Funding Agencies|Swedish Research Council (VR)Swedish Research Council; Natural Sciences and Engineering Research Council (NSERC) of CanadaNatural Sciences and Engineering Research Council of Canada (NSERC)

Available from: 2021-03-09 Created: 2021-03-09 Last updated: 2021-04-26

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Carlsson, Niklas
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 12 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