nach oben

Erschienen in:

2016 | OriginalPaper | Buchkapitel

Modeling and Performance Comparison of Caching Strategies for Popular Contents in Internet

verfasst von : Natalia M. Markovich, Vladimir Khrenov, Udo R. Krieger

Erschienen in: Distributed Computer and Communication Networks

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The paper is devoted to caching of popular multimedia and Web contents in Internet. We study the Cluster Caching Rule (CCR) recently proposed by the authors. It is based on the idea to store only popular contents arising in clusters of related popularity processes. Such clusters defined as consecutive exceedances of popularity indices over a high threshold are caused by dependence in the inter-request times of the objects and, hence, their related popularity processes. We compare CCR with the well-known Time-To-Live (TTL) and Least-Recently-Used (LRU) caching schemes. We model the request process for objects as a mixture of Poisson and Markov processes with a heavy-tailed noise. We focus on the hit probability as a main characteristic of a caching rule and introduce cache effectiveness as a new metric. Then the dependence of the hit probability on the cache size is studied by simulation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Analysis and Simulation of UHF RFID Vehicle Identification System

Nächstes Kapitel Transient Change Detection in Mixed Count and Continuous Random Data and the Cyber-Physical Systems Security

Che, H., Tung, Y., Wang, Z.: Hierarchical web caching systems: modeling, design and experimental results. IEEE JSAC 20(7), 1305–1314 (2002)

Lee, D., Choi, J., Kim, J.-H., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput. 50(12), 1352–1362 (2001)MathSciNetCrossRef

Berger, D.S., Gland, P., Singla, S., Ciucu, F.: Exact analysis of TTL cache networks: the case of caching policies driven by stopping times. In: 2014 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2014, pp. 595–596 (2014)

Fofack, N.C., Nain, P., Neglia, G., Towsley, D.: Analysis of TTL-based cache networks. In: 6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS), pp. 1–10 (2012)

Friecker, C., Robert, P., Roberts, J.: A versatile and accurate approximation for LRU cache performance. In: Proceedings of ITC 2012, pp. 1–8 (2012)

Markovich, N.M.: Modeling clusters of extreme values. Extremes 17(1), 97–125 (2014)MathSciNetCrossRefMATH

Markovich, N.: A cluster caching rule in next generation networks. In: Vishnevsky, V., Kozyrev, D. (eds.) DCCN 2015. CCIS, vol. 601, pp. 305–313. Springer, Heidelberg (2016). doi:10.1007/978-3-319-30843-2_32 CrossRef

Markovich, N.M., Krieger, U.R.: A caching policy driven by clusters of high popularity. In: 7th IEEE International Workshop on TRaffic Analysis and Characterization (TRAC 2016), 5–9 September, Paphos, Cyprus (2016)

Rizzo, L., Vicisano, L.: Replacement policies for a proxy cache. IEEE/ACM Trans. Netw. 8(2), 158–170 (2000)CrossRef

10.

Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: IEEE Proceedings of Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1999), vol. 1, pp. 126–134 (1999)

11.

Jelenković, P.R., Radovanović, A.: The persistent-access-caching algorithms. Random Struct. Algorithms 33, 219–251 (2008)MathSciNetMATH

12.

Jelenković, P.R.: Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities. Ann. Appl. Probab. 9, 430–464 (1999)MathSciNetCrossRefMATH

13.

Jelenković, P.R., Radovanović, A.: Least-recently-used caching with dependent requests. Theor. Comput. Sci. 326(1–3), 293–327 (2004)MathSciNetCrossRefMATH

14.

Jelenković, P.R., Radovanović, A.: Asymptotic optimality of the static frequency caching in the presence of correlated requests. Oper. Res. Lett. 37(5), 307–311 (2009)MathSciNetCrossRefMATH

15.

Osogami, T.: A fluid limit for a cache algorithm with general request processes. Adv. Appl. Probab. 42, 816–833 (2010)MathSciNetCrossRefMATH

16.

Dehghan, M., Massoulie, L., Towsley, D., Menasche, D., Tay, Y.C.: A utility optimization approach to network cache design, pp. 1–11 (2016). arXiv: 1601.06838v1

17.

Ferro, C.A.T., Segers, J.: Inference for clusters of extreme values. J. Roy. Statist. Soc. Ser. B 65, 545–556 (2003)MathSciNetCrossRefMATH

18.

Leadbetter, M.R., Lingren, G., Rootzén, H.: Extremes and Related Properties of Random Sequence and Processes. Springer, Heidelberg (1983)CrossRef

19.

Großmann, M., Eiermann, A., Renner, M.: Hypriot cluster lab: an ARM-powered cloud solution utilizing docker. In: 23rd International Conference on Telecommunications (ICT 2016), 16–18 May, Thessaloniki, Greece (2016)

20.

Großmann, M., Eiermann, A.: Security of distributed container based service clustering with hypriot cluster lab. In: Proceedings of ITC 28, September 12–16, Würzburg, Germany (2016)

21.

Pahl, C., Lee, B.: Containers and clusters for edge cloud architectures - a technology review. In: 3rd International Conference on Future Internet of Things and Cloud (FiCloud), 24–26 August 2015, pp. 379–386 (2015)

Titel: Modeling and Performance Comparison of Caching Strategies for Popular Contents in Internet
verfasst von: Natalia M. Markovich
Vladimir Khrenov
Udo R. Krieger
Verlag: Springer International Publishing
Buch: Distributed Computer and Communication Networks
Print ISBN: 978-3-319-51916-6

Electronic ISBN: 978-3-319-51917-3

Copyright-Jahr: 2016
DOI: https://doi.org/10.1007/978-3-319-51917-3_5

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"