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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Caching and optimized request routing in cloud-based content delivery systems
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
University of Saskatchewan, Canada.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
University of Calgary, Canada.
2014 (English)In: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 79, 38-55 p.Article in journal (Refereed) Published
Abstract [en]

Geographically distributed cloud platforms enable an attractive approach to large-scale content delivery. Storage at various sites can be dynamically acquired from (and released back to) the cloud provider so as to support content caching, according to the current demands for the content from the different geographic regions.  When storage is sufficiently expensive that not all content should be cached at all sites, two issues must be addressed: how should requests for content be routed to the cloud provider sites, and what policy should be used for caching content using the elastic storage resources obtained from the cloud provider.  Existing approaches are typically designed for non-elastic storage and little is known about the optimal policies when minimizing the delivery costs for distributed elastic storage.

In this paper, we propose an approach in which elastic storage resources are exploited using a simple dynamic caching policy, while request routing is updated periodically according to the solution of an optimization model.  Use of pull-based dynamic caching, rather than push-based placement, provides robustness to unpredicted changes in request rates.  We show that this robustness is provided at low cost \textendash{} even with fixed request rates, use of the dynamic caching policy typically yields content delivery cost within 10\% of that with the optimal static placement.  We compare request routing according to our optimization model to simpler baseline routing policies, and find that the baseline policies can yield greatly increased delivery cost relative to optimized routing.  Finally, we present a lower-cost approximate solution algorithm for our routing optimization problem that yields content delivery cost within 2.5\% of the optimal solution.

Place, publisher, year, edition, pages
Elsevier, 2014. Vol. 79, 38-55 p.
Keyword [en]
Content delivery, Distributed clouds, Dynamic caching, Request routing optimization, Elastic storage
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-108509DOI: 10.1016/j.peva.2014.07.003ISI: 000342266200004OAI: oai:DiVA.org:liu-108509DiVA: diva2:730598
Available from: 2014-06-28 Created: 2014-06-28 Last updated: 2017-12-13Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Carlsson, NiklasGopinathan, Ajay

Search in DiVA

By author/editor
Carlsson, NiklasGopinathan, Ajay
By organisation
Database and information techniquesThe Institute of Technology
In the same journal
Performance evaluation (Print)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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