Abstract
In this paper, we study the asymptotic average routing stretch for random content requests in a general network of caches. The key factor considered in our study is the need of learning content popularity in an online manner to consider time-varying changes of content popularity, where there exists a complex inter-play among (a) how long we should learn popularity, (b) how often we should change cached contents, and (c) how we use learnt popularity in caching contents over the network. We model this inter-play in a broad class of caching policies, called Repeated Learning and Placement (RLP), and aim at quantifying the asymptotic routing stretch of content requests under various external conditions. Our derivation of this scaling law in the routing stretch is made under different dependence of the speed of popularity change, average routing stretch in the network of caches, the shape of the popularity distribution, and heterogeneous cache budget allocation based on nodes’ geometric importance. We believe that our analytical results, even if they are asymptotic, provide additional ways and implications on understanding the delay performance of large-scale content distribution network (CDN) and information-centric network (ICN).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This assumption does not restrict our results, because even when per-content multiple repositories exist, our asymptotic results hold as long as the number of repositories is \(\varTheta (1).\)
- 2.
d is also a random variable since a chosen content is also random.
References
The Internet topology zoo. http://www.topology-zoo.org/dataset.html
Azimdoost, B., Westphal, C., Sadjadpour, H.R.: On the throughput capacity of information-centric networks. In: Proc. ICT (2013)
Carofiglio, G., Gallo, M., Muscariello, L., Perino, D.: Modeling data transfer in content-centric networking. In: Proc. ITC (2011)
Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.Y., Moon, S.: Analyzing the video popularity characteristics of large-scale user generated content systems. IEEE Transactions on Networking 17(5), 1357–1370 (2009)
Che, H., Wang, Z., Tung, Y.: Analysis and design of hierarchical Web caching systems. In: Proc. IEEE Infocom (2001)
Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. National Academy of Sciences 99(25), 15879–15882 (2002)
Dan, A., Towsley, D.: An approximate analysis of the LRU and FIFO buffer replacement schemes. Performance Evaluation Review 18(1), 143–152 (1990)
Draief, M., Massouli, L.: Epidemics and rumours in complex networks. Cambridge University Press (2010)
Fricker, C., Robert, P., Roberts, J.: A versatile and accurate approximation for LRU cache performance. In: Proc. ITC (2012)
Garetto, M., Leonardi, E., Martina, V.: A unified approach to the performance analysis of caching systems. ACM TOMPECS 1(3), 12 (2016)
Gitzenis, S., Paschos, G.S., Tassiulas, L.: Asymptotic laws for joint content replication and delivery in wireless networks. IEEE Transactions on Information Theory 59(5), 2760–2776 (2013)
Ioannidis, S., Yeh, E.: Adaptive caching networks with optimality guarantees. In: Proc. ACM SIGMETRICS (2016)
Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: Proc. ACM CoNext (2009)
Jelenković, P.: Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities. The Annals of Applied Probability 9(2), 430–464 (1999)
Jin, B., Woo, J., Yi, Y.: On the asymptotic content routing stretch in network of caches: Impact of popularity learning. Tech. rep., KAIST, South Korea (2018), http://lanada.kaist.ac.kr/pub/cache.pdf
Koponen, T., Chawla, M., Chun, B.G., Ermolinskiy, A., Kim, K.H., Shenker, S., Stoica, I.: A data-oriented (and beyond) network architecture. In: Proc. ACM SIGCOMM (2007)
Moharir, S., Ghaderi, J., Sanghavi, S., Shakkottai, S.: Serving content with unknown demand: the high-dimensional regime. In: Proc. ACM SIGMETRICS (2014)
Muscariello, L., Carofiglio, G., Gallo, M.: Bandwidth and storage sharing performance in information centric networking. In: Proc. ACM SIGCOMM workshop on Information-centric networking (2011)
Neglia, G., Carra, D., Michiardi, P.: Cache policies for linear utility maximization. In: Proc. IEEE Infocom (2017)
Psaras, I., Clegg, R.G., Landa, R., Chai, W.K., Pavlou, G.: Modelling and evaluation of CCN-caching trees. In: Proc. NETWORKING. Springer (2011)
Qiu, L., Cao, G.: Cache increases the capacity of wireless networks. In: Proc. IEEE Infocom (2016)
Qiu, L., Cao, G.: Popularity aware caching increases the capacity of wireless networks. In: Proc. IEEE Infocom (2017)
Rosensweig, E., Kurose, J., Towsley, D.: Approximate models for general cache networks. In: Proc. IEEE Infocom (2010)
Rosensweig, E.J., Menasche, D.S., Kurose, J.: On the steady-state of cache networks. In: Proc. IEEE Infocom (2013)
Sikdar, S., Chaudhary, A., Kumar, S., Ganguly, N., Chakraborty, A., Kumar, G., Patil, A., Mukherjee, A.: Identifying and characterizing sleeping beauties on youtube. In: Proc. ACM CSCW (2016)
Acknowledgements
This work was supported by Institute for Information & Communications Technology Promotion (IITP) grant funded by the Korean government (MSIT) (No.2018-0-00170, Virtual Presence in Moving Objects through 5G and No.2016-0-00160, Versatile Network System Architecture for Multi-dimensional Diversity).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Jin, B., Woo, J., Yi, Y. (2019). On the Asymptotic Content Routing Stretch in Network of Caches: Impact of Popularity Learning. In: Walrand, J., Zhu, Q., Hayel, Y., Jimenez, T. (eds) Network Games, Control, and Optimization. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-10880-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-10880-9_9
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-10879-3
Online ISBN: 978-3-030-10880-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)