skip to main content
research-article

Temporal locality in today's content caching: why it matters and how to model it

Published: 04 November 2013 Publication History

Abstract

The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of \youtube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being sufficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.

References

[1]
V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking named content. In ACM CoNEXT, 2009.
[2]
C. Fricker, P. Robert, J. Roberts, and N. Sbihi. Impact of traffic mix on caching performance in a content-centric network. In NOMEN Workshop, 2012.
[3]
J. Erman, A. Gerber, M. Hajiaghayi, D. Pei, S. Sen, and O. Spatscheck. To cache or not to cache: the 3G case. IEEE Internet Computing, 15(2), March 2011.
[4]
F. Qian, K. S. Quah, J. Huang, J. Erman, A. Gerber, Z. Mao, S. Sen, and O. Spatscheck. Web caching on smartphones: ideal vs. reality. In ACM MobiSys, 2012.
[5]
U. Lee, I. Rimac, D. Kilper, and V. Hilt. Toward energy-efficient content dissemination. IEEE Network, March 2011.
[6]
W. Jiang, S. Ioannidis, L. Massoulié, and F. Picconi. Orchestrating massively distributed CDNs. In ACM CoNEXT, 2012.
[7]
I. Poese, B. Frank, G. Smaragdakis, S. Uhlig, A. Feldmann, and B. Maggs. Enabling content-aware traffic engineering. ACM SIGCOMM CCR, Sep. 2012.
[8]
J. Erman, A. Gerber, M. T. Hajiaghayi, D. Pei, and O. Spatscheck. Network-aware forward caching. In ACM WWW, 2009.
[9]
E. Coffman and P. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cliffs (NJ), 1973.
[10]
C. Fricker, P. Robert, and J. Roberts. A versatile and accurate approximation for LRU cache performance. In ITC, 2012.
[11]
B. Ager, F. Schneider, J. Kim, and A. Feldmann. Revisiting cacheability in times of user generated content. In IEEE Global Internet Symposium, March 2010.
[12]
N. Laoutaris, G. Zervas, A. Bestavros, and G. Kollios. The cache inference problem and its application to content and request routing. In IEEE INFOCOM, 2007.
[13]
S. Vanichpun and A. M. Makowski. The output of a cache under the independent reference model: where did the locality of reference go? ACM SIGMETRICS Perform. Eval. Rev., Jun. 2004.
[14]
V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing reference locality in the WWW. In IEEE PDIS, 1996.
[15]
S. Jin and A. Bestavros. Sources and characteristics of Web temporal locality. In IEEE/ACM Mascots, 2000.
[16]
R. Fonseca, V. Almeida, M. Crovella, and B. Abrahao. On the intrinsic locality of Web reference streams. In IEEE INFOCOM, 2003.
[17]
P. R. Jelenković and A. Radovanović. Least-recently-used caching with dependent requests. Theoretical computer science, 326(1):293--327, 2004.
[18]
E. Rosensweig, D. Menasche, and J. Kurose. On the steady-state of cache networks. In IEEE INFOCOM, 2013.
[19]
P. R. Jelenković and A. Radovanović. The persistent-access-caching algorithm. Random Struct. Algorithms, 33(2):219--251, Sept. 2008.
[20]
A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. In ACM SIGMETRICS, 1990.
[21]
H. Che, Y. Tung, and Z. Wang. Hierarchical Web caching systems: modeling, design and experimental results. IEEE JSAC, 20(7), Sept. 2002.
[22]
E. G. Coffman and P. J. Denning. Operating systems theory, volume 973. Prentice-Hall Englewood Cliffs, NJ, 1973.
[23]
K. Kylkoski and J. Virtamo. Cache replacement algorithms for the renewal arrival model. In Fourteenth Nordic Teletraffic Seminar, NTS-14, pages 139--148, Copenhagen, Denmark, Aug. 1998.
[24]
A. Finamore, M. Mellia, M. Meo, M. M. Munaf'o, and D. Rossi. Experiences of Internet traffic monitoring with Tstat. IEEE Network, 2011.
[25]
H. Abrahamsson and M. Nordmark. Program popularity and viewer behaviour in a large tv-on-demand system. In ACM IMC, 2012.
[26]
J. Yang and J. Leskovec. Patterns of temporal variation in online media. In WSDM '11, 2011.
[27]
Y. Matsubara, Y. Sakurai, B. A. Prakash, L. Li, and C. Faloutsos. Rise and fall patterns of information diffusion: model and implications. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 6--14. ACM, 2012.
[28]
M. Ahmed, S. Spagna, F. Huici, and S. Niccolini. A peek into the future: Predicting the evolution of popularity in user generated content. In ACM WSDM, Feb. 2013.
[29]
J. Møller. Shot noise Cox processes. Advances in Applied Probability, 35(3), 2003.
[30]
R. Crane and D. Sornette. Robust dynamic classes revealed by measuring the response function of a social system. Proceedings of the National Academy of Sciences, 105(41):15649--15653, 2008.
[31]
M. Cha, A. Mislove, and K. P. Gummadi. A measurement-driven analysis of information propagation in the Flickr social network. In WWW '09, 2009.
[32]
M. Ahmed, S. Traverso, P. Giaccone, E. Leonardi, and S. Niccolini. Analyzing the performance of LRU caches under non-stationary traffic patterns. CoRR, abs/1301.4909, 2013.
[33]
S. M. Ross. Simulation. Elsevier Academic Press, Amsterdam, 2006.

Cited By

View all
  • (2024)A Survey of Edge Caching: Key Issues and ChallengesTsinghua Science and Technology10.26599/TST.2023.901005129:3(818-842)Online publication date: Jun-2024
  • (2024)Adaptability of Breadcrumbs Routing to Geographical Locality of Content Popularity in Information Centric NetworksIEICE Transactions on Communications10.23919/transcom.2024EBP3085E107-B:11(719-727)Online publication date: Nov-2024
  • (2024)PopDCN: Popularity-Aware Dynamic Clustering Scheme for Distributed Caching in ICNIEICE Transactions on Communications10.23919/transcom.2023EBP3152E107-B:5(398-407)Online publication date: May-2024
  • Show More Cited By

Index Terms

  1. Temporal locality in today's content caching: why it matters and how to model it

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 43, Issue 5
    October 2013
    27 pages
    ISSN:0146-4833
    DOI:10.1145/2541468
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 November 2013
    Published in SIGCOMM-CCR Volume 43, Issue 5

    Check for updates

    Author Tags

    1. caching
    2. cdn

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)47
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 30 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A Survey of Edge Caching: Key Issues and ChallengesTsinghua Science and Technology10.26599/TST.2023.901005129:3(818-842)Online publication date: Jun-2024
    • (2024)Adaptability of Breadcrumbs Routing to Geographical Locality of Content Popularity in Information Centric NetworksIEICE Transactions on Communications10.23919/transcom.2024EBP3085E107-B:11(719-727)Online publication date: Nov-2024
    • (2024)PopDCN: Popularity-Aware Dynamic Clustering Scheme for Distributed Caching in ICNIEICE Transactions on Communications10.23919/transcom.2023EBP3152E107-B:5(398-407)Online publication date: May-2024
    • (2024)Optimal Edge Caching for Individualized Demand DynamicsIEEE/ACM Transactions on Networking10.1109/TNET.2024.336961132:4(2826-2841)Online publication date: Aug-2024
    • (2024)Joint Power Control and Caching for Transmission Delay Minimization in Wireless HetNetsIEEE/ACM Transactions on Networking10.1109/TNET.2023.331967432:2(1477-1492)Online publication date: Apr-2024
    • (2024)Cache Update and Delivery of Dynamic Contents: A Stochastic Game ApproachIEEE Transactions on Mobile Computing10.1109/TMC.2023.327350023:4(3035-3047)Online publication date: 1-Apr-2024
    • (2024)A Combined Trend Virtual Machine Consolidation Strategy for Cloud Data CentersIEEE Transactions on Computers10.1109/TC.2024.341673473:9(2150-2164)Online publication date: 1-Sep-2024
    • (2024)A Machine Learning-Empowered Cache Management Scheme for High-Performance SSDsIEEE Transactions on Computers10.1109/TC.2024.340406473:8(2066-2080)Online publication date: 1-Aug-2024
    • (2024)SwiftOGA: An Efficient and Swift Online Gradient Ascent Algorithm for Caching Replacement2024 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC61673.2024.10733714(1-6)Online publication date: 26-Jun-2024
    • (2024)Energy Budget-Aware Video Quality Management in Transcoding Servers using Deep Reinforcement Learning under Dynamic Popularity Change2024 IEEE 15th International Green and Sustainable Computing Conference (IGSC)10.1109/IGSC64514.2024.00031(122-128)Online publication date: 2-Nov-2024
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media