On the Asymptotic Content Routing Stretch in Network of Caches: Impact of Popularity Learning

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).

[1]  Li Qiu,et al.  Popularity-Aware Caching Increases the Capacity of Wireless Networks , 2020, IEEE Transactions on Mobile Computing.

[2]  Massimo Gallo,et al.  Bandwidth and storage sharing performance in information centric networking , 2011, ICN '11.

[3]  Leandros Tassiulas,et al.  Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[4]  Stratis Ioannidis,et al.  Adaptive Caching Networks With Optimality Guarantees , 2016, IEEE/ACM Transactions on Networking.

[5]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM 2007.

[6]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

[7]  Li Qiu,et al.  Cache increases the capacity of wireless networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[8]  Hamid R. Sadjadpour,et al.  On the throughput capacity of information-centric networks , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[9]  Pietro Michiardi,et al.  Cache policies for linear utility maximization , 2017, INFOCOM.

[10]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[11]  Laurent Massoulié,et al.  Epidemics and Rumours in Complex Networks: Index , 2009 .

[12]  Niloy Ganguly,et al.  Identifying and Characterizing Sleeping Beauties on YouTube , 2016, CSCW '16 Companion.

[13]  Hao Che,et al.  Analysis and design of hierarchical Web caching systems , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Yong-Yeol Ahn,et al.  Analyzing the Video Popularity Characteristics of Large-Scale User Generated Content Systems , 2009, IEEE/ACM Transactions on Networking.

[15]  Massimo Gallo,et al.  Modeling data transfer in content-centric networking , 2011, 2011 23rd International Teletraffic Congress (ITC).

[16]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Sharayu Moharir,et al.  Serving content with unknown demand: the high-dimensional regime , 2014, Queueing Systems.

[18]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[19]  George Pavlou,et al.  Modelling and Evaluation of CCN-Caching Trees , 2011, Networking.

[20]  Michele Garetto,et al.  A unified approach to the performance analysis of caching systems , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[21]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[22]  James F. Kurose,et al.  On the steady-state of cache networks , 2013, 2013 Proceedings IEEE INFOCOM.

[23]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[24]  Hamid R. Sadjadpour,et al.  On the Throughput Capacity of Wireless Information-Centric Networks , 2013 .

[25]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).