On the Delay Scaling Laws of Cache Networks

The Internet is becoming more and more content-oriented. CDN (Content Distribution Networks) has been a popular architecture compatible with the current Internet, and a new revolutionary paradigm such as ICN (Information Centric Networking) has studied. One of the main components in both CDN and ICN is considering cache on network. Despite a surge of extensive use of cache in the current and future Internet architectures, analysis on the performance of general cache networks are still quite limited due to complex inter-plays among various components and thus analytical intractability. Due to mathematical tractability, we consider 'static' cache policies and study asymptotic delay performance of those policies in cache networks, in particular, focusing on the impact of heterogeneous content popularities and nodes' geographical 'importances' in caching policies. Furthermore, our simulation results suggest that they perform quite similarly as popular 'dynamic' policies such as LFU (Least-Frequently-Used) and LRU (Least-Recently-Used). We believe that our theoretical findings provide useful engineering implications such as when and how various factors have impact on caching performance.

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

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

[3]  Pablo Rodriguez,et al.  Analysis of web caching architectures: hierarchical and distributed caching , 2001, TNET.

[4]  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).

[5]  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.

[6]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[7]  P. Jelenkovic,et al.  Near optimality of the discrete persistent access caching algorithm , 2004 .

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

[9]  Jürgen Quittek,et al.  The way 4WARD to the creation of a future internet , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[10]  Wenzhong Li,et al.  Supporting VCR-Like Operations in Derivative Tree-Based P2P Streaming Systems , 2009, 2009 IEEE International Conference on Communications.

[11]  L. Massoulié,et al.  Epidemics and Rumours in Complex Networks: From microscopic to macroscopic dynamics , 2009 .

[12]  Minghua Chen,et al.  P2P Streaming Capacity under Node Degree Bound , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

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

[14]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[15]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[16]  Pekka Nikander,et al.  Developing Information Networking Further: From PSIRP to PURSUIT , 2010, BROADNETS.

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

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

[19]  Ning Wang,et al.  COMET: Content mediator architecture for content-aware networks , 2011, 2011 Future Network & Mobile Summit.

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

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

[22]  Minghua Chen,et al.  An optimized distributed video-on-demand streaming system: Theory and design , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[24]  Dario Rossi,et al.  On sizing CCN content stores by exploiting topological information , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[25]  Leandros Tassiulas,et al.  Asymptotic laws for content replication and delivery in wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.

[26]  Raouf Boutaba,et al.  A survey of naming and routing in information-centric networks , 2012, IEEE Communications Magazine.

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

[28]  Massimo Gallo,et al.  Performance evaluation of the random replacement policy for networks of caches , 2012, SIGMETRICS '12.

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

[30]  Hamid R. Sadjadpour,et al.  Fundamental Limits on Throughput Capacity in Information-Centric Networks , 2016, IEEE Transactions on Communications.

[31]  Hamid R. Sadjadpour,et al.  Scaling Laws of the Throughput Capacity and Latency in Information-Centric Networks , 2016 .