liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Caching and optimized request routing in cloud-based content delivery systems
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
University of Saskatchewan, Canada.
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
University of Calgary, Canada.
2014 (Engelska)Ingår i: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 79, s. 38-55Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
Elsevier, 2014. Vol. 79, s. 38-55
Nyckelord [en]
Content delivery, Distributed clouds, Dynamic caching, Request routing optimization, Elastic storage
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-108509DOI: 10.1016/j.peva.2014.07.003ISI: 000342266200004OAI: oai:DiVA.org:liu-108509DiVA, id: diva2:730598
Tillgänglig från: 2014-06-28 Skapad: 2014-06-28 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Carlsson, NiklasGopinathan, Ajay

Sök vidare i DiVA

Av författaren/redaktören
Carlsson, NiklasGopinathan, Ajay
Av organisationen
Databas och informationsteknikTekniska högskolan
I samma tidskrift
Performance evaluation (Print)
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 101 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf