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
Worst-case bounds and optimized cache on Mth request cache insertion policies under elastic conditions
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
Univ Saskatchewan, Canada.
2018 (Engelska)Ingår i: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 127, s. 70-92Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Cloud services and other shared third-party infrastructures allow individual content providers to easily scale their services based on current resource demands. In this paper, we consider an individual content provider that wants to minimize its delivery costs under the assumptions that the storage and bandwidth resources it requires are elastic, the content provider only pays for the resources that it consumes, and costs are proportional to the resource usage. Within this context, we (i) derive worst-case bounds for the optimal cost and competitive cost ratios of different classes of cache on Mth request cache insertion policies, (ii) derive explicit average cost expressions and bounds under arbitrary inter request distributions, (iii) derive explicit average cost expressions and bounds for short tailed (deterministic, Erlang, and exponential) and heavy-tailed (Pareto) inter-request distributions, and (iv) present numeric and trace-based evaluations that reveal insights into the relative cost performance of the policies. Our results show that a window-based cache on 2nd request policy using a single threshold optimized to minimize worst-case costs provides good average performance across the different distributions and the full parameter ranges of each considered distribution, making it an attractive choice for a wide range of practical conditions where request rates of individual file objects typically are not known and can change quickly. (C) 2018 Elsevier B.V. All rights reserved.

Ort, förlag, år, upplaga, sidor
ELSEVIER SCIENCE BV , 2018. Vol. 127, s. 70-92
Nyckelord [en]
Caching; Worst-case bounds; Optimized insertion policies
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:liu:diva-153700DOI: 10.1016/j.peva.2018.09.006ISI: 000453499000005OAI: oai:DiVA.org:liu-153700DiVA, id: diva2:1276199
Anmärkning

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

Tillgänglig från: 2019-01-07 Skapad: 2019-01-07 Senast uppdaterad: 2019-05-06Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Sök vidare i DiVA

Av författaren/redaktören
Carlsson, Niklas
Av organisationen
Databas och informationsteknikTekniska fakulteten
I samma tidskrift
Performance evaluation (Print)
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 9 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